{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"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":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"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":"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":"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":"write-commands.handleWriteCommand (cyclomatic 386): write-commands.handleWriteCommand has cyclomatic complexity 386 (threshold 15). Of this number, 318 points are the body\u0027s own statements and 68 belong to 17 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e94aae3a4f90d8121ae83552ac3fee0afe500298fdb422b5b30b90c58a2dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-commands.handleMetaCommand (cyclomatic 192): meta-commands.handleMetaCommand has cyclomatic complexity 192 (threshold 15). Of this number, 168 points are the body\u0027s own statements and 24 belong to 10 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":"browse/src/meta-commands.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e6f2b5bf97d811a1a205b69e40549da015e862980754eaeee1dc512ea66def"}},{"ruleId":"D1","level":"warning","message":{"text":"review-ledger.parseLabelled (cyclomatic 177): review-ledger.parseLabelled has cyclomatic complexity 177 (threshold 15). Of this number, 132 points are the body\u0027s own statements and 45 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2011b3e4776ec58648868563c184426cb6a99ec7da3cba4af878414ae859f086"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.handleSnapshot (cyclomatic 156): snapshot.handleSnapshot has cyclomatic complexity 156 (threshold 15). Of this number, 112 points are the body\u0027s own statements and 44 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":"browse/src/snapshot.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d2c19d817ad5b8104772a8c354ed275a21d76c898c8ab044044646fc723adc"}},{"ruleId":"D1","level":"warning","message":{"text":"read-commands.handleReadCommand (cyclomatic 140): read-commands.handleReadCommand has cyclomatic complexity 140 (threshold 15). Of this number, 89 points are the body\u0027s own statements and 51 belong to 17 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"226d5a5c3a0b65e58baebc01fbbedac83fa39b89935c39e4102e7fea612591fa"}},{"ruleId":"D1","level":"warning","message":{"text":"review-ledger.verify (cyclomatic 125): review-ledger.verify has cyclomatic complexity 125 (threshold 15). Of this number, 102 points are the body\u0027s own statements and 23 belong to 12 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"40438a8daee790a8ae2a27aa32ed73e1235773b03331e833c61f55be62b1a325"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.validateRepairBundle (cyclomatic 111): verification.validateRepairBundle has cyclomatic complexity 111 (threshold 15). Of this number, 106 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f46a56db2810228aeb17ac3db462e153c724683eeb4b3176d00ae35c9d1e5c7"}},{"ruleId":"D1","level":"warning","message":{"text":"review-scope.summarizeReviewLoop (cyclomatic 107): review-scope.summarizeReviewLoop has cyclomatic complexity 107 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 44 belong to 19 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":"lib/review-scope.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ffd8db45615f111036a1a7fd7bcb62576bece8743cd07b8037d7d72e290677"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-public-transcript.readPlanCountTranscript (cyclomatic 98): claude-public-transcript.readPlanCountTranscript has cyclomatic complexity 98 (threshold 15). Of this number, 90 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":"lib/claude-public-transcript.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"32476596e55d5a1c7a08311c0910a926382679803253eb6311b55a01896d70aa"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-design-detect.probe (cyclomatic 94): gstack-design-detect.probe has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent 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 (gstack-design-detect.probe::checkSkillDir) 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":"bin/gstack-design-detect.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e217fc6e8ff6ada255520098aa4e7bd0c4f8b2005920469a0d241d4ddd15e058"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerGroup.createContainer (cyclomatic 93): DockerGroup.createContainer has cyclomatic complexity 93 (threshold 15). Of this number, 81 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fd1e72f3e702faabe52a596387cd18a51ca99e63392dfe8d1d85b8bb9f3321"}},{"ruleId":"D1","level":"warning","message":{"text":"harness-register.register (cyclomatic 93): harness-register.register has cyclomatic complexity 93 (threshold 15). Of this number, 82 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":"lib/harness-register.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9cf06169b56f356f17d6e81d905f7a501311d6ca0090d8fb53edf06811f6ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land.land (cyclomatic 92): ship-queue-land.land has cyclomatic complexity 92 (threshold 15). Of this number, 81 points are the body\u0027s own statements and 11 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":"lib/ship-queue-land.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea03563df96163643ebae38ef7d7fa8b8ae118d6696d038e12c327e0e8398bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-catalog.validateRuntimeCatalog (cyclomatic 91): runtime-catalog.validateRuntimeCatalog has cyclomatic complexity 91 (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":"lib/cso/runtime-catalog.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eb12ea1edea3b010243d53c37569cd7e27159618eb37846fc319f39dcd1999"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.validatePolicy (cyclomatic 89): ship-policy.validatePolicy has cyclomatic complexity 89 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd003ef7ca8c81f89e6a63e0053aa5090e9a08dc3fe3d3033d1e30694023797"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-gate.answerGate (cyclomatic 85): autoplan-gate.answerGate has cyclomatic complexity 85 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 22 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c62e03c2178d52656c88757dd463b1ae8b77e8542f9ab03c323935772ddb42"}},{"ruleId":"D1","level":"warning","message":{"text":"lane-selection.selectLanes (cyclomatic 83): lane-selection.selectLanes has cyclomatic complexity 83 (threshold 15). Of this number, 76 points are the body\u0027s own statements and 7 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"666d6112cadd42b83bff5c3f86586b7d59bcdd82df985767d20e3dd1ec4b18cf"}},{"ruleId":"D1","level":"warning","message":{"text":"config.validateConfig (cyclomatic 82): config.validateConfig has cyclomatic complexity 82 (threshold 15). Of this number, 77 points are the body\u0027s own statements and 5 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d0a71986235c035c3518e3c5feff03469bae885038a41eb0f602b04d22500f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.route (cyclomatic 81): ship-release.route has cyclomatic complexity 81 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 6 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":"lib/ship-release.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"64acc4ff36aa0254628001b8f1d934cb166b0e237992ca79780c235e0ff4f748"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent.buildServer (cyclomatic 80): terminal-agent.buildServer has cyclomatic complexity 80 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 16 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1dccedae8cdb3e642efe18edb3c42cdd670085a455dedef886fc9d04149c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 79): cli.main has cyclomatic complexity 79 (threshold 15). Of this number, 76 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"331b853214f568290606ce7abe30ec9e0cddeb0a7eb987a67012615fcd535d32"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-docker.materializePreparedExport (cyclomatic 79): preparation-docker.materializePreparedExport has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa655b9ade3bc9c670bb1e836b4ce5a692ef28f099d3a5b7c6d78799380acb1f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.version (cyclomatic 79): ship-release.version has cyclomatic complexity 79 (threshold 15). Of this number, 77 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":"lib/ship-release.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363d963a6da76ac06c88829567020566dc4e5d6c03220298397bba8fc11116d"}},{"ruleId":"D1","level":"warning","message":{"text":"gen-accessors.parseFields (cyclomatic 78): gen-accessors.parseFields has cyclomatic complexity 78 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9763bcda5a75da541ed97e434f3350fe718fc5579d64562d8ef7fc10b961952d"}},{"ruleId":"D1","level":"warning","message":{"text":"run-evidence.verifyRun (cyclomatic 77): run-evidence.verifyRun has cyclomatic complexity 77 (threshold 15). Of this number, 72 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":"lib/run-evidence.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ebb0c97033b77a74cf208eb1bb3083ff96410965168524cca560459d68b8b6"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.planReview (cyclomatic 76): review-depth.planReview has cyclomatic complexity 76 (threshold 15). Of this number, 70 points are the body\u0027s own statements and 6 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":"lib/review-depth.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bdc40f41a3fb0cf4354701e5191e2c261f7f644696d150dff21f2a0ce22010"}},{"ruleId":"D1","level":"warning","message":{"text":"run-evidence.runProfileErrors (cyclomatic 76): run-evidence.runProfileErrors has cyclomatic complexity 76 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 9 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":"lib/run-evidence.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"de735268f8f3d748767a1658271e63186dfea9070bea2e47317fcdaca742ba31"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.docsFresh (cyclomatic 75): ship-release.docsFresh has cyclomatic complexity 75 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 33 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"39675ef54ebed94191c224eb589ea4c18bede598ffd7b984c6db082405cc4460"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.capture (cyclomatic 72): snapshot.capture has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (snapshot.capture::assertEntriesStable) 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":"lib/cso/snapshot.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb14cc4de18318ee62db8385b4db165ff1d06a4cc00d5d70f988bfa9c492beb"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.verifyRepair (cyclomatic 72): verification.verifyRepair has cyclomatic complexity 72 (threshold 15). Of this number, 71 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":"lib/cso/verification.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"2188cfd4ef76aac7bbabfa1ce82c406d1452107794776859ff4980aca9616d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"release-cut.planRelease (cyclomatic 69): release-cut.planRelease has cyclomatic complexity 69 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13501ee18560728a45d86bb32a50d4b805a86fc74aed797fd35ac2b84adb85e"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.assertSnapshot (cyclomatic 67): snapshot.assertSnapshot has cyclomatic complexity 67 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 29 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"6896e70ed633828692184775a799ec92cc9d751645a677f7e5b51df4563b90eb"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-code-migration.migrateClaudeCodeSkills (cyclomatic 64): claude-code-migration.migrateClaudeCodeSkills has cyclomatic complexity 64 (threshold 15). Of this number, 59 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":"lib/claude-code-migration.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"50935e61c7e1aa147a9f13ee67c16b4eb019701eddcca79d6a1afcfbef17da61"}},{"ruleId":"D1","level":"warning","message":{"text":"server.handleCommandInternalImpl (cyclomatic 62): server.handleCommandInternalImpl has cyclomatic complexity 62 (threshold 15). Of this number, 59 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":"browse/src/server.ts"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb9f273ae6fed151ce088381ab40c406febdd82c2b3ce9642eee808811f4336"}},{"ruleId":"D1","level":"warning","message":{"text":"state.scanRunLeases (cyclomatic 62): state.scanRunLeases has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf48908aaded525d8becede1f00a42ecd4107fbd3460422c8a090a0195e51d76"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-revise.reviseRun (cyclomatic 61): autoplan-revise.reviseRun has cyclomatic complexity 61 (threshold 15). Of this number, 57 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":"lib/autoplan-revise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9347b5df0977122aac2bd26c7d374b541c997bab376fa577d9fe59ed2ed9a6"}},{"ruleId":"D1","level":"warning","message":{"text":"cdp-inspector.inspectElement (cyclomatic 60): cdp-inspector.inspectElement has cyclomatic complexity 60 (threshold 15). Of this number, 59 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":"browse/src/cdp-inspector.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e38e38c1c8a6c85ff028e14f2eedd87593289c75c232379b6d59f5d0d0771"}},{"ruleId":"D1","level":"warning","message":{"text":"index.clearByRuns (cyclomatic 60): index.clearByRuns has cyclomatic complexity 60 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d7368bda84cbd233fe7ba1a12fb17aafb0cebdb03b68ceea3b8f5022323f37"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-reuse.findReusableGate (cyclomatic 60): gate-reuse.findReusableGate has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6487ab4ad1e5bd0481ba4bd2d8931bb6ab06af092c93c2b8671ccb000156414"}},{"ruleId":"D1","level":"warning","message":{"text":"witness.testExecutionSummary (cyclomatic 60): witness.testExecutionSummary has cyclomatic complexity 60 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9799cfa2277bd0698803599a51d918cf4a54aac4efb6769b883f8bc3d0297fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-journal-records.ownedCausalOrder (cyclomatic 59): claude-journal-records.ownedCausalOrder has cyclomatic complexity 59 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 20 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0e9238521d342583d07de2f7d9362b2be46dd9a8353a217d87b67f71618719"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-picker-routes.handleCookiePickerRoute (cyclomatic 59): cookie-picker-routes.handleCookiePickerRoute has cyclomatic complexity 59 (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":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb11c7ff9a89f28658bf03a4337a4d401bddf24c7b14a751a744e8862673e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"review-fetch.scanWords (cyclomatic 59): review-fetch.scanWords has cyclomatic complexity 59 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f7751b897d4850b3df8fd925f40214331db96153432b48426496efd0c8a392"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land-direct.landDirect (cyclomatic 59): ship-queue-land-direct.landDirect has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ship-queue-land-direct.landDirect::locked) 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd5d00751746df3a3c7139c26d1c13f5efb0311892954f00f9e631bbde576e"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.certify (cyclomatic 57): verification.certify has cyclomatic complexity 57 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1dcc50314e5d8ba203d9da951599ba2085621412768fc62bc3070722b889f3"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-owned-journal.readOwnedClaudePublicTranscript (cyclomatic 56): claude-owned-journal.readOwnedClaudePublicTranscript has cyclomatic complexity 56 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 15 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":"lib/claude-owned-journal.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90982bb00c30c2a37a405013091f541cafe1064bd81273aa648760782937c5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.clearDecision (cyclomatic 56): index.clearDecision has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cad09dea852acb794838185621250788c8bef8edc00b679435db55bc13bf41e"}},{"ruleId":"D1","level":"warning","message":{"text":"flaky-run.runFlaky (cyclomatic 56): flaky-run.runFlaky has cyclomatic complexity 56 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 13 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":"lib/flaky-run.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"587cc9fa825988d0ce177e5170ca49310ec73c80486c70f4452572bca81cf9ba"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-gbrain-read-capability.readCapability (cyclomatic 55): gstack-gbrain-read-capability.readCapability has cyclomatic complexity 55 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-gbrain-read-capability.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"86afc56c2e7e4e776219d90c7bfae2336acb8b9a5412df9016f77d39e1f935c3"}},{"ruleId":"D1","level":"warning","message":{"text":"review-evidence.bindReview (cyclomatic 55): review-evidence.bindReview has cyclomatic complexity 55 (threshold 15). Of this number, 54 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":"lib/review-evidence.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86bf81393621b9a2fb7aef0861412f844c9742c5fcde77a2c37eb972d94af83"}},{"ruleId":"D1","level":"warning","message":{"text":"forceRestart (cyclomatic 54): forceRestart has cyclomatic complexity 54 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 29 belong to 7 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc397ba0949b43645c99fa6a066f07123e37f3967a7bb826e0857e9f4c81e417"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparationExecutor.acquire (cyclomatic 53): PreparationExecutor.acquire has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0ded940429381853eaab622f5aadfc97e2e13b9f2772e0f8afb938e06f0ede"}},{"ruleId":"D1","level":"warning","message":{"text":"design-build.receipt (cyclomatic 53): design-build.receipt has cyclomatic complexity 53 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 23 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c66e62e0b798364110b315f718369db8686908ae631ef16a0d641fa38bdbbb"}},{"ruleId":"D1","level":"warning","message":{"text":"inventory.validateEntry (cyclomatic 53): inventory.validateEntry has cyclomatic complexity 53 (threshold 15). Of this number, 50 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":"lib/inventory.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0c1ea6c4c788789a990163709d970336d9c596777385474a753f3f000537d2"}},{"ruleId":"D1","level":"warning","message":{"text":"server.start (cyclomatic 52): server.start has cyclomatic complexity 52 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 10 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"f671b20a23e29c08562abb2c8212d08e0afb63dbd46a019d3e389c4c90405673"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-receipt.buildReceipt (cyclomatic 52): tree-receipt.buildReceipt has cyclomatic complexity 52 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 6 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":"lib/tree-receipt.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1089564cf812877ee7f1cf810a56f93135fdc1a7d86d10c0387ea552f1a5d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-docs-result.checkDocsResult (cyclomatic 52): ship-docs-result.checkDocsResult has cyclomatic complexity 52 (threshold 15). Of this number, 51 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":"lib/ship-docs-result.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd5e96ccb3f35a42af6ae78609586869058815e6b7215d3f7351487fea72c5"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-operation.runCookieImport (cyclomatic 51): cookie-import-operation.runCookieImport 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":"browse/src/cookie-import-operation.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc824d4801d8842a00f264fc4d863634ee210f3c8385aabaccabd8d8e2e86d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"lanes.runSelected (cyclomatic 51): lanes.runSelected has cyclomatic complexity 51 (threshold 15). Of this number, 50 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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceceb66d470a8108a8141eae9556b032accffed6da19c0723300a6dcfe4f9c35"}},{"ruleId":"D1","level":"warning","message":{"text":"version-gate-train.classify (cyclomatic 51): version-gate-train.classify has cyclomatic complexity 51 (threshold 15). Of this number, 49 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":"crew/lib/version-gate-train.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b6ae102d1f44f6d7a3263b2bbc55ded0e56a0e62b41d7b89a189dd54ff479b"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.ready (cyclomatic 51): ship-queue.ready 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":"lib/ship-queue.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafe704834193fd412fc5add3905754a1e8a3093a68cddbcf89507f10f6699ca"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-docker.superviseRegistrySocket (cyclomatic 51): preparation-docker.superviseRegistrySocket has cyclomatic complexity 51 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 15 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"0732758ce0237785e97d5d12ccb0b9cea122659da470d6589c7793333edb90ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.finishStages (cyclomatic 51): ship-release.finishStages has cyclomatic complexity 51 (threshold 15). Of this number, 50 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":"lib/ship-release.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1871f660d82c8e3a3d1f3643b7ae321ddbe2f619dacad286edf1866682ae70"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-autoplan-snapshot.initializePlan (cyclomatic 50): gstack-autoplan-snapshot.initializePlan has cyclomatic complexity 50 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 18 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8568eeb74036bcc3408d7cbc3ee012bd08eff19e7b48eb585bfa2160f4a7415f"}},{"ruleId":"D1","level":"warning","message":{"text":"media-extract.extractMedia (cyclomatic 50): media-extract.extractMedia has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 3 of the 50 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 75, 88, 110, \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":"browse/src/media-extract.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9be8f6b7d9b93fbcdd905de6aa729ba814380ba26d96f5b4d56f31addab9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog-check.carryWith (cyclomatic 50): changelog-check.carryWith has cyclomatic complexity 50 (threshold 15). Of this number, 33 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":"lib/changelog-check.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d511a778115b2e1192bf2e65ede4c033aa921641449768db45e6aee3815b6ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-ready.trainReady (cyclomatic 50): ship-queue-train-ready.trainReady 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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"704a31aefcd7f036083ca7f5982d3628f9a6e7a3a8a096e6b7191ecf3047d60a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.mergeSplit (cyclomatic 50): gstack-post.mergeSplit has cyclomatic complexity 50 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 17 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":"lib/gstack-post.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c42b7127b806cafd019992aa7c625d144650e3a0c414df688ccf1f7579f7386"}},{"ruleId":"D1","level":"warning","message":{"text":"model-policy-freshness.assessFreshness (cyclomatic 50): model-policy-freshness.assessFreshness 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":"lib/model-policy-freshness.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"90559a18b1ce8886412210a08e19fc865eeff94d39e05eb58a4875e1408f353d"}},{"ruleId":"D1","level":"warning","message":{"text":"guard-journal.select.\u003Creturned closure\u003E (cyclomatic 48): guard-journal.select.\u003Creturned closure\u003E has cyclomatic complexity 48 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 11 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":"autoplan/bin/guard-journal.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa154438588bd116388e8a5a728b79f2cdcce7a84bd78288ebc07f18eee3f13a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-gbrain-sync.runCodeImport (cyclomatic 48): gstack-gbrain-sync.runCodeImport has cyclomatic complexity 48 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8770ae8092b4ddb0fc692edd7a51a13fd40d8f81f82fc1bb4e9e8c177904fcea"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-carry.assess (cyclomatic 48): autoplan-carry.assess has cyclomatic complexity 48 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-carry.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23b9ba8439deadd2dbd3f485d50f2c2e994ad9f56266153e10615e593d188ec"}},{"ruleId":"D1","level":"warning","message":{"text":"shell-writes.writeTargets (cyclomatic 48): shell-writes.writeTargets has cyclomatic complexity 48 (threshold 15). Of this number, 45 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":"lib/shell-writes.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2103f300e67ef0c96ca4a0c6de560d1fe639eca5ac3deceef33429fcdf94abd"}},{"ruleId":"D1","level":"warning","message":{"text":"question-preference-hook.main (cyclomatic 48): question-preference-hook.main has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c9d5b149b2a5f8ddbb3f6089ad463787b6a010793c90998460e056e73430c"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner-catalog.validateQualifiedScanner (cyclomatic 48): scanner-catalog.validateQualifiedScanner has cyclomatic complexity 48 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-catalog.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef4cf563149825320aa0caee31d1ce1bedfc98af5b88b09940057da9c2a3e0c"}},{"ruleId":"D1","level":"warning","message":{"text":"model-policy-cli.modelsMain (cyclomatic 48): model-policy-cli.modelsMain has cyclomatic complexity 48 (threshold 15). Of this number, 47 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":"lib/model-policy-cli.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"452485626b4134c5fec84d2c8302245e30219c48fe226ca433c84a2254e8b44c"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-reconcile.reconcile (cyclomatic 47): autoplan-reconcile.reconcile has cyclomatic complexity 47 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 9 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":"lib/autoplan-reconcile.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"223f86ed9b7b3a5013fff07db021dbe43cd3ac336cb1a2d2745d9d6fe65d3f30"}},{"ruleId":"D1","level":"warning","message":{"text":"supervise.supervise (cyclomatic 47): supervise.supervise has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 3 of the 47 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 215, readNew, a function literal at line 203, \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":"lib/pregate/supervise.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"443e52377f821e7fed5a147405f4452fcd713b4e5e50d9635d1234868ea3874a"}},{"ruleId":"D1","level":"warning","message":{"text":"lanes.planRuns (cyclomatic 47): lanes.planRuns has cyclomatic complexity 47 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 8 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1983a579e066ecf2fd85c0d284c6cada8ea926539010e84d53c9b5cb2227258c"}},{"ruleId":"D1","level":"warning","message":{"text":"context-bill.contextBillMain (cyclomatic 47): context-bill.contextBillMain has cyclomatic complexity 47 (threshold 15). Of this number, 28 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":"lib/context-bill.ts"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27db9d195e8443fc4914dcb4910de63a0c9cd7bbd2f621c22fd9c7db782f60f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.cmdStart (cyclomatic 47): ship-budget-cli.cmdStart has cyclomatic complexity 47 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 4 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":"lib/ship-budget-cli.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c9aea71b5700cdfa73cca9210be6402838d83a9a02ed8787ed3a69a8ed9bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 47): (anonymous) has cyclomatic complexity 47 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 14 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dom-dump.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c5999a9558a290bcd7761748358564500bc932c75fd854cb71944235a6f0e0"}},{"ruleId":"D1","level":"warning","message":{"text":"review-risk.matchRisk (cyclomatic 46): review-risk.matchRisk 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-risk.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c37539c0e30dc403fadc8092f1b41560856f28e9439eefce1392889f8661d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"design-md.convertLegacy (cyclomatic 46): design-md.convertLegacy has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0544f2028375abd3c9870db648589705b62b3634704b1a5340087c17259a605"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-auth-verification.verifyCookieAuthentication (cyclomatic 46): cookie-auth-verification.verifyCookieAuthentication has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 12 of the 46 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 70, 95, 63). 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":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f29711b590c594e87bd1988fccccf773675f85a28df2996a657ec2af2759c67"}},{"ruleId":"D1","level":"warning","message":{"text":"state.recoveryJson (cyclomatic 46): state.recoveryJson has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef847d40e8f8df32901413c9e156c104457581f398ef96e3461d109e0281b44"}},{"ruleId":"D1","level":"warning","message":{"text":"scanners.parseSarif (cyclomatic 46): scanners.parseSarif has cyclomatic complexity 46 (threshold 15). Of this number, 45 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":"lib/cso/scanners.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dba3d4f68405f6314ce8e6b0e5d09093c9ba175440ccab5c0f5e1ad077de3c"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.parseArgs (cyclomatic 46): gstack-post.parseArgs has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e542c291a093619b29388fa7dc150e1ff73f9bbc5e9eba38aa9e9a43239e0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-evidence.capture (cyclomatic 46): qa-evidence.capture 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":"lib/qa-evidence.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"135e4b5fc0378809a8790fcaca4151262b119fb6c6aa4320ee7c16db3898997a"}},{"ruleId":"D1","level":"warning","message":{"text":"runaway.assess (cyclomatic 46): runaway.assess has cyclomatic complexity 46 (threshold 15). Of this number, 45 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":"lib/runaway.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3eaac37913a4c952bcd067e137b8f10fe6e3761b1fa2407ee96b79d40a9e13"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.ensureServer (cyclomatic 45): cli.ensureServer has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1b659f3562ccbecf4f6a42a3d8840618b9b5ba4ad005807182f8bc02aaa52b"}},{"ruleId":"D1","level":"warning","message":{"text":"bin-context.slugFromEnvironment (cyclomatic 45): bin-context.slugFromEnvironment has cyclomatic complexity 45 (threshold 15). Of this number, 43 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":"lib/bin-context.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd3fe645b831c84e10059d7ebd04286a564c4848f1f0ae06c342df4516bbb4"}},{"ruleId":"D1","level":"warning","message":{"text":"literals.consumersOf (cyclomatic 45): literals.consumersOf has cyclomatic complexity 45 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 22 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":"lib/pregate/checks/literals.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"65023bfa03e5f24b6d5be3b9589907d357171c1032ac105ab3bd4b28d8d8c84b"}},{"ruleId":"D1","level":"warning","message":{"text":"flaky-exception.readRunFailures (cyclomatic 45): flaky-exception.readRunFailures has cyclomatic complexity 45 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6976625699cfe267e0690ff2f4f11849caa1cf76280c29b0da68fde25b719e32"}},{"ruleId":"D1","level":"warning","message":{"text":"state.recoverAtomicNoReplaceJson (cyclomatic 45): state.recoverAtomicNoReplaceJson has cyclomatic complexity 45 (threshold 15). Of this number, 42 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":"lib/cso/state.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c7f6421f1a7ce05d0ab195b0ba57ce00a95c12c26686a0dc3c0cbb701b239c"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.canonicalStartPlan (cyclomatic 45): verification.canonicalStartPlan has cyclomatic complexity 45 (threshold 15). Of this number, 41 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":"lib/cso/verification.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d70cb8a169f0305dbada27236eb2b9f6c067c7854616aa32b2909768b1852a0"}},{"ruleId":"D1","level":"warning","message":{"text":"office-hours-review.validateOfficeHoursReview (cyclomatic 45): office-hours-review.validateOfficeHoursReview has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b250736e1482af46b5568f4afef05f922ddafa92f1ce5f9164a766bba1f37ad"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-journal-records.recordEvents (cyclomatic 44): claude-journal-records.recordEvents 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":"lib/claude-journal-records.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e908e539484c9031cf756ef97dffa8babae78068cbf25c4d32ea5850496c9ec8"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-gate.buildGate (cyclomatic 44): autoplan-gate.buildGate has cyclomatic complexity 44 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b05c53a2fa6ff382d802bf0a2155b15d3ab471943d0d1bd5e34dc29302e657"}},{"ruleId":"D1","level":"warning","message":{"text":"secrets.run (cyclomatic 44): secrets.run has cyclomatic complexity 44 (threshold 15). Of this number, 31 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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"49415992e41c73fab9561886a03db82d8fdcadc3217a83f9d4024f73cae40a5e"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-wave.waveSettle (cyclomatic 44): ship-queue-wave.waveSettle has cyclomatic complexity 44 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a3cf4a08db45319d330c869f5b0a9b4e0ae7200a1c664a3c5cf77d8ed74416"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.newTrain (cyclomatic 44): ship-queue-train.newTrain has cyclomatic complexity 44 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 6 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"713630516d7072393cc28f092410601c24f009d551c5205b8c44628279521cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"release-gate.runGate (cyclomatic 44): release-gate.runGate has cyclomatic complexity 44 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 7 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":"crew/lib/release-gate.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedcc998339f06f249c491bbbc7bb6f82d10031ffdffcea9e27bb417243e95be"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-cli.trainMain (cyclomatic 44): ship-queue-train-cli.trainMain has cyclomatic complexity 44 (threshold 15). Of this number, 40 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":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6630b3da864898ac9fadc25bdcc73f6af82c718d6dda30d8f65291c8773f5dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"shell-writes.tokenize (cyclomatic 44): shell-writes.tokenize has cyclomatic complexity 44 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 6 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":"lib/shell-writes.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2b9010de5d367de61893793ec25a8bb1eb0e9a1acf30c03b5d371578f60111"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-executor.treeManifest::walk (cyclomatic 44): preparation-executor.treeManifest::walk 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a1c2f82579d66fa5707a48aa916b82993da39169a179186e345d77c37ece05"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.leanPlan (cyclomatic 43): review-depth.leanPlan has cyclomatic complexity 43 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9403db7c1887231fdb8c082217756015d6c3c067e6828051faddf9485358ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.nextStep (cyclomatic 43): autoplan-run.nextStep has cyclomatic complexity 43 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a1c9047fcfb6157547a74afa31702b9811edeba78a9a09acd36cb96c5711e6"}},{"ruleId":"D1","level":"warning","message":{"text":"train-gate.routeDispatch (cyclomatic 43): train-gate.routeDispatch has cyclomatic complexity 43 (threshold 15). Of this number, 41 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":"crew/scripts/train-gate.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"850d22ce6a4100d01fafdabfd13b53160bb5a5097c9b40a6a400c75fba4dbb4e"}},{"ruleId":"D1","level":"warning","message":{"text":"scanners.scannerPlans (cyclomatic 43): scanners.scannerPlans has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 10 of the 43 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 217, 438). 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":"lib/cso/scanners.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac36496d551153e705c806222933b56d100a64e25aa6d937d0b73ca4dd40bd"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.closePacket (cyclomatic 42): phase-publication-hook.closePacket 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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1994c9014738fed022a0ae1b6a694f11d36cc82f95d76f97f8c774bd863a01ac"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.ingestPassScoped (cyclomatic 42): gstack-memory-ingest.ingestPassScoped 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4df7e19e9ff8ff7812aa81e21059d684ca7dd1ed4572ee9f8d561500776fef"}},{"ruleId":"D1","level":"warning","message":{"text":"ci-carry.findCarry (cyclomatic 42): ci-carry.findCarry has cyclomatic complexity 42 (threshold 15). Of this number, 40 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":"lib/ci-carry.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73d2a00ac8ae9ed306b696352c295187d3ad9a444405bba520c8791a2740b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-receipt.classifyFile (cyclomatic 42): tree-receipt.classifyFile 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":"lib/tree-receipt.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eb4e6269b2cf490005c0a87fbf783feb56e1893f22e82ad3b583f42701831c"}},{"ruleId":"D1","level":"warning","message":{"text":"release-cut.readTrainNotes (cyclomatic 42): release-cut.readTrainNotes has cyclomatic complexity 42 (threshold 15). Of this number, 39 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":"crew/scripts/release-cut.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5fc30d8de5e2460da542f54985bd3513829090303aed05f815c0998e10dcf9"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.inspectPython (cyclomatic 42): preparation.inspectPython 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":"lib/cso/preparation.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"677d2fee52446d5b4646e537c576af807ae0394012bba04377e5a79a55315f76"}},{"ruleId":"D1","level":"warning","message":{"text":"scanners.parseResults (cyclomatic 42): scanners.parseResults 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":"lib/cso/scanners.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d9168dc2c1e91298a3ae20b8b2da2989b6f7d94ebf518721afaf7a3a2b3bcd"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.runPost (cyclomatic 42): gstack-post.runPost has cyclomatic complexity 42 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a19757d000782dd088026e538f52932f6a5a16cf2bfc4412c23fe3a9bf34c37"}},{"ruleId":"D1","level":"warning","message":{"text":"runaway.runawayMain (cyclomatic 42): runaway.runawayMain has cyclomatic complexity 42 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b9a309f4e4d7a6bd2aab15df3883307468c52fcea72cc55bbe36bd8c71a22a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-design-detect.scan (cyclomatic 41): gstack-design-detect.scan 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":"bin/gstack-design-detect.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"078560a106a74bf8300d1e85cc8e6a6f6459a913270f33c7a92d72eeef7e0623"}},{"ruleId":"D1","level":"warning","message":{"text":"captain-brief.renderCaptainBrief (cyclomatic 41): captain-brief.renderCaptainBrief has cyclomatic complexity 41 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/captain-brief.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f652a5d92d1720cc130d13a04d01a54662ef08428d4df7acaf083a2618d261"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.admitSlots (cyclomatic 41): ship-queue-train.admitSlots 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beac7bad9d9fcabce3b5617f97a93ccfd26be856a49f4974f6eac23e20d97ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-mechanical.mechanicalPaths (cyclomatic 41): ship-mechanical.mechanicalPaths has cyclomatic complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 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":"lib/ship-mechanical.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d7968e9f6b086fdc35af4ac922478a4e848c1735b7dd79e4880066ffdfaec2"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.phaseDecision (cyclomatic 40): phase-publication-hook.phaseDecision has cyclomatic complexity 40 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cbb1670bbab7f411128187b13de0cda7608fe73acba1e1f6b4019b4a4225ce"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent.main (cyclomatic 40): terminal-agent.main has cyclomatic complexity 40 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 12 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":"browse/src/terminal-agent.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9a077b229cc34c39568dc8a2e7da103c89e685d637ebe09e90ef52cc37afdb"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.initRun (cyclomatic 40): autoplan-run.initRun 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d51f0810e1cdb92d2dcd5426ef1224f48a25c92928621ceda5339920b4f415"}},{"ruleId":"D1","level":"warning","message":{"text":"ci-carry.shipLanesErrors (cyclomatic 40): ci-carry.shipLanesErrors has cyclomatic complexity 40 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-carry.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8bd39e7f1db802f44529f59707c60c785ad364e5ec3cc2af17b49d7170e002"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 40): cli.main 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":"design/src/cli.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"487f4a6bd8d2d8e5b7cf8b83c99030bc4e8c03f1dc0d708ecc74d2937b430b42"}},{"ruleId":"D1","level":"warning","message":{"text":"memorable-user-prompt-hook.main (cyclomatic 40): memorable-user-prompt-hook.main has cyclomatic complexity 40 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f69225149d935fa5d5dfa62da37df8732e1c30b327ccc5dc37e42e96e81963"}},{"ruleId":"D1","level":"warning","message":{"text":"question-log-hook.extractUserChoices (cyclomatic 40): question-log-hook.extractUserChoices 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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bdad4c859aeb46de0ee6ce08cb80d308c0307dcfd9597803b7e9163308a46c"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readOwner (cyclomatic 40): state.readOwner has cyclomatic complexity 40 (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":"lib/cso/state.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9d33ac3cf6ac0330c653d3b273071e7d3a5a9570ab19202f3a6101747738c1"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.canonicalTestPlan (cyclomatic 40): verification.canonicalTestPlan has cyclomatic complexity 40 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 9 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":"lib/cso/verification.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"47319bbe05caf9836c4e7c576a7daaa01c503c3b44890ca04f0aad4c3985d24e"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.parseTranscriptJsonl (cyclomatic 39): gstack-memory-ingest.parseTranscriptJsonl 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f53f3c6db3ccde0349722bdd668aeb9c899d140b8ea9058221db7b1198f685"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.resumeRun (cyclomatic 39): autoplan-run.resumeRun 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":"lib/autoplan-run.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5584e4e1126d0a4df9b038915df98485864a1980128f284b0ef2a7c3ce1ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"approval-record.importAutoplan (cyclomatic 39): approval-record.importAutoplan has cyclomatic complexity 39 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e4c255f0f5e025e4063db6473a1d2110f5b52f0bc33c56242d11eefe7d107"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.writeExcludeBinds::bindAudits (cyclomatic 39): ship-receipt-depth.writeExcludeBinds::bindAudits 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. This shape REPEATS in the file: one other method here (ship-receipt-depth.writeExcludeBinds) 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfce49ea96c184fde02a204302387fcd8d67b64090aac54f69b42b946012dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"state.retention (cyclomatic 39): state.retention 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 shape REPEATS in the file: one other method here (state.retention::retainedReport) 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":"lib/cso/state.ts"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7556e74daeea18604bd1535ed13161d958d3d8820bd5327c971d8e1e77decab0"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-executor.validateClosure (cyclomatic 39): preparation-executor.validateClosure has cyclomatic complexity 39 (threshold 15). Of this number, 37 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a9ccd5b9307f9b70d7b221732d172071c940381136d2c168af2b9df15ab116"}},{"ruleId":"D1","level":"warning","message":{"text":"connect (cyclomatic 39): connect has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 10 of the 39 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 664, 639, 601, \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":"extension/sidepanel-terminal.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce30b586c7ce9d53f9856d15fe3af1f0f5b29cdf52bacfa44236685f53a27b4"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.autoplanReadRange (cyclomatic 38): phase-publication-hook.autoplanReadRange has cyclomatic complexity 38 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeab7c30f51bad24ac7442a52fac2198e782b9227abba7ddccac5a24e350a7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.sendCommand (cyclomatic 38): cli.sendCommand 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":"browse/src/cli.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"147172b2b34ef8d93b39a14b4513b8479caf37fa90991c55b344ddb487a9781d"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.restamp (cyclomatic 38): restamp.restamp 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":"lib/restamp.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d01402184c43439aad9cc6106fc07f4614db2e59087d4428ccf792d2ee8c77f"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.submitResult (cyclomatic 38): autoplan-run.submitResult has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2966e0704d97b518c0f15b770d7b49200b4d722bff1d1d9d5069c064edb144e"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-land.landUpdate (cyclomatic 38): ship-queue-train-land.landUpdate 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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f100a7e1df5c355b5ed4fd99fbdf9785a4f49bea5b538b43410da41015d7e52"}},{"ruleId":"D1","level":"warning","message":{"text":"contracts.validateVerificationRequest (cyclomatic 38): contracts.validateVerificationRequest has cyclomatic complexity 38 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e1ff02087d0a7f230b898b7222decba4308b811679bdebef20165c96204ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"state.ensureLockProtocol (cyclomatic 38): state.ensureLockProtocol has cyclomatic complexity 38 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43d85aa9d773a2f794fb4e118bbf9af862c8c369aa07c7c0dd3a78ce620dd1b"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner-executor.validateScannerRequest (cyclomatic 38): scanner-executor.validateScannerRequest has cyclomatic complexity 38 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 13 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc14c52648639239a059293f7d0518434c94d0c9d2a4ccd2a6b1e7a105bad6a3"}},{"ruleId":"D1","level":"warning","message":{"text":"image-provisioning.provisionCatalogImages (cyclomatic 38): image-provisioning.provisionCatalogImages 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":"lib/cso/image-provisioning.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc43cf6a5914ce4a276989be658b8e86b8dcd4db16d90c89bca1cdd0aef59f85"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.doctor (cyclomatic 38): cli.doctor has cyclomatic complexity 38 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 8 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":"lib/cso/cli.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b036d1fca3b4f3722c2c82f9fcd8c1b6e0352c592151137a7833169b43d0a4d2"}},{"ruleId":"D1","level":"warning","message":{"text":"review-evidence.sharedLibsSnapshotCoverage (cyclomatic 38): review-evidence.sharedLibsSnapshotCoverage has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 11 of the 38 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 93, git, a function literal at line 83). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3e3a7f1db47eb8a0f789ed2a7c3cefcf0852e82757fa80e8cb3606df13ff05"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.cmdResume (cyclomatic 38): ship-budget-cli.cmdResume has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 10 of the 38 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 455, 462). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"81efe3228bc62a30d974527a42f8233371a30c0f4c04c33ad9491225059e571b"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.codeLineStart (cyclomatic 37): redact-patterns.codeLineStart has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f29c491511467c5c08ebf05d51f7c05da0349efbc5a2c9746311409ab783ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-engine.scanInternal (cyclomatic 37): redact-engine.scanInternal has cyclomatic complexity 37 (threshold 15). Of this number, 35 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":"lib/redact-engine.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ada13b867f5637862e9c7f413a90f8a7b7571b3407707821df1701ad3a45b15"}},{"ruleId":"D1","level":"warning","message":{"text":"server.buildFetchHandler.shutdown (cyclomatic 37): server.buildFetchHandler.shutdown 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"962d23d5abb8c76dcec5d926aa3e07ec89125a81c4687e49f3e7742f1e861a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"recover-receipts.collectRecovery (cyclomatic 37): recover-receipts.collectRecovery has cyclomatic complexity 37 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 9 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":"crew/scripts/recover-receipts.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a859a88eba2de864aee4bbae5ad1684308bb55f99ef4f1482b90bac9757f776"}},{"ruleId":"D1","level":"warning","message":{"text":"outside-review-result.classifyOutsideReview (cyclomatic 37): outside-review-result.classifyOutsideReview has cyclomatic complexity 37 (threshold 15). Of this number, 29 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":"lib/outside-review-result.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c55b16ed955f2660829e0cdff19418ed659a269a2b1b6917c916892231cea63"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.trainStatus (cyclomatic 37): ship-queue-train.trainStatus has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec9c900260b5af88500ab23e8d43ac3beb1b773e4186cdeab32aa2b04831bce"}},{"ruleId":"D1","level":"warning","message":{"text":"state.validateLeaseDecision (cyclomatic 37): state.validateLeaseDecision 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":"lib/cso/state.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e9be0bdb2aee00bcaef7d8d5f9d13311a6c7bb81762429165c134277df2072"}},{"ruleId":"D1","level":"warning","message":{"text":"review-pass.buildManifest (cyclomatic 37): review-pass.buildManifest has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"85446a5eb286075d5b315aa6737959e35a42a40c883704f3cf826e2f8ad23380"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.requirePublication (cyclomatic 36): phase-publication-hook.requirePublication has cyclomatic complexity 36 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 16 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f45b129c1be23f00644360727ee459d62a697971e034f1d28acb2cc72df990"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-native.importNativeCookies (cyclomatic 36): cookie-import-native.importNativeCookies has cyclomatic complexity 36 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 9 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e794ad8b2bfd6bb1c117af9163139716bb2dffc19490deae735a64318920a0"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.rewriteStampPaths (cyclomatic 36): restamp.rewriteStampPaths has cyclomatic complexity 36 (threshold 15). Of this number, 28 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":"lib/restamp.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14650712b1dd242ba85e4605e595f631e253d52475718d03aa05d201e8b786e"}},{"ruleId":"D1","level":"warning","message":{"text":"release-stamp.classifyRelease (cyclomatic 36): release-stamp.classifyRelease has cyclomatic complexity 36 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/release-stamp.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"325d0bd5c99480e4fc1f579a0bb6f2539f4827a3be24772082e4233827226130"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-code.runClaudeCode (cyclomatic 36): claude-code.runClaudeCode has cyclomatic complexity 36 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 16 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fe349f08b18f8f151e346f472d808a310046d64a7d074d36c61f5ba3724527"}},{"ruleId":"D1","level":"warning","message":{"text":"state.activateRunLease (cyclomatic 36): state.activateRunLease 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":"lib/cso/state.ts"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55abad62af2bbcae8835262d8d414173084fb914d8da6786e7346fa8639aee5"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-executor.validatePlan (cyclomatic 36): preparation-executor.validatePlan has cyclomatic complexity 36 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ff9349a5822b3cde91e89c9676943f661fe84090a831fb017645563f087eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.submit (cyclomatic 36): cli.submit has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 2 of the 36 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1401, 1463). 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":"lib/cso/cli.ts"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24f545910b2db40fbb08e4667e3c705f0f8b2c449cfd5058ea611339b1facd8"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-evidence.materialize (cyclomatic 36): qa-evidence.materialize has cyclomatic complexity 36 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf8063746d634beacf4894ab2d75791fe5500ac57dfeb658c2e2ebe28ad5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land-direct.landDirect::locked (cyclomatic 36): ship-queue-land-direct.landDirect::locked has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ship-queue-land-direct.landDirect) 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a78f1db025492b28ca75015d26fe0251e22871f1ba4d6065afea4b7a55b22f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.accept (cyclomatic 36): ship-release.accept has cyclomatic complexity 36 (threshold 15). Of this number, 35 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":"lib/ship-release.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf7a6abc2dd7a241c7e1e6777184ac322d5a4972cfff66b9cd551ce31ac5d6"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.loopStep (cyclomatic 35): review-depth.loopStep 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":"lib/review-depth.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"848af71efda146e80e64292e26e249935a5c9e294befef1d9daa6f42629e757c"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent-control.reclaimPublicationLock (cyclomatic 35): terminal-agent-control.reclaimPublicationLock 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc44dabdc552ac8d233631117ee3be66dee10dedc7245c110b5dab75f8021210"}},{"ruleId":"D1","level":"warning","message":{"text":"regen.validateRegistry (cyclomatic 35): regen.validateRegistry has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 9 of the 35 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 57, 74). 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":"lib/regen.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a588b7436b57c12be1aa78520be13268f9c14f4c3a2918e698853e2213d518fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.push (cyclomatic 35): ship-release.push has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45c3a9764c1e62c3885600c9af1de9c6f7e8882a0c75df4d40fbbb5baacfc54"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 35): (anonymous) has cyclomatic complexity 35 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 9 belong to 17 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":"extension/background.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e698987ad8cd264cb7e33f2c62690fbe6a4c22f2516383261f272f00c60a0f15"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.invocation (cyclomatic 34): phase-publication-hook.invocation 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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782204cc28a4b731a5df7c812ea4c2afef2b5bf71cb67f5ffbdd6d9c868369f"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.preparePages (cyclomatic 34): gstack-memory-ingest.preparePages has cyclomatic complexity 34 (threshold 15). Of this number, 29 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaa4f4f62e2b3edc02e6d49875f42fac0aa0c07ee1aa8ce3e79bb46cf74c9a0"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-auth-verification.clearCookieTargetStorage (cyclomatic 34): cookie-auth-verification.clearCookieTargetStorage has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 14 of the 34 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 177, cancelled, a function literal at line 194, \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":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6621fb36ad9292efda7b8759d196f63c0ae51f64bb0f58af6e0e4f81e1f6de52"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-commands.parsePdfArgs (cyclomatic 34): meta-commands.parsePdfArgs 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":"browse/src/meta-commands.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"73092b581923a316d2ecb3b168f786f996300dc6cd42cc3351326302b0c9f636"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-carry.submitCarryCheck (cyclomatic 34): autoplan-carry.submitCarryCheck has cyclomatic complexity 34 (threshold 15). Of this number, 32 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":"lib/autoplan-carry.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c5d5da7284691c3dc9a2af4011754150e3a0288d8aaa4b26013c6f2a2773b"}},{"ruleId":"D1","level":"warning","message":{"text":"context.buildContext (cyclomatic 34): context.buildContext 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":"lib/pregate/context.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"96571e43be6ee77b4a5f950a9af8b3e2a63269deb1c0eccd8167d323d417acd8"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-contract.parseTranscript (cyclomatic 34): skill-contract.parseTranscript 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":"lib/skill-contract.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d454e364667ea46346eb7f495f7b635fc3517738617272457a29acf753d98819"}},{"ruleId":"D1","level":"warning","message":{"text":"scanners.parseScannerOutput (cyclomatic 34): scanners.parseScannerOutput has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 4 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":"lib/cso/scanners.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b933a19a78005684ecde54924cdcc894c6adc6d9a1266b22c6fcf6f43d870a5"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner-executor.createDockerScannerRunner (cyclomatic 34): scanner-executor.createDockerScannerRunner has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 5 of the 34 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 753, capture, writePolicy, \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":"lib/cso/scanner-executor.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f889e2ec0b2cb3f2ac534f8df5ef6550dff26fe891b857779069c74a3adf115"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-plan.dryRun (cyclomatic 34): eval-plan.dryRun has cyclomatic complexity 34 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 12 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a0f2a31fb0cea19e034bc8ae9d60a795db3f7177aa9ddbb59b9ff2dad4cc8a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.splitSections (cyclomatic 34): gstack-post.splitSections has cyclomatic complexity 34 (threshold 15). Of this number, 32 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":"lib/gstack-post.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff0800999f00118c6b2ace6f7105adcb3726fec1b69d7e2d03545204bd78867"}},{"ruleId":"D1","level":"warning","message":{"text":"review-brief.renderRole (cyclomatic 34): review-brief.renderRole has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-brief.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2873501c9b82073c1e3471ea6a63d60cf7c5cc4a7ef1cfb11e63ac8251ceba"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-bill.checkEvalTasks (cyclomatic 34): skill-bill.checkEvalTasks 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":"lib/skill-bill.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaae1d4f889f654d1f8b8d1f16559c920593c552b45fab48fa182b8fce86ebe4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.parseJSONSnapshotType (cyclomatic 34): main.swift.parseJSONSnapshotType 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":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37ba00cf368e274ff54f9516df7e905b94c30f075ac2b6a69896e22c8026380"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.guardOutput (cyclomatic 33): phase-publication-hook.guardOutput 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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"498a876006d09b9dcca3754dc7a36d02848a5046b46bc59425fce957f838276b"}},{"ruleId":"D1","level":"warning","message":{"text":"gbrain-local-status.freshClassify (cyclomatic 33): gbrain-local-status.freshClassify has cyclomatic complexity 33 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 14 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":"lib/gbrain-local-status.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7ed669de070bb293f8ab972809372ebd2a6a69c959f5db3fdcc0162d7aca0b"}},{"ruleId":"D1","level":"warning","message":{"text":"motion-capture.parseCaptureArgs (cyclomatic 33): motion-capture.parseCaptureArgs 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":"lib/motion-capture.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3c089a25efff057c902d54c5ffaf3f015a9a496cfe2183ec8038facfeb6cab"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.promoteToHeaded (cyclomatic 33): BrowserManager.promoteToHeaded has cyclomatic complexity 33 (threshold 15). Of this number, 29 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":"browse/src/browser-manager.ts"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d64082a2aa088baf508baf1e7e641e10f7e7a47b1acecad9b50175228769ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.parseReviewLoopException (cyclomatic 33): ship-receipt-depth.parseReviewLoopException 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7902b158211bd6c20ddb10925ad099cd66c756dca725bcc121c204b7abf5144b"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.verify (cyclomatic 33): ship-queue.verify 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":"lib/ship-queue.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed730c01ffbe2296dc433a6df471e81b9a63384de5920357497df54ae9f55a22"}},{"ruleId":"D1","level":"warning","message":{"text":"Watcher.poll (cyclomatic 33): Watcher.poll 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":"lib/pr-wait.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3435371785f2560bd9b7064caa957a8e42a41ac3be9490260ef4fcbe3e08ba6a"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readLegacyOwner (cyclomatic 33): state.readLegacyOwner 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":"lib/cso/state.ts"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"be10db603b8ffc7981b22263894c927add03b1c7a331ca2bae7680f5a5c5fff7"}},{"ruleId":"D1","level":"warning","message":{"text":"quarantine.entryProblems (cyclomatic 33): quarantine.entryProblems 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":"lib/quarantine.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f566d1fd00025c47d3d76377e6de5d419b77ff99ea703edc0124397759f6f4"}},{"ruleId":"D1","level":"warning","message":{"text":"retro-friction.frictionBySkill (cyclomatic 33): retro-friction.frictionBySkill has cyclomatic complexity 33 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/retro-friction.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7803bb798d0958eadecc3c8cc0dcb5e45ab4c0f1ee0d28e6b4dd6eeeb354e9"}},{"ruleId":"D1","level":"warning","message":{"text":"review-bots.fetch (cyclomatic 33): review-bots.fetch has cyclomatic complexity 33 (threshold 15). Of this number, 30 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":"lib/review-bots.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb433edda96287c436177558367b6fc574e6119c37e16f93cf0cb20cb92043ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.fixChecked (cyclomatic 33): ship-release.fixChecked 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":"lib/ship-release.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e02a1a1719ab4958225efb2dbde4e1e5a7ba025b440cc553428ff2ed287b372"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.trainErrors (cyclomatic 32): ship-policy.trainErrors 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":"lib/ship-policy.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"018baf071ec8f63d4719892741cdc3554b435aa63915526fb83549e9516cf94f"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.classifyDiff (cyclomatic 32): review-depth.classifyDiff has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b911f05189c147419ad1dc09410b4c2318b81a62d489190430e42a0c2668c9ec"}},{"ruleId":"D1","level":"warning","message":{"text":"git.sectionToFile (cyclomatic 32): git.sectionToFile 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":"lib/gate-diff/git.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c570e04902d60571ed2e216b1e6bfa3798c6f991e87095e9ef0e1adc712db661"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.redactCommandArgs (cyclomatic 32): audit.redactCommandArgs 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":"browse/src/audit.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"852510fa2f868b0860c98c97c09936283f7426100f0cff01acdc9454caad2ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-list.parseReply (cyclomatic 32): gate-list.parseReply 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":"lib/gate-list.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee23b44d57a61f77192174290ed4ca606c13bd8f310cf858a75d52e8bea3a90a"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.ownChangeSince (cyclomatic 32): ship-receipt-depth.ownChangeSince has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"654ba3b1a4995df6ee729e70e6d279bd58794120351ec992220cbbfc22ff0342"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.mergeStep (cyclomatic 32): ship-queue-train.mergeStep has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9304d592967467dd96180ff5594ca82eed6a998f394a3978d9852f5ee2915a"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.buildTrain (cyclomatic 32): ship-queue-train.buildTrain 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a47b8639bbab85eba21f8e68b7af7b8c48e38afe88cd6080c4fa92664d14bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.pruneTrains (cyclomatic 32): ship-queue-train.pruneTrains has cyclomatic complexity 32 (threshold 15). Of this number, 27 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd462526bbdbe3f8322f77203c5b7c22aa6d2d77e8175b910066e026ad9e663a"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-contract.checkItem (cyclomatic 32): skill-contract.checkItem has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f3aecf9eb86481f8b119eaa60cf6015c5d5c740c572ee8b3c84bdf0479f583"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-contract-stop-hook.main (cyclomatic 32): skill-contract-stop-hook.main 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":"hosts/claude/hooks/skill-contract-stop-hook.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f41b9342524bdf722c5f894023d89c8e9e616b7153230cbba37a0c1c72f99b"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner-catalog.validateScannerCatalog (cyclomatic 32): scanner-catalog.validateScannerCatalog has cyclomatic complexity 32 (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":"lib/cso/scanner-catalog.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"020a6ccce2261169f05112bad171b57246c5e8ae617ae3dd53af80cae8761cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"witness.validateStoredAssertionWitnessReceipt (cyclomatic 32): witness.validateStoredAssertionWitnessReceipt has cyclomatic complexity 32 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 13 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":"lib/cso/witness.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c590bd4f4bfaabf15078d1dc08602e4fe31ccb06dc693193b6a11d96c77e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerVerificationExecutor.observe (cyclomatic 32): DockerVerificationExecutor.observe has cyclomatic complexity 32 (threshold 15). Of this number, 30 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":"lib/cso/verification.ts"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"950e63afbdedd0cab58025ea19717302f48b4f2dece7e73bcb499c56c1179703"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner-executor.executeScanner (cyclomatic 32): scanner-executor.executeScanner 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ed292695a0fadab7f3d2d2e6ee626f27d253c450b67dae3318e8a4b4a0b9f8"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-evidence.qaEvidenceMain (cyclomatic 32): qa-evidence.qaEvidenceMain has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 426, 424). 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":"lib/qa-evidence.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b6582b104b66e3ad88a182e2e11152ea61510a74f385062fb0d155193d7b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"review-pass.renderStage (cyclomatic 32): review-pass.renderStage has cyclomatic complexity 32 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f4287c4231f39e754febbb83c52704c15bd18b7ea05208d45ec0747f73b437"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-preflight.preflight (cyclomatic 32): ship-preflight.preflight 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":"lib/ship-preflight.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e08348ddccb3e332fc1dd32d2dd3fd630927f9abb73e4f7e4efe4b0e4a2da2d"}},{"ruleId":"D1","level":"warning","message":{"text":"diagram-prepass.inlineLocalImages (cyclomatic 32): diagram-prepass.inlineLocalImages has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 2 of the 32 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 563, 679, 693). 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":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f952f65f078dc8af64a529d3ec5ba4dc4ad99eac0abc9eb81728ce21dc07ba48"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.parseArgs (cyclomatic 31): gstack-memory-ingest.parseArgs has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bad462295ec3786bf4fd56b9821a7c4aa6d0d1ef36454684204666068fd230"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.verifyResumeDir (cyclomatic 31): gstack-memory-ingest.verifyResumeDir 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5375fa208f69f7da26520aa920b2628c70e3b4af86b84eb5eae2cdce60517657"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-gbrain-sync.main (cyclomatic 31): gstack-gbrain-sync.main has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f88342727291be95aac43a1fe1e39753bdf8087412aed6a117d3ae9ca1dc71"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.launchHeaded (cyclomatic 31): BrowserManager.launchHeaded has cyclomatic complexity 31 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 12 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":"browse/src/browser-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2508ea9ae1eebce5bd10c686a8f4a8b03b941a26bfc106e287fe4962276ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"ci-gate.evaluateChecks (cyclomatic 31): ci-gate.evaluateChecks has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d640609131b5051cad33b683a0174d663e908a78d382acddf161260f2c53b2"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.planVersions (cyclomatic 31): restamp.planVersions has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c361402373047dec966ae5d1df0757ce4161290a4e8f0b9f4a638c5d688fe6bd"}},{"ruleId":"D1","level":"warning","message":{"text":"review-collect.scanConsumers (cyclomatic 31): review-collect.scanConsumers has cyclomatic complexity 31 (threshold 15). Of this number, 29 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":"lib/review-collect.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58cc10352ffe3e38f5fb03d08ece9f25e0dce9d8ccc20c3d350819d77712b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"review-exclude.binaryContent (cyclomatic 31): review-exclude.binaryContent has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec878f62b1a7106cfec9f63ddbd7d919d34fed03de5158b8777a72d7a7876a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-verify.verifyTrain (cyclomatic 31): ship-queue-train-verify.verifyTrain has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"81efd60123f38be9221b0366e095887850174cc1830ae2c7a9245e500c8f1589"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-cost-replay.parseArgs (cyclomatic 31): gate-cost-replay.parseArgs has cyclomatic complexity 31 (threshold 15). Of this number, 29 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":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a8875f6de891c78710f23543439506e97e4b17a5ef0f7e5b747a96a02b9da"}},{"ruleId":"D1","level":"warning","message":{"text":"background.chrome.runtime.onMessage.addListener() (cyclomatic 31): background.chrome.runtime.onMessage.addListener() has cyclomatic complexity 31 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 7 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"25edce557d0634c481fbb9f42c7f48ebcf440449529591b78a16f8b90990bfcd"}},{"ruleId":"D1","level":"warning","message":{"text":"checks.healthDimensions (cyclomatic 31): checks.healthDimensions has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3abcac092be9bcedb6820a52b89c9b088b1c6df829e39166920de83b632475"}},{"ruleId":"D1","level":"warning","message":{"text":"contracts.renderReport (cyclomatic 31): contracts.renderReport has cyclomatic complexity 31 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 9 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":"lib/cso/contracts.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"4916efae41f3263209cd8eb6779f52710be826a7e2fda4a6d6491cfb4377170d"}},{"ruleId":"D1","level":"warning","message":{"text":"process.safeMetadata (cyclomatic 31): process.safeMetadata 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":"lib/cso/process.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9eda3839cf9db3a5e14dea000a606ba2f08700f684e6af6a268bc5d3857267"}},{"ruleId":"D1","level":"warning","message":{"text":"state.releaseKnownLease (cyclomatic 31): state.releaseKnownLease 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":"lib/cso/state.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8a0c60b0da4602285bad4345716c53c40571b048b8689aec1bdc67da9ffa48"}},{"ruleId":"D1","level":"warning","message":{"text":"docker.dockerEndpoint (cyclomatic 31): docker.dockerEndpoint 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":"lib/cso/docker.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f840fbd05713f7b4ba4d44cc9bee40a9dc6577acc93bbaf89d2e2a9246c7252b"}},{"ruleId":"D1","level":"warning","message":{"text":"regate.migrationReport (cyclomatic 31): regate.migrationReport has cyclomatic complexity 31 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/regate.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f03fbba546214c715ea08e11e2f68e9659a1cc340112aa2b78beed5acc4101"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-patch.boundedPaths (cyclomatic 31): ship-patch.boundedPaths has cyclomatic complexity 31 (threshold 15). Of this number, 23 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":"lib/ship-patch.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"366d96d29d8cb804418e532dedf9966baf0301f573ecfda676d22acc9da183d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.decide (cyclomatic 31): ship-budget-cli.decide 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":"lib/ship-budget-cli.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cf147590850e8e98a29ba8ab2b905d24cba92513bbc5dd01ef681f84cae898"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.admitTranscriptSource (cyclomatic 30): gstack-memory-ingest.admitTranscriptSource has cyclomatic complexity 30 (threshold 15). Of this number, 26 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa5bb4c5c9925b04934d31e101c477e52ac53f8faf9fc4587b0b2a07bd30a28"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy-config.parseProxyConfig (cyclomatic 30): proxy-config.parseProxyConfig has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b539300941bd6710938527e74988daa280c45eab926338ca5acc06cd68d6cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-lean.captureDraft (cyclomatic 30): autoplan-lean.captureDraft has cyclomatic complexity 30 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 11 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":"lib/autoplan-lean.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8401edc4bbefcb883ea252c8cc9b281476b11de5d41ad13cfda2a2062aed57c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-wave.waveMain (cyclomatic 30): ship-queue-wave.waveMain 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264c13b808fcfd515882734549f58a6bd4354b8cbe61b61cdcfcb34501e3154"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon.fetchHandler (cyclomatic 30): daemon.fetchHandler 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":"design/src/daemon.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5a6e64060b744a76387cca3e7dd5d2c69854accea4152ab68e2566fd1454ab"}},{"ruleId":"D1","level":"warning","message":{"text":"content.captureBasicData (cyclomatic 30): content.captureBasicData has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb8aaef598503d6bc61f1cad3767808d8ec01c556520d54ef9bceb792d418e2"}},{"ruleId":"D1","level":"warning","message":{"text":"inspector.captureBasicData (cyclomatic 30): inspector.captureBasicData has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1951c5b35ab88c8913ee58f9a9a346221cca2e1a00ddb86d793e04fa03a6f45b"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-owner-words.ownerWords (cyclomatic 30): autoplan-owner-words.ownerWords has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 12 of the 30 points are its own statements and the rest belongs to 7 function items inside it that branch (note, strings, gateText, \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":"lib/autoplan-owner-words.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be481d0cfccbf3f9d891a3b1e61d855a1b3f188a005f3df33d2790e16ae9c8b"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-deadline.runQaDeadlineCommand (cyclomatic 30): qa-deadline.runQaDeadlineCommand has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 6 of the 30 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 159, 169, 148, \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":"lib/qa-deadline.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1558e132d205a98ea4dfb8ebf03a8cb6eb5b1bbff6b6bb0b91f2e84e97aac9af"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-plan.parseEvalCalls (cyclomatic 30): eval-plan.parseEvalCalls 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":"lib/eval-plan.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ac6ab3297d72cd2862003d3f1def41ef6932ef8d39262734c7f8b097032adf"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-plan.priceGate (cyclomatic 30): eval-plan.priceGate 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":"lib/eval-plan.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"96388acfe13c8c932936cc3b1ac20fd194b31049bae2a7f30efea4de1dcec6bf"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-call-log.countLoggedCalls (cyclomatic 30): ship-call-log.countLoggedCalls has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-call-log.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5687a971f9f8b74612e5750ec6330fb653ecf968d32e770db99d6e7c4ee75e43"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-preflight.integrate (cyclomatic 30): ship-preflight.integrate has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1170560d8d182eef95aec7394ac41ddcad9285271eeeca297376b3705c07f929"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy-mechanical.mechanicalErrors (cyclomatic 29): ship-policy-mechanical.mechanicalErrors has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 25, 41, 35, \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":"lib/ship-policy-mechanical.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aa778a6206ab8c32c333b30840cd95616e967cdb8b75268abcd21191ac38f3"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-phase-publication.autoplanPhaseCompletions (cyclomatic 29): autoplan-phase-publication.autoplanPhaseCompletions 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-phase-publication.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fe0992e8f07a7f530ff6221a40311546fd9e89a903fa96fb78d2e8a972284a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.walkGstackArtifacts (cyclomatic 29): gstack-memory-ingest.walkGstackArtifacts 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de064938b1ad5d1a04caa18442f6ab0bf40f064f6b57445f705c02186ae2c76"}},{"ruleId":"D1","level":"warning","message":{"text":"head-policy.lanesOnlyHeadPolicy (cyclomatic 29): head-policy.lanesOnlyHeadPolicy has cyclomatic complexity 29 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/head-policy.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f239e33ecdda6e715bbf8a7cf555e5aed331f0c0af8ad73f7e0d7a46789871"}},{"ruleId":"D1","level":"warning","message":{"text":"stamp-only.versionStampOnly (cyclomatic 29): stamp-only.versionStampOnly 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":"lib/pregate/stamp-only.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2378ddf674a84cce5830c9acb9b6f014cc63d69b1e4e1a8dd48948e13d57681c"}},{"ruleId":"D1","level":"warning","message":{"text":"flaky-exception.shardFailures (cyclomatic 29): flaky-exception.shardFailures has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"67107ac7671efaee82014278c5fa6b918c07a290bbec36ad6d3e2f84adda52bb"}},{"ruleId":"D1","level":"warning","message":{"text":"review-collect.readDiff (cyclomatic 29): review-collect.readDiff has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c5ddd3f4fa9243b4a0e52132067318c327fb0f015280b01de1eb41f11351f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.stamp (cyclomatic 29): ship-queue.stamp has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65d10cb40c692f9f30d09a193fc402533059f0c0a95225f74525f54c29d5d03"}},{"ruleId":"D1","level":"warning","message":{"text":"release-gate.bisectRecord (cyclomatic 29): release-gate.bisectRecord 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":"crew/lib/release-gate.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f0d3dd3684bd0076af7b412137be4ebcf9ce32d35a9f1c115e1d6264d17ead"}},{"ruleId":"D1","level":"warning","message":{"text":"release-cut.gateVerdict (cyclomatic 29): release-cut.gateVerdict has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804e33deacd543f072d07a27d45149fa74884098cfb093521567f9c180ec139"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-contract.validateContract (cyclomatic 29): skill-contract.validateContract 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":"lib/skill-contract.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b16c655a8bb18cf9442ae70fad9cff1f077d523bd1159788b13c4daa97c1c96"}},{"ruleId":"D1","level":"warning","message":{"text":"gen-accessors.maskSwiftSource (cyclomatic 29): gen-accessors.maskSwiftSource has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0bce727f64f9b5c7169ade280843e1c362e9d1d1d148b1df63e1c03c06dcbc"}},{"ruleId":"D1","level":"warning","message":{"text":"plain-title.loadPlainTitlePolicy (cyclomatic 29): plain-title.loadPlainTitlePolicy has cyclomatic complexity 29 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 12 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":"lib/plain-title.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4955bd7d413be63fc7ae9f280e0e6ba5b6b2477f374e031b9fa0a1e8631a998"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-public.exportPublic (cyclomatic 29): autoplan-public.exportPublic has cyclomatic complexity 29 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-public.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"693009e8365d67bd36f2377ab17722a8f8a397102d0c2664659327f83c379fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"state.discardAtomicNoReplaceTemp (cyclomatic 29): state.discardAtomicNoReplaceTemp 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":"lib/cso/state.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c9b709a246e66411b435051150fde660f26ecb3a5f4b64673bdb929647d84a"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.boundPath (cyclomatic 29): snapshot.boundPath 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":"lib/cso/snapshot.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d6f3d3382bfd2db7aea57e48a58f84af619d6501b6dfefcbb46ebbea215a9"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.inspectRails (cyclomatic 29): preparation.inspectRails 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":"lib/cso/preparation.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b1511b64498444683be97e6cf155ee84f0765de1d2ea25825e2ed1d4dc847"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.manifest (cyclomatic 29): preparation-container.manifest has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6011300346a8048375ecc7889fa0ef8d9b2b2285391d53dcc1abf1d36495c63a"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.extractNpmArchive::consume (cyclomatic 29): preparation-container.extractNpmArchive::consume 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":"lib/cso/preparation-container.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"269593dc5da17068310c49067d14c2dc40f70013d09eebd6c7fb84292899bcf4"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.verify (cyclomatic 29): cli.verify has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2309, 2316). 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: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd8769bd833be04edae80e55ce1aad51fac41b53ed167f8c743984baf99b38a"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.replay (cyclomatic 29): cli.replay has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2615, 2626). 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: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05ae2af71a9825a5a469f1d5012ac9ee6a287422abaa66370e17cae4c9f4573"}},{"ruleId":"D1","level":"warning","message":{"text":"openReattachWebSocket (cyclomatic 29): openReattachWebSocket has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 329, 362, 323, \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":"extension/sidepanel-terminal.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8180a8ed59b9798826df5261dddd1388ada261b11e47040f8ce0cac9a81304"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-global-discover.scanGemini (cyclomatic 28): gstack-global-discover.scanGemini 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":"bin/gstack-global-discover.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"66558a590d16264fac53cd8f9b7cc955d5423fb682dc40ceb753a83948ebd94b"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.handlePairAgent (cyclomatic 28): cli.handlePairAgent 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":"browse/src/cli.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9fb875fc350f3a758c735243e8bbcff14884c0a439452129fff54dbae50416"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-list.validateGateList (cyclomatic 28): gate-list.validateGateList has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 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":"lib/gate-list.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c556eb528b1124b12b023c463cf212086c481cbefe41efa384869f2f2291c8"}},{"ruleId":"D1","level":"warning","message":{"text":"regen.runRegen (cyclomatic 28): regen.runRegen has cyclomatic complexity 28 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1aae7b35a40361de8973bca47f2a67a80ab3743a00ab0d165413480376475d"}},{"ruleId":"D1","level":"warning","message":{"text":"import-graph.referencesIn (cyclomatic 28): import-graph.referencesIn has cyclomatic complexity 28 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2109887c2439d7b652c4da17a832b47e1ccd395087fc222fd03494e46317c6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-record.parseNote (cyclomatic 28): ship-queue-train-record.parseNote has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-record.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"68475209a0074106348d024ccba24e967930e752e5ab0a3b03f3e4ee6b52da50"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-verdict.classifyGate (cyclomatic 28): ship-queue-train-verdict.classifyGate has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425a26fa37f8fa3b5a30d73aa29700e4979119d471f2d6e375b0b319a8632a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-verdict.trainVerdict (cyclomatic 28): ship-queue-train-verdict.trainVerdict 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":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca07522a46809eca7fee0807affd251f0d2f380b7fe1827e14624befbe72a1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-contract.runsCheck (cyclomatic 28): skill-contract.runsCheck has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7a538949c244e98ac0f5f49b53d42f4bd8b29c401b19853a6a7772ad6a813d"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-code.parseClaudeCodeResult (cyclomatic 28): claude-code.parseClaudeCodeResult 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":"lib/claude-code.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab1a9446d4541a47f781a88f3aa134875d93ae026a294b52505742ebf50cda"}},{"ruleId":"D1","level":"warning","message":{"text":"contracts.assertion (cyclomatic 28): contracts.assertion has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 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":"lib/cso/contracts.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67425d9d9f1abfd9d62ec4d912808b622a85aaba7541bb13f563eb69cd2a670"}},{"ruleId":"D1","level":"warning","message":{"text":"bounded-file.readBoundedStable (cyclomatic 28): bounded-file.readBoundedStable has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/bounded-file.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a524b95f74e8cb09deaf51d66351e716883a9f24abda2f47c513734ee4878d6b"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.directPackageTest (cyclomatic 28): verification.directPackageTest 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":"lib/cso/verification.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daa074d4b74cf1eaaac108f88f63c725e413e9d484f0d3d3ba781ac8751af0f"}},{"ruleId":"D1","level":"warning","message":{"text":"review-evidence.reviewFreshness (cyclomatic 28): review-evidence.reviewFreshness 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, name the conditions: bind each compound test to a 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: review-evidence.canReuseSharedLibsAdvisory (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6798e5ab4681d1b4f3986f31e3327e3b2b2bd6a10a15ddb55ab68f9e0d2c78ea"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks-prior.addRows (cyclomatic 28): tasks-prior.addRows has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 93, 104). 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":"lib/tasks-prior.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe10e06827e6c236d0489e698dddadbcc7c01bbbf626fe3a82cc85bfc4cf4fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.svgDrawing (cyclomatic 27): review-depth.svgDrawing 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":"lib/review-depth.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"649a43cbc30cc019d774fc1e2a458cbbdae5e4757e9a0c4e994187efd39cf0c3"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-autoplan-snapshot.acceptedBlocks (cyclomatic 27): gstack-autoplan-snapshot.acceptedBlocks 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e89409ed3f8c7eb32d02ca23b89ee610ea9b61566bb18741fd458b65f83332d"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-design-detect.install (cyclomatic 27): gstack-design-detect.install has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f600361fa0d71d97b11388db780e08c2992e5dcb1c801e16b192eef3ff29720"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-design-detect.resolveTargets (cyclomatic 27): gstack-design-detect.resolveTargets has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d9eff02f240f05c938c475770dd4a57033b1ad46ee28bb81766a6492ed1486"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-gbrain-sync.runDream (cyclomatic 27): gstack-gbrain-sync.runDream 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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6d268b7e96cfd7438cfcf7747e575d95658cba6f61180686a7a91bc7440e44"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.wirePageEvents (cyclomatic 27): BrowserManager.wirePageEvents has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 2429, 2529, 2464, \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":"browse/src/browser-manager.ts"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae3e4f053e74e04f02e3ffd55ad93d0387870646b66fdb2f19e500a4daebb9f"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.runStages (cyclomatic 27): restamp.runStages has cyclomatic complexity 27 (threshold 15). Of this number, 25 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":"lib/restamp.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"603a244f11cbb655e7611492000fcb3d99bf3d9fd92d7e5c87bd84c332844444"}},{"ruleId":"D1","level":"warning","message":{"text":"config.allowlistErrors (cyclomatic 27): config.allowlistErrors has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 170, 180). 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":"lib/pregate/config.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc3c7fdf178382a4921d6380aeff1ad76e2745b3162062207ece59872a29bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"django.djangoEdges (cyclomatic 27): django.djangoEdges has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/django.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4885654b5dabb38498229dc4e1f06e090de79dfa8a3c40e4bfef12b2afe1d4d8"}},{"ruleId":"D1","level":"warning","message":{"text":"import-graph.buildGraph (cyclomatic 27): import-graph.buildGraph has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5358fbad9c8b6685efe1434b700ae44bc631a05e75ae7b6ec193f6444e2c1cce"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-record.resolveApproved (cyclomatic 27): plan-record.resolveApproved 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2825f63bb7141a4319c075a99c8423d8e976aa96f1a38b7ddb11d66a49fd5cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt.parseReviewLoop (cyclomatic 27): ship-receipt.parseReviewLoop 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"30314850893655952b68faaf37abcaa38c7e4c7f877a911865fd00b4fca9036d"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.writeExcludeBinds (cyclomatic 27): ship-receipt-depth.writeExcludeBinds 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 shape REPEATS in the file: one other method here (ship-receipt-depth.writeExcludeBinds::bindAudits) 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a212aa0fce5d744ce81cbc0e696d66086c8263be680c388cb568703e5947076a"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-reuse.ownDiffSignature (cyclomatic 27): gate-reuse.ownDiffSignature has cyclomatic complexity 27 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 12 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d82cb90e0a12e4a2f18337d3d61230c8ed7966cba96ae43c06d459ac1ecc0e3"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-wave.wavePlan (cyclomatic 27): ship-queue-wave.wavePlan has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67f595e4a3c5cccfc5db6136a46ceefdf784397da266384aea38c366fcd745b"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-verdict.trainBisect (cyclomatic 27): ship-queue-train-verdict.trainBisect has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"806da411e7491eb990bc25baa06a3678235ef66ca88c765743ad149d378d24c4"}},{"ruleId":"D1","level":"warning","message":{"text":"serve.serve (cyclomatic 27): serve.serve has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 2 function items inside it that branch (handleFeedback, handleReload). 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":"design/src/serve.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9b5088ff03201480809aaec14ddba3fe2072fa1095b40f996ad38bd5884707"}},{"ruleId":"D1","level":"warning","message":{"text":"tunnel-bootstrap.bootstrapTunnel (cyclomatic 27): tunnel-bootstrap.bootstrapTunnel has cyclomatic complexity 27 (threshold 15). Of this number, 22 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":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"810d48a8352075e413d970c5a76c5904a209aa48ce9247a32aafc9bf2afe593b"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-public.scan (cyclomatic 27): autoplan-public.scan has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 106, values, a function literal at line 118, \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":"lib/autoplan-public.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"538756d76b8d03da3016b12a5c3553b517bcabafc41f420156016f0e1aa885fe"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-executor.stagedFileHashes (cyclomatic 27): preparation-executor.stagedFileHashes 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"92accbfede72cb2284e69f1d0b3bbec9c8907a85d06f2c70b0d8bac60de5bd42"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.createPreparedExport::walk (cyclomatic 27): preparation-container.createPreparedExport::walk 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 shape REPEATS in the file: one other method here (preparation-container.createPreparedExport) 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":"lib/cso/preparation-container.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"730e01dfbf6063d46758e79e7bdc648e42856899a79e873709018ad6eea5fc9e"}},{"ruleId":"D1","level":"warning","message":{"text":"review-ledger.judge (cyclomatic 27): review-ledger.judge 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":"lib/review-ledger.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fe6767e50b73636cc3bb79d3b7470c0beef7f233666c27b6eaa946bc9fc0ba"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.prepushGuards (cyclomatic 27): ship-release.prepushGuards has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to 2 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":"lib/ship-release.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"94939016c592975e4ca8e56365e46bcce9878bb2b47d07db84c027616a266a82"}},{"ruleId":"D1","level":"warning","message":{"text":"index.Deno.serve() (cyclomatic 27): index.Deno.serve() 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":"supabase/functions/telemetry-ingest/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8e3f59e30b4a15872f53157f1664a8a23c576393602499bf5677055e1bba04"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-journal-records.recordMeta (cyclomatic 26): claude-journal-records.recordMeta 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":"lib/claude-journal-records.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9bc484f082beedaa501cbc904698badd725d6e1ec3ca604f81351f900e2758"}},{"ruleId":"D1","level":"warning","message":{"text":"land-merged-checks.runMergedChecks (cyclomatic 26): land-merged-checks.runMergedChecks 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":"lib/land-merged-checks.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5717856c3a88636c0a313beb6ad5f9b36188528a696d6b291b5f15e60d178492"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.stringAt (cyclomatic 26): redact-patterns.stringAt 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":"lib/redact-patterns.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5aa02e56ed436cd970dd676a3e88ff848ff27fbf517e4bf4032545823507e5"}},{"ruleId":"D1","level":"warning","message":{"text":"git.resolveBase (cyclomatic 26): git.resolveBase has cyclomatic complexity 26 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9117b3fd3333b0f6ce4725cae431d0952b1a57f69b42a4601ed9356117877e5"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-gbrain-sync.runMemoryIngest (cyclomatic 26): gstack-gbrain-sync.runMemoryIngest 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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"5131d2a26cdc2455efdf55604cc77c96b592144869dd4289698423d167f40179"}},{"ruleId":"D1","level":"warning","message":{"text":"content-security.markHiddenElements (cyclomatic 26): content-security.markHiddenElements has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to one function literal inside it that branches (line 89). 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":"browse/src/content-security.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30f3b6e3e7082da24512cb9fe2b72dafb89654a105a30c849a4132ba7033d57"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-native-job.createNativeCookieJob (cyclomatic 26): cookie-import-native-job.createNativeCookieJob has cyclomatic complexity 26 (threshold 15). 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-job.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae4e3914614f3021b60e8665d7f137041a98864174039f770df938b4c4eb114"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-input-cache.buildEvalInputIdentity (cyclomatic 26): eval-input-cache.buildEvalInputIdentity has cyclomatic complexity 26 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 9 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":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49979133d1ecd59e5b97b0f926dd7d42a57e20394eadca2b1dc287d9b98b285"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-input-cache.validProof (cyclomatic 26): eval-input-cache.validProof 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":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb9127a90ffe29b3f621f778234464c159c567c8d19502d7077efff6cb56358"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-export.runLog (cyclomatic 26): autoplan-export.runLog has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-export.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cad8a3a7983ac175ec67df81beeaa2761140ca610bd80e1d436c26bb5c7604"}},{"ruleId":"D1","level":"warning","message":{"text":"guards.run (cyclomatic 26): guards.run 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/guards.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5faff731521d9d032dcb12b3c7b799713ca2f5e51f64fee2cf55c355bb320de"}},{"ruleId":"D1","level":"warning","message":{"text":"review-exclude.reviewExclude (cyclomatic 26): review-exclude.reviewExclude has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eb6cfff46900784b677d895d7948e2e544e82b49ab0536829fddc6b3d70a49"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.parseReviewTargeted (cyclomatic 26): ship-receipt-depth.parseReviewTargeted 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd746445893c7f72970aa7c1f368c39095e1ef3bb42c9cb9e489fdca540f0535"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land.census (cyclomatic 26): ship-queue-land.census has cyclomatic complexity 26 (threshold 15). Of this number, 23 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":"lib/ship-queue-land.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47de8b0361415d424bba9f2045a4f51abe837dbcea0dad4ea0baced7ba6153e"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-dispatch-ci.dispatchCi (cyclomatic 26): ship-queue-dispatch-ci.dispatchCi 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":"crew/lib/ship-queue-dispatch-ci.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c56d8f6e150c63a1b75879510a035737ab3411e599523a89bc6ff7393a59f87"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-land.landSlot (cyclomatic 26): ship-queue-train-land.landSlot 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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"68727dd42a45a6722e82f10675a32d1d6646d0963d8ac23e3fb041b37ea32cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-cli.readyMain (cyclomatic 26): ship-queue-train-cli.readyMain has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 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":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a8b31393ad1991fe6a9916f3a24dab103d02abf3693e682fadacc50db504a"}},{"ruleId":"D1","level":"warning","message":{"text":"variants.requestVariantImage (cyclomatic 26): variants.requestVariantImage 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":"design/src/variants.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c992a79e487238311a9bba14c08db1a3f020d2b14a155b3f936060b20131ddb"}},{"ruleId":"D1","level":"warning","message":{"text":"process.boundedMetadataFile (cyclomatic 26): process.boundedMetadataFile has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8f1e24960082d3826e3ab84c08256064e480b9c627567bfecb98df580c2384"}},{"ruleId":"D1","level":"warning","message":{"text":"dx-error-capture.parseArgs (cyclomatic 26): dx-error-capture.parseArgs 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":"lib/dx-error-capture.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ba49dd2a34e4c2d0799f438ca9d2c41e03a60e1f8023d0fc6c78efe86cc3e2"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-evidence.readQaCaptureRecord (cyclomatic 26): qa-evidence.readQaCaptureRecord 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":"lib/qa-evidence.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42d21aead194b8bdb2e5fe74c1133ee4989bdc2a7a970d7d44f7246e47c55e9"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-state-clean.report (cyclomatic 26): repo-state-clean.report has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"490775d1decb95462c9a4ed9b358f8d5ab34faf0551ccf5ad970f0cb70c624e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-handoff.cmdReconcile (cyclomatic 26): ship-handoff.cmdReconcile has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 258, 265). 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":"lib/ship-handoff.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5171129469744dfe7b66ed7145578549e9fc64f3acf4cbe7b12bd93155da6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.release (cyclomatic 26): ship-release.release 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":"lib/ship-release.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"2605c57e25f54d30f0d89a5b42d17f16bfde628368b9a66cc73fea687d971ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"orchestrator.generate (cyclomatic 26): orchestrator.generate has cyclomatic complexity 26 (threshold 15). Of this number, 24 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":"make-pdf/src/orchestrator.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c680167a3c790265a50ee7922ed9db4127dd913b754783e2039180f7187f77"}},{"ruleId":"D1","level":"warning","message":{"text":"ObservableClassVisitor.visit (cyclomatic 26): ObservableClassVisitor.visit 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":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f8e4127d07e63abe4cf4128d82acae2b1a633a6f7e06bea9a42f19c90261f8"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-autoplan-snapshot.baselineEditRecords (cyclomatic 25): gstack-autoplan-snapshot.baselineEditRecords 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c623242f7e497702c8356772ca807c52efa251f05d06d7592e92171eafd28243"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.verifyCloseEdits (cyclomatic 25): phase-publication-hook.verifyCloseEdits has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d22299d3207267eeabe512250dce2259935dec35d761305a0aedcf369cfdaad"}},{"ruleId":"D1","level":"warning","message":{"text":"gbrain-local-status.hasRemoteOnlyGbrainMcp (cyclomatic 25): gbrain-local-status.hasRemoteOnlyGbrainMcp has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"34597a2477ee3f6bb6aa881830ca3b678177ecabe214e21497f4d9c171fd2718"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-cost-history.classifyReds (cyclomatic 25): gate-cost-history.classifyReds has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 101, 100, 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":"crew/lib/gate-cost-history.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"735f2e5ed3c9e722f5f861f30d17e83dea60030b5437244d64135bdf5749cf81"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog-fragments.readFragments (cyclomatic 25): changelog-fragments.readFragments has cyclomatic complexity 25 (threshold 15). Of this number, 20 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":"lib/changelog-fragments.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"14372067ae5203fd84d2777f4035a4cf2b5519d4195b3bd25dfe34881d60443c"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-prompts.detectScope (cyclomatic 25): autoplan-prompts.detectScope 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":"lib/autoplan-prompts.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdff6481192280b799ce95eca9db8884c832accf01395fc51303f49064d3587"}},{"ruleId":"D1","level":"warning","message":{"text":"stamp-only.jsonDiff (cyclomatic 25): stamp-only.jsonDiff 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":"lib/pregate/stamp-only.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5291387528ea1864b99da60839c0ede3893e2ba6ad46fa576303e16353b40ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.acceptedReceiptHeads (cyclomatic 25): ship-queue.acceptedReceiptHeads has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"369d6a3c28f13da98e31d666c0e18093ded94226f525363bf3be1d6ee1cd2d68"}},{"ruleId":"D1","level":"warning","message":{"text":"Watcher.emitBots (cyclomatic 25): Watcher.emitBots 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":"lib/pr-wait.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd399065d1b6f437ffa5a5cb48971ab2799a7e2aecb19efdb7eb36104b63e2cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-screen.screenVerdict (cyclomatic 25): ship-queue-screen.screenVerdict has cyclomatic complexity 25 (threshold 15). Of this number, 21 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":"crew/lib/ship-queue-screen.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9703ab6afbf49e84440e0ef16be27cd6d6a78c25597fa8ca64c2c7ef2375809"}},{"ruleId":"D1","level":"warning","message":{"text":"tags.tagHunk (cyclomatic 25): tags.tagHunk 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":"lib/gate-diff/tags.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafbe0e8bbc0c76c8ae90fde962aa27ef283ea1d518eb3b38a2be39cdaefe7e3"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runSetup (cyclomatic 25): cli.runSetup 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":"design/src/cli.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98054134abc64193f05b0a4469b663f4d13912a5c0e6f4e4a3f8c83df9d785d"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-stop-gate.checkRun (cyclomatic 25): autoplan-stop-gate.checkRun 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":"lib/autoplan-stop-gate.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fe659b475e71463e1f9e5b97e5ffeda7ac7717f08226c41cd04c1d3bca8403"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-owner-words.ownerSpans (cyclomatic 25): autoplan-owner-words.ownerSpans 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, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9532999f3766159b0b2b8911aed6c3355e15c12d1e1be767840df9e9f4c8a598"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-shadow-reader.rowProblem (cyclomatic 25): autoplan-shadow-reader.rowProblem 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":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d219a999958a7713676da54a7f5fa5d640ae7e7e302dbac48f876c2c86a7b13a"}},{"ruleId":"D1","level":"warning","message":{"text":"context-bill.walkMdFiles::walk (cyclomatic 25): context-bill.walkMdFiles::walk 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":"lib/context-bill.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee411836717dedee7fcc62179496d57e5199b2d9a2ede37a98a60793b16866"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerPreparationSandboxRunner.publishArtifacts (cyclomatic 25): DockerPreparationSandboxRunner.publishArtifacts 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fbe9ad96f6f499c73f2ea5c11990c480a0afbeec0e4bd47aac21483f4ec27b"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-models.parseEvalModels (cyclomatic 25): eval-models.parseEvalModels 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-models.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e5cf9d334e51ffa671f345ddfde0fce9e8d874cc61ec192b38e1c9146c9089"}},{"ruleId":"D1","level":"warning","message":{"text":"pr-shots.pathSides (cyclomatic 25): pr-shots.pathSides 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6eb65b84938eb5ddb1146c10e069f699d9b1ad106af093bbc5b2ff97187864"}},{"ruleId":"D1","level":"warning","message":{"text":"pr-shots.paneRows (cyclomatic 25): pr-shots.paneRows has cyclomatic complexity 25 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8be521c2358cf8ec92788f6f9a75b236d746300c66f563898e3ab86e85f23d"}},{"ruleId":"D1","level":"warning","message":{"text":"quarantine.quarantineMain (cyclomatic 25): quarantine.quarantineMain 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":"lib/quarantine.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9cd33b7df4ac0b1f4c4187e78e33d6f655d1e5f9792c761dc78f91e3bdbf6c"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.cmdClose (cyclomatic 25): ship-budget-cli.cmdClose 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 350, 355, 364). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f252a9f7514802877be811c4f800bf3552778193881567b5e7ed1dc263ed823b"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-owned-journal.scan::record (cyclomatic 24): claude-owned-journal.scan::record 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 (claude-owned-journal.scan) 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":"lib/claude-owned-journal.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d27671305e9e0b89dacbd3af8307bb72da38684e4e23ade1b4f286bbe781ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.nextStep (cyclomatic 24): review-depth.nextStep 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":"lib/review-depth.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2451c1696b1e9f49c86293e2f50366f58c2a7d41f95123b9b133e69feda6649"}},{"ruleId":"D1","level":"warning","message":{"text":"transcript-consent.readTranscriptConsent (cyclomatic 24): transcript-consent.readTranscriptConsent 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":"lib/transcript-consent.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea721f363da4d84e36895105c0ccf43e69f37cbf94db9643217e96e5d36601b"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.importBatch (cyclomatic 24): gstack-memory-ingest.importBatch 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6e7eb8931c77bfb848aa6b4ea98f4a08567c0e6a0cb50e14960a650dae4fb"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.runLocked (cyclomatic 24): gstack-memory-ingest.runLocked has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"de11be9567671181d374ee9e4543428551477fd86e671e188ac17c737ff7b789"}},{"ruleId":"D1","level":"warning","message":{"text":"socks-bridge.startSocksBridge.server (cyclomatic 24): socks-bridge.startSocksBridge.server 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 5 function items inside it that branch (onData, a function literal at line 190, killBoth, \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":"browse/src/socks-bridge.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9db7867dd0bfe146df25b9b84f5b285f8e67c61a73503c27aea79d3376e356"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.proxyMismatchLines (cyclomatic 24): cli.proxyMismatchLines has cyclomatic complexity 24 (threshold 15). Of this number, 21 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":"browse/src/cli.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"11080e8e3dc570bec044a1836a2d43d4838261604a58d7dd7a4300e2fe19f68b"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-browser.listProfiles (cyclomatic 24): cookie-import-browser.listProfiles 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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f12b3cb4725d4d61cc1dc9bc2a1a16dd79d95c90e897426bc280184bf83550"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-native-worker.superviseNativeCookieImport (cyclomatic 24): cookie-import-native-worker.superviseNativeCookieImport has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258681a565ddd3082b3b8d03afc32ee3dc1a43753da27c2e85fb40b6dbedad4"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-reconcile.parseFences (cyclomatic 24): autoplan-reconcile.parseFences has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 74). 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":"lib/autoplan-reconcile.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a96363d9b8b517f16f2e0238ce8e66632149122bc7c533d73cb719b471df1c"}},{"ruleId":"D1","level":"warning","message":{"text":"sealed-guard.sealedErrors (cyclomatic 24): sealed-guard.sealedErrors has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1e54b56be414306d6a168dccf9f5d85388f14150244b24e131591ed96b2d6b"}},{"ruleId":"D1","level":"warning","message":{"text":"lane-selection.removedPath (cyclomatic 24): lane-selection.removedPath has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d72e01ac7b26b6a12b26dbc0b502026d95517b0082d0c4dfb50c6eec8560673"}},{"ruleId":"D1","level":"warning","message":{"text":"banned-terms.validateBannedTerms (cyclomatic 24): banned-terms.validateBannedTerms has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 64). 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":"lib/banned-terms.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e20c72d6721f95b2d78e74f68e2c2955f074f2e4c05a278914bd1ab457d3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-reuse.parseBinding (cyclomatic 24): gate-reuse.parseBinding 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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"29754ba523bbe5561cf24ae8d37d6470e81b5cb1879e10bf3352be8cf4ad2374"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.freePhase (cyclomatic 24): ship-queue-train.freePhase 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b46bf4de35aa61e24bd1d727e0fb57745763afc6976161de536f74d344b2e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"witness.createReceipt (cyclomatic 24): witness.createReceipt has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 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":"lib/cso/witness.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5714b9fa4491cef98ddd1826906317d00b40b96a2d3f0b95933ec9006cf992b"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.start (cyclomatic 24): cli.start has cyclomatic complexity 24 (threshold 15). Of this number, 20 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: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7ea413de32aa4f9f45c05b7d432762eb59c3c1c679adbed6ea3cd6b71d8e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"harness-register.hookPlan (cyclomatic 24): harness-register.hookPlan has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04af48f20d4c7b01c48c51ca6ff086302d63a96fb294b6f52e62d7b9f4fed4d"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-state-clean.evaluate (cyclomatic 24): repo-state-clean.evaluate 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":"lib/repo-state-clean.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45a26017658930ff068437a45ec995ca3c7d3741bfff01d5280977d8f2248a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.compatErrors (cyclomatic 23): ship-policy.compatErrors 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":"lib/ship-policy.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36bc9ec0aef95a75117fda6b602732a56f204d8606f5f593e8041c851d63b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-autoplan-snapshot.requireMethodology (cyclomatic 23): gstack-autoplan-snapshot.requireMethodology 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfd59c4f815bf388adfdac298561b1b7b6a0ee4c46a7171137de872f278b6c7"}},{"ruleId":"D1","level":"warning","message":{"text":"design-md.tokensFlat (cyclomatic 23): design-md.tokensFlat has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01722a5f196a2d1264ba101fa4a00fca44863cf23d2db0648fe69df22703e7"}},{"ruleId":"D1","level":"warning","message":{"text":"url-validation.normalizeFileUrl (cyclomatic 23): url-validation.normalizeFileUrl 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":"browse/src/url-validation.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a3e873a37a4947f01f361cb4ec63daa9235bfeb1ea9afad4958f8f955dfdd4"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-commands.parseScreenshotArgs (cyclomatic 23): meta-commands.parseScreenshotArgs has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"be35c2fc6704ad9524b3ade4b3f35fe9c7924939b21ef85f53d21e99d036ae58"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-cost-history.simulateArrivalTrains (cyclomatic 23): gate-cost-history.simulateArrivalTrains has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost-history.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a755e380f497d211e19fc5eb80ddc91cd47c1dccba11d04dcc526144057dfce"}},{"ruleId":"D1","level":"warning","message":{"text":"ci-gate.parseCiGateArgs (cyclomatic 23): ci-gate.parseCiGateArgs has cyclomatic complexity 23 (threshold 15). Of this number, 19 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":"lib/ci-gate.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d075a5edffc92e0cdd10d332098b9735220f372ceb134aa0d1fca4d40dc2a79e"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-reconcile.parseRecordFindings (cyclomatic 23): autoplan-reconcile.parseRecordFindings has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f181301d9917e60315ee1698d4eb79c8609f03cd3e603c24797651427541c5"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-checkpoint.checkpointRun (cyclomatic 23): autoplan-checkpoint.checkpointRun has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 148). 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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f3cd6179d90b115c7588f9e3b4a6fdadd7632365255e1522ae26201d833b4"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt.planCarry (cyclomatic 23): ship-receipt.planCarry 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":"lib/ship-receipt.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0539e90e085edf691a2ea0448f03e902852ccae079035ed2945d6ad2a3be99"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-reuse.parseReuse (cyclomatic 23): gate-reuse.parseReuse 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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff9d3b95c6d6d87ee500a34ca20e7e1d3b540fb7b3a144fb2ac05437ee5ef91"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-gate.dispatchWorkflows (cyclomatic 23): ship-queue-train-gate.dispatchWorkflows has cyclomatic complexity 23 (threshold 15). Of this number, 20 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a913b7ed40deb2298a5ff48bbc7309dc4b1209508af4727f18577b141748524d"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-post-merge.verifyPostMerge (cyclomatic 23): ship-queue-post-merge.verifyPostMerge has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-post-merge.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b9bfb24b468facb68f1113ef3610a1e798b27bc63722e2c6c151e956770d91"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-init.trainDoctor (cyclomatic 23): ship-queue-train-init.trainDoctor 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":"crew/lib/ship-queue-train-init.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8cdcbab68b2eae696d24899183a5f021d7fe0f7aa6f817aa9903b6196988dc"}},{"ruleId":"D1","level":"warning","message":{"text":"release-cadence.decideDaily (cyclomatic 23): release-cadence.decideDaily 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":"crew/scripts/release-cadence.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"db93c4add8bdfa82495d8246447dd08fb969f2fe56e82aaaf2ca49603676b6db"}},{"ruleId":"D1","level":"warning","message":{"text":"shell-writes.shellCommands (cyclomatic 23): shell-writes.shellCommands 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 one function item inside it that branches (end). 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":"lib/shell-writes.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc0b5d1c70def071070ddfab4c4e0242ccfac999806067ca5d31628ffb249dc"}},{"ruleId":"D1","level":"warning","message":{"text":"timeline-stop-hook.repairTimeline (cyclomatic 23): timeline-stop-hook.repairTimeline 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 cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd825155765c64f490a4c618b4c7018745d1a773d232cd08dd3aa6c30dcdbfe"}},{"ruleId":"D1","level":"warning","message":{"text":"gen-accessors.snapshotTypeIssue (cyclomatic 23): gen-accessors.snapshotTypeIssue 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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefbadd492bd01bdd2ef48d5dd431127b83497963c0db4bb05c2c3112929c630"}},{"ruleId":"D1","level":"warning","message":{"text":"prose-lint.lintProse (cyclomatic 23): prose-lint.lintProse has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 167, 192). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/prose-lint.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51012c9364e90d6ae4d06050cdeefb208dc5eeb4f6fa0782ade3858a997e9fd"}},{"ruleId":"D1","level":"warning","message":{"text":"archive-check.parseIssueList (cyclomatic 23): archive-check.parseIssueList 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 cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45509a162ad8d4d54ce17aa15480c014ba0e8d73773421da91fb3f38132b7b3"}},{"ruleId":"D1","level":"warning","message":{"text":"process.runProcess (cyclomatic 23): process.runProcess has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 650, 614, 599, \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":"lib/cso/process.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c1763bd3a4e39166eaa9f437038ca163c1b776dc15763a54052578f28ccb6"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicArchiveCache.materialize (cyclomatic 23): PublicArchiveCache.materialize has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 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":"lib/cso/cache.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f94f0fe65e1dcef77e3dc3a3befc156fad1cddd91241e904f7337d5400dbe90"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.inspectNode (cyclomatic 23): preparation.inspectNode has cyclomatic complexity 23 (threshold 15). Of this number, 18 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":"lib/cso/preparation.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecd873778682436d9169b41bed00e0594d1bb02d7cdffa24420ca0f94febbe3"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.railsDatabaseConfiguration (cyclomatic 23): preparation.railsDatabaseConfiguration has cyclomatic complexity 23 (threshold 15). Of this number, 18 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":"lib/cso/preparation.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f3f12f18d0ac1e8238c244b9a126b5b2a9e346b4a5c48f7165d001be665de2"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparationExecutor.prepareOffline (cyclomatic 23): PreparationExecutor.prepareOffline has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: preparation-executor.validateOfflineReceipt (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"688921398ea8792447edcb33b8fa2198d844383e9709675bf31d484d9982db9c"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.createPreparedExport (cyclomatic 23): preparation-container.createPreparedExport 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 shape REPEATS in the file: one other method here (preparation-container.createPreparedExport::walk) 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":"lib/cso/preparation-container.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e9e62ab1419a28e4ccf97428c83c93397b5ea1a7b443ae36f0f1868dd0e71a"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-docker.validateAcquisitionOutput (cyclomatic 23): preparation-docker.validateAcquisitionOutput 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"815c9d404fb305f6c7e3e899465d7fa98dbc8f96768d77e090282c694c21f958"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.finish (cyclomatic 23): cli.finish has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1512, 1546, 1527, \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. This is NOT this file\u0027s highest cyclomatic complexity: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3a82ce340dbfcd3b7c28c22093f30962ebe58db86caff44d81bd85ced32c22"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.preparedVerificationExecutor.observe (cyclomatic 23): cli.preparedVerificationExecutor.observe has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03983fb964d0e39a6f05f1cc3f4831993e753df0af8721eec5bf6ff84c38ae"}},{"ruleId":"D1","level":"warning","message":{"text":"regate.evaluateRegate (cyclomatic 23): regate.evaluateRegate 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":"lib/pregate/regate.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba77e0a4c6dd00c7a524335ad6e2a2baf35e3f6dfa8bfb8516b0d8403433771d"}},{"ruleId":"D1","level":"warning","message":{"text":"runaway.emptyWakes (cyclomatic 23): runaway.emptyWakes has cyclomatic complexity 23 (threshold 15). Of this number, 12 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":"lib/runaway.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e5e8b5cb2bf58afd4f5a17bba0eb2446cc13df0cd890bebf147456c2b8dbb7"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.rebuildLedger (cyclomatic 23): ship-budget-cli.rebuildLedger has cyclomatic complexity 23 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c85197b593d49326e2bd00104b71c60c62179a049e5e7443594d382494572c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-sidecar.uidSidecars (cyclomatic 23): ship-sidecar.uidSidecars 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":"lib/ship-sidecar.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c87bc2111f616918999729881079cf1dbff64d781fe41b2d7bfb99ee11159d"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-parts.shipParts (cyclomatic 23): ship-parts.shipParts has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 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":"lib/ship-parts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e990a9cde26d688cb7ad2e91998287e54e1d2f31a9ab557828058ae2a43f1336"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land-direct.verifyMerge (cyclomatic 23): ship-queue-land-direct.verifyMerge 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4181f4155526c0bed160bc3e7382c19bb769b4f6fcdc7e8010e6d8825627b448"}},{"ruleId":"D1","level":"warning","message":{"text":"index.Deno.serve() (cyclomatic 23): index.Deno.serve() 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":"supabase/functions/community-pulse/index.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6969430b13a07975fbf3c20a2097d0616a6632ce4a617bbbba9529064477cb"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-engine.redactJsonFindingSpans (cyclomatic 22): redact-engine.redactJsonFindingSpans 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":"lib/redact-engine.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4687d89c72f2baa94d718f15a44724e73e98c7d82117c2fbe38980f213628b"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.disarmedAt (cyclomatic 22): phase-publication-hook.disarmedAt 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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e02dcb8ab711d684b77c94a3c94b3e7f45c0119236ff99af137b9b8ad081c92"}},{"ruleId":"D1","level":"warning","message":{"text":"script-invocation.resolveWindowsBash (cyclomatic 22): script-invocation.resolveWindowsBash 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":"lib/script-invocation.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce00a6a47a8c074a611dae68bae59572d9de62b3d2d555cf52b9045856e0635"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-helpers.extractGbrainBlock (cyclomatic 22): gstack-memory-helpers.extractGbrainBlock 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":"lib/gstack-memory-helpers.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cf92c2350d7c418d2687b0e666aa9dd868797b730a9996c900056a80c1aded"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.importAndApply (cyclomatic 22): gstack-memory-ingest.importAndApply 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b9ace32419a7436a7869b06ccfd0a07c061a9f5382bcd7fe72295ef0be5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-identity.canonicalRemote (cyclomatic 22): remote-identity.canonicalRemote 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":"lib/remote-identity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"42917d1b75f6d7bbc88736cf357fcbdf399fd791b998e40892bc18c932548f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"aside-render.renderWithBrowse (cyclomatic 22): aside-render.renderWithBrowse has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4f816b60d64c2601466bd796499e93a354d15c2f72d4ff3c94073eb65fe69b"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.close (cyclomatic 22): BrowserManager.close has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5eda6cee994650b61bf10b72143f7ded2e764d846dc4d2deda32d52cbdc9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent-control.agentStatus (cyclomatic 22): terminal-agent-control.agentStatus has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2647bd95313d3a11039561043daa0f7ae7368634b16f7a8957f055261dd5cfa4"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.startServer (cyclomatic 22): cli.startServer 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":"browse/src/cli.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c17c34c077e0e1eb12e980ccc96533e28c350366520330db872a9536cddf0da"}},{"ruleId":"D1","level":"warning","message":{"text":"config.guardErrors (cyclomatic 22): config.guardErrors has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 149, 158). 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":"lib/pregate/config.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f2d0c009afda3f815249340308c09281740f83b4e79913afb93572e10c3814"}},{"ruleId":"D1","level":"warning","message":{"text":"index.keepSameTreeClears (cyclomatic 22): index.keepSameTreeClears has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5897e132b4fa8d24b01adb3fa2f499bfbe946952efc8d38d0cd34188127bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"approval-classes.classErrors (cyclomatic 22): approval-classes.classErrors has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"750a3670e8786cdc00b623044960fcc1bc0b947401a26d00ef508ec6212ba1c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt.heldBy (cyclomatic 22): ship-receipt.heldBy has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 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":"lib/ship-receipt.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7744088955cb29d8756e8f1824ed72b562992d8f43c1826b20a8a4d9d38802"}},{"ruleId":"D1","level":"warning","message":{"text":"review-exclude.grepFixed (cyclomatic 22): review-exclude.grepFixed 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":"lib/review-exclude.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fd974dca45fca3d24d81388a2b085464f2b925ecc69fc832a34c868c101869"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land-lock.acquireLandLock (cyclomatic 22): ship-queue-land-lock.acquireLandLock has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 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":"crew/lib/ship-queue-land-lock.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a87b7e127fb07425b12f6d5662e1df9d0905a5092e277c1911ae750580c32ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land.buildStamp (cyclomatic 22): ship-queue-land.buildStamp 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":"lib/ship-queue-land.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a31ff5fb902eeec4d1f818bbfd1397d9c0e1f8f11b9997a32b61f37face8a"}},{"ruleId":"D1","level":"warning","message":{"text":"train-backstop.runBackstop (cyclomatic 22): train-backstop.runBackstop has cyclomatic complexity 22 (threshold 15). Of this number, 20 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":"crew/scripts/train-backstop.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc540b858e0d65f050cbea455c96bd0a28f5af37540a0882a1e548d937510fca"}},{"ruleId":"D1","level":"warning","message":{"text":"variants.runBriefsBatch (cyclomatic 22): variants.runBriefsBatch has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 4 function items inside it that branch (runOne, runOne::attempt, runOne::finish, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b274e62f66fecf981d6328506d0742718b0cf70bb96d642da45a5d4155b0271e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleLoopback (cyclomatic 22): index.handleLoopback 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":"ios-qa/daemon/src/index.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9ba2dbeff483e6c445b64d6e64470bbc1fe770dc89c4ad4c8484d3b459ebd8"}},{"ruleId":"D1","level":"warning","message":{"text":"checks.manifestChecks (cyclomatic 22): checks.manifestChecks 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":"lib/checks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c23931a773b36f819137c54338c90e13d817589fb42002c6d3b24f1031c79aa"}},{"ruleId":"D1","level":"warning","message":{"text":"state.recoverLeasePublications (cyclomatic 22): state.recoverLeasePublications 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":"lib/cso/state.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e2f637e939ba4f20b4a5b39a7e283b4f4d124bab346207169ae5986cf40266"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicArchiveCache.cleanIncoming (cyclomatic 22): PublicArchiveCache.cleanIncoming 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":"lib/cso/cache.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ac6e527ec4558cae0ffcdf82b41e1bcecad5d76568c7e55674b5b23f6e55af"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.readStableWith (cyclomatic 22): snapshot.readStableWith 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":"lib/cso/snapshot.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cc22bc97893bdabab17a809b11a55f8fa95076c60a7e2c5954f34e5ef009f7"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.inspectPreparation (cyclomatic 22): preparation.inspectPreparation has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ec0c9dd03d88bc3bcbba0a77a4f564e29a30cdf6b060941d9ba5f7dafbc486"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerPreparationSandboxRunner.prepareOffline (cyclomatic 22): DockerPreparationSandboxRunner.prepareOffline 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac378a95fb61518e933ebcd66c09fbf3c8f733e3556e1598a6bb18ac046bf2ad"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseStart (cyclomatic 22): cli.parseStart has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9433f500c1d6d66d703ea077382171193b441f1c4d5a5f2a3a03d7668f44ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"gbrain-supabase-provision.apiCall (cyclomatic 22): gbrain-supabase-provision.apiCall 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":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4759b8185a5d350a948cf3a124fd3c4dff1c771eaefa9a4f3da1b3dce27e62e2"}},{"ruleId":"D1","level":"warning","message":{"text":"harness-start-hook.inspectHook (cyclomatic 22): harness-start-hook.inspectHook has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ef9ad92ab95cf3e860596655f843bf06538e9a308d8825a085206a120e437c"}},{"ruleId":"D1","level":"warning","message":{"text":"pr-shots.diffLines (cyclomatic 22): pr-shots.diffLines has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4473ca300c503261bcb61275e53bf48b2e7423b2bda0ff14172ac17640c61f"}},{"ruleId":"D1","level":"warning","message":{"text":"review-sweep.inventory::walk (cyclomatic 22): review-sweep.inventory::walk 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":"lib/review-sweep.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4433ebc10820092092f78ed85e392fca856bd34b8348a56072cc0500b947d6a6"}},{"ruleId":"D1","level":"warning","message":{"text":"review-targeted-delta.targetedDelta (cyclomatic 22): review-targeted-delta.targetedDelta 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-targeted-delta.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"003eba0bbe3a4f07db3dc50b49bfcd48831ffe774ae2441326089e591736edd3"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.cmdCheck (cyclomatic 22): ship-budget-cli.cmdCheck has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 309, 312). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc247ac639f533e415bb70aa65f38e796e4fc35ff4f21e7481caace65eca304"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.leanStep (cyclomatic 21): review-depth.leanStep 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":"lib/review-depth.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"987bfcfe90f09dfe9e7636b4c439ff458e626d619cb2fad77665184afd2f0a76"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-design-md.main (cyclomatic 21): gstack-design-md.main 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":"bin/gstack-design-md.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bc3abfab69123a687b139398c6b85c36f94d4698ccd7c1881e7a1856a20452"}},{"ruleId":"D1","level":"warning","message":{"text":"transcript-consent.guardUnpublished (cyclomatic 21): transcript-consent.guardUnpublished 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":"lib/transcript-consent.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc57253b359c0febb1c80cc58da38450bf4735a9b74cbb1ebef80c90527dee8"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.transcriptPrefix (cyclomatic 21): gstack-memory-ingest.transcriptPrefix 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"21940ac914dbdb119db5832f36b1bbe7dcd2d6a0d8b11e86530f83cc167275b6"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.probeMode (cyclomatic 21): gstack-memory-ingest.probeMode 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42d1e25a37567331e479484ca355507c28ec9df4e894ec7a7c620d4068ee577"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-pins.satisfiesOne (cyclomatic 21): runtime-pins.satisfiesOne 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":"lib/runtime-pins.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea82b8812653a0a7a51648dc96e61d9d3448f0fc98379ed8560430fe4295619"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.restoreState (cyclomatic 21): BrowserManager.restoreState has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa1ce0299495ca8b496a47bf5ae179e9474bed59e0a8bdec7930b20e75701c8"}},{"ruleId":"D1","level":"warning","message":{"text":"cdp-inspector.modifyStyle (cyclomatic 21): cdp-inspector.modifyStyle has cyclomatic complexity 21 (threshold 15). Of this number, 18 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":"browse/src/cdp-inspector.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41bde55bbf05b26e50d8f4bc877a21fb1b8f63a86a590b9d1bf6d360664bd2f"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent-control.spawnTerminalAgent (cyclomatic 21): terminal-agent-control.spawnTerminalAgent 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7028d252062674a351ab5a7548bffa038bd72572b543f9ff17eb3488baf2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-commands.buildPdfOptions (cyclomatic 21): meta-commands.buildPdfOptions 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":"browse/src/meta-commands.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ca75359d1559f59cd4c38c44e4c5695baf0d19b0f535e3f02ee9fca5189bb6"}},{"ruleId":"D1","level":"warning","message":{"text":"server.buildFetchHandler (cyclomatic 21): server.buildFetchHandler has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1560, 1767, 1789). 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":"browse/src/server.ts"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"2007d1b89f9a3ce7f763df44c3e07f775ce40deea856329d583f8ace2944fdaf"}},{"ruleId":"D1","level":"warning","message":{"text":"security.combineVerdict (cyclomatic 21): security.combineVerdict 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":"browse/src/security.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e5213b2ee5c5a6993c1ee9ae447097c1899d2fc9575d23ef2ee0245d1e9314"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.queueOrderCheck (cyclomatic 21): restamp.queueOrderCheck 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":"lib/restamp.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec16eb018c948b34b74d8fb05f1ed8164408d855200ed7f4d2fb6f3de9083a25"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-reality.checkRealityRows (cyclomatic 21): plan-reality.checkRealityRows 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":"lib/plan-reality.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"485d37bc7109e1dd34ebea9b785337a0bce668adcef7a28ea3c3803cc5954df8"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.openPhase (cyclomatic 21): autoplan-run.openPhase has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"abffc24b3eae904de2256e94870d9d4fd6679763fd0ed651f15a4e8e0485fd27"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-checkpoint.restoreCheckpoint (cyclomatic 21): autoplan-checkpoint.restoreCheckpoint has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 237, 241). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0734f051e5a810ad793edaf819cc0c6c0d3bbd487e7034e9ceda7266defceb6d"}},{"ruleId":"D1","level":"warning","message":{"text":"approval-record.buildRow (cyclomatic 21): approval-record.buildRow has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e035ff88bd2e1266ed9925cd9dfd5ac9023edc97e49537da40c1d1845d895ad"}},{"ruleId":"D1","level":"warning","message":{"text":"headless-artifacts.checkSchema (cyclomatic 21): headless-artifacts.checkSchema 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":"lib/headless-artifacts.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ee8a48bd8146c74e6656ea1b1609613c519499b9aa383d5d251d7016976eb"}},{"ruleId":"D1","level":"warning","message":{"text":"rust.componentMatch (cyclomatic 21): rust.componentMatch has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd57d90af93a7fe86e02c69d7e80d1710ab501ca86d6f6b6690783cd3f173089"}},{"ruleId":"D1","level":"warning","message":{"text":"doc-links.brokenLinks (cyclomatic 21): doc-links.brokenLinks has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 50, anchorsAt). 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":"lib/doc-links.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2bfe4edbdaedbf54b4e74decfb1aece6eaef61f35dce3a3596310d066cc4be"}},{"ruleId":"D1","level":"warning","message":{"text":"lanes.run (cyclomatic 21): lanes.run 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"326985e274ce6a8bf09276879c2753ee135c2d36390f3bff4f2f3400b4d168d1"}},{"ruleId":"D1","level":"warning","message":{"text":"stable-release.newestStableRelease (cyclomatic 21): stable-release.newestStableRelease has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/stable-release.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"988548cb704ae5da02f8f84730d718c4b0f5bdbc877d31e81972ccfc937ddde1"}},{"ruleId":"D1","level":"warning","message":{"text":"secrets.addedLines (cyclomatic 21): secrets.addedLines has cyclomatic complexity 21 (threshold 15). Of this number, 19 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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc595dc5c159303d8d3acc96de5d77ce9eb417653ce6c2e217f74cee43367dc"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-receipt.substituteStampOnlyTree (cyclomatic 21): remote-receipt.substituteStampOnlyTree has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/remote-receipt.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9e6592e2d224dc8607460b1b8dfa4293c4c8bf0a0fc1b5422457cbc9a370e"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-gate.recomputeMergeTree (cyclomatic 21): ship-queue-gate.recomputeMergeTree has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa12ff4bac8bdad062a711455640832174612b9586a1e1c3c04b0e156ba33d29"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-dispositions.gateAcceptance (cyclomatic 21): gate-dispositions.gateAcceptance has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: gate-dispositions.writerShaped (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":"lib/gate-dispositions.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1cf372bf437f52f03465f65d8df74cb102fe1ac0084560d7e0cde02283cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-docs.carriedAudits (cyclomatic 21): ship-receipt-docs.carriedAudits has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-docs.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"af824b86a8bae63a054fbf26be3aeda14f0da6aa38593f7be3a8e43eba3544ce"}},{"ruleId":"D1","level":"warning","message":{"text":"pr-wait.parsePrWaitArgs (cyclomatic 21): pr-wait.parsePrWaitArgs 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":"lib/pr-wait.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc4e37a329ad4d5a3dbec2afbb01569f2960bdffa1b5d922defc420537a7b37"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land.repair (cyclomatic 21): ship-queue-land.repair 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":"lib/ship-queue-land.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c5ab41003b411d4efe6598916a16e00c81fe18c2fe289cc2d9d0dbfb76a00b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.scanCandidate (cyclomatic 21): index.scanCandidate 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":"lib/gate-diff/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dfa20758ac7466bb3227f9f74442e58e7f54ee621c1e0e62d07c2662226eed"}},{"ruleId":"D1","level":"warning","message":{"text":"spawn-bin.runExternal (cyclomatic 21): spawn-bin.runExternal has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 166, 139, 162, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/spawn-bin.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ec137e6eb7bd78229f2665a91c698cd338c5650456c3e6a2d248d8f4e14c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-gates.runGateHook (cyclomatic 21): skill-gates.runGateHook has cyclomatic complexity 21 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-gates.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2973037b4a62175d15a5e1e4e420110cff9fb14b253c3970cf3eb426650a053b"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-shadow-reader.exportShadow (cyclomatic 21): autoplan-shadow-reader.exportShadow 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":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"637345fc32fcc4efd964be61dabba26241f6f6c2da64d7060e8052bc4ab5f20c"}},{"ruleId":"D1","level":"warning","message":{"text":"state.chooseRunLeaseTicket (cyclomatic 21): state.chooseRunLeaseTicket 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":"lib/cso/state.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"a836e0d43018604d70c119df46cda07f5c334f7a40728c6547a6db185b234375"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryEgressBroker.openTunnel (cyclomatic 21): RegistryEgressBroker.openTunnel has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea12b381db8d5a6f3a75bde90377f2eed37c7c76f718cddc491cdbfacebcf5b"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerPreparationSandboxRunner.acquire (cyclomatic 21): DockerPreparationSandboxRunner.acquire 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09de584dbf256dcdf1a255c907b76b05469ab57a6f1b561706700ee20e9368a"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.validateBoundRecheckClaim.evidence (cyclomatic 21): cli.validateBoundRecheckClaim.evidence 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 is NOT this file\u0027s highest cyclomatic complexity: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"74475e00cb802c4430c0d721662fd7ae0f9011b92e8704f3d6b97ada7b927628"}},{"ruleId":"D1","level":"warning","message":{"text":"design-build.parseInventory (cyclomatic 21): design-build.parseInventory 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":"lib/design-build.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ee08503ccd0f5b488d681be8702108e9d6d6dbe8978c109d8e3aaa6fdf4337"}},{"ruleId":"D1","level":"warning","message":{"text":"dx-error-capture.release (cyclomatic 21): dx-error-capture.release 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":"lib/dx-error-capture.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d268e9174ec1c639c3d95f83c06ff906864e47da65218fc4666b6cd8909b0683"}},{"ruleId":"D1","level":"warning","message":{"text":"model-policy-freshness-publication.publishFreshness::publish (cyclomatic 21): model-policy-freshness-publication.publishFreshness::publish 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":"lib/model-policy-freshness-publication.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa42bd3b34b33418c7f67b54bb79e83a974581fe5bc92cad67099c99d547eacc"}},{"ruleId":"D1","level":"warning","message":{"text":"office-hours-review.renderOfficeHoursReview (cyclomatic 21): office-hours-review.renderOfficeHoursReview 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":"lib/office-hours-review.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d5d99b75fd15d1fbc4311488e8908e2e2aae9940bcf7eaf9eeb96b1ebe87c7"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget.measureSettled (cyclomatic 21): ship-budget.measureSettled has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d54c4a01b9bcb457aab7946550b6109d1dbb4979e3e01cac6c40f0eae0c344"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-preflight.merge (cyclomatic 21): ship-preflight.merge 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":"lib/ship-preflight.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e5abea386f2e1d4443f21428450cf6d123878b6a922e6da79071d0e123b754"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-owned-journal.scan (cyclomatic 20): claude-owned-journal.scan has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (claude-owned-journal.scan::record) 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":"lib/claude-owned-journal.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac595e5a4d5e68e67cd13cfbbf0ff8b3667e138754a4161b7120d91f1c78e5"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.filterArgs (cyclomatic 20): activity.filterArgs has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/activity.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9656a64aa1a9c8e864dbb3135ac8d31ccd6e53355b52e3ca861a9a08873248eb"}},{"ruleId":"D1","level":"warning","message":{"text":"sanitize-echo.sanitizeEcho (cyclomatic 20): sanitize-echo.sanitizeEcho has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sanitize-echo.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d573697718e2c19e4e681a4a74b7fa96942312a302aadb753adcb3e3aab12b"}},{"ruleId":"D1","level":"warning","message":{"text":"read-commands.isSingleParenOrIifeExpression (cyclomatic 20): read-commands.isSingleParenOrIifeExpression 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":"browse/src/read-commands.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceba4005732d538cfb8b2d97b2787ca19b3d7f3a873ae93daa59732978fd43e"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.withRunLock (cyclomatic 20): autoplan-run.withRunLock 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":"lib/autoplan-run.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24a3f4b1ae74a9ea648db6a49cc05a1eac1cb982f07d200fdbb7f41e8af14ef"}},{"ruleId":"D1","level":"warning","message":{"text":"sealed-guard.landedOnBase (cyclomatic 20): sealed-guard.landedOnBase has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20b62d0108b0fc61cfe6f03269b21c7ea9619f25a2a0c37c9bded4f6bf2835a"}},{"ruleId":"D1","level":"warning","message":{"text":"sealed-guard.evaluateSealed (cyclomatic 20): sealed-guard.evaluateSealed 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0358924b370bb6eff328056677b8bde82e71a090588ce156da543d520c332068"}},{"ruleId":"D1","level":"warning","message":{"text":"install-verdict.verdictFileProblem (cyclomatic 20): install-verdict.verdictFileProblem has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/install-verdict.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d90f0fe9ea12f44b75ac228896ccfcf0dd78b81665119ef1780d4312fd5de7e"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.launchRuntime (cyclomatic 20): runtime.launchRuntime has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"lib/pregate/runtime.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d3b9aa9c4ec845942b4ea8d7adfe9d631245c1dae5397f3baba58ee9f1ac24"}},{"ruleId":"D1","level":"warning","message":{"text":"import-graph.stripJsonc (cyclomatic 20): import-graph.stripJsonc has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7cd2ce0edaeaaab469abbaf9e2f4852dd09c350b9e60ee4e9d7f6ea2983069"}},{"ruleId":"D1","level":"warning","message":{"text":"init-draft.draftConfig (cyclomatic 20): init-draft.draftConfig 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/init-draft.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e19aa0e4add6b7698ff137adc3025dab1c945b89e9574d040e38c7a364ee13b"}},{"ruleId":"D1","level":"warning","message":{"text":"docs-only.classifyEntries (cyclomatic 20): docs-only.classifyEntries has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 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":"lib/docs-only.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf66969e0763f29d8ab2cbb9738d873fb7bee66ea5b0d0903e21e74b5988172"}},{"ruleId":"D1","level":"warning","message":{"text":"run-check.gateInputsChanged (cyclomatic 20): run-check.gateInputsChanged has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/run-check.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea920e02c7bdf8970f9fbb6fcbf68d32d1b15979dfb9b7e385b83dbc0af8b70"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt.receiptSummaryLine (cyclomatic 20): ship-receipt.receiptSummaryLine has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fac75097a393568bda66e6f1e8441ccf7f7cd1309a619aec6cf2633d626e9c"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.receiptDepthVerdict (cyclomatic 20): ship-receipt-depth.receiptDepthVerdict has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"39210e1a8c8669a92df3cb96f85712e2284a49309968419b26170b8fa3467aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.ciAtHead (cyclomatic 20): ship-queue.ciAtHead has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f9a3786650df000c4b8e746057367e33440e54f69f8c1ab5ba7f065b613226"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-gate.genericVerdict (cyclomatic 20): ship-queue-train-gate.genericVerdict 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"730eba2b1cc38618f6bbb94725d92e9b29199436109f0dd8c5de948d0445a7de"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.nextFor (cyclomatic 20): ship-queue-train.nextFor has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"253d4b30335fd05769cd22b11cec1d4535aa4ea1eacfde79d3a0067c7a49c3d9"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-verdict.trainRebuild (cyclomatic 20): ship-queue-train-verdict.trainRebuild 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":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1e6989671e8ff0a1b3f123adb1293c47cb138f43f1f37725817df501d2b78"}},{"ruleId":"D1","level":"warning","message":{"text":"release-gate.collectRound (cyclomatic 20): release-gate.collectRound 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":"crew/lib/release-gate.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f53c6a73cc26ce92bd0bc299c53df7666534f83c08ba673308f69d3328a4be7"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-ready.verifyScreen (cyclomatic 20): ship-queue-train-ready.verifyScreen has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b09238247776f84792635fc33b7db56b2b00d29952f1bf97e9c622cec60a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-verify.confirmMerged (cyclomatic 20): ship-queue-train-verify.confirmMerged has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9880f30d21e0f43712bf3d75e74ba119f57fdfec235bb6926f3fa4832d468e2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-land.trainLand (cyclomatic 20): ship-queue-train-land.trainLand has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8195a17cf5d5cfc8a7436d9c48742d6298f98755f1e246670ce5ef6ab9a8c759"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-init.trainInit (cyclomatic 20): ship-queue-train-init.trainInit has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-init.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce369b6bef4f51bece229fd3daf8ef374f3d3052d470f3a370982240091d325"}},{"ruleId":"D1","level":"warning","message":{"text":"release-cut.planDaily (cyclomatic 20): release-cut.planDaily 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":"crew/scripts/release-cut.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1f352703a1f1983657fba9a83b93dd621bb3c2bb0392bd38d674ef1e532ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"train-backstop.coveringRecord (cyclomatic 20): train-backstop.coveringRecord has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc60da1f9dc2519057f95a9bb34d0182f6a4f9e461bef8942fc9a2ac20b8a8d7"}},{"ruleId":"D1","level":"warning","message":{"text":"question-log-hook.main (cyclomatic 20): question-log-hook.main has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6ab2f665e792ed9dff9bb504c7e6805450ec7cae5c83b5e53db1ccbdc526c"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy.proxyToDevice (cyclomatic 20): proxy.proxyToDevice has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 71, 83, 100, \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":"ios-qa/daemon/src/proxy.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b8764b4f3962e52367fb71d215806b1459dfbbc95311a67114ec56fc41560a"}},{"ruleId":"D1","level":"warning","message":{"text":"model-policy.codexSignals (cyclomatic 20): model-policy.codexSignals 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":"lib/model-policy.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa0a2225aba8394a33601cfc1ce206e29546b10c039e60aa06e5300e045d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readPrivateJson (cyclomatic 20): state.readPrivateJson 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":"lib/cso/state.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b10ce7b768030f802df556ac494e5bfe9b950b3f2613d3a54be812ef1c647f8"}},{"ruleId":"D1","level":"warning","message":{"text":"state.recoverDeadLease (cyclomatic 20): state.recoverDeadLease 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":"lib/cso/state.ts"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"345810ba82d3a8ddc4df5586f8ff4da20788e8808635ce45ba34edde0aa0be76"}},{"ruleId":"D1","level":"warning","message":{"text":"state.repairBundleExpiry (cyclomatic 20): state.repairBundleExpiry 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":"lib/cso/state.ts"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdd63d410781def75a4744e3f69e870b0d2b70171a7697b5893084ab2fdaf56"}},{"ruleId":"D1","level":"warning","message":{"text":"admission.acquireClaim (cyclomatic 20): admission.acquireClaim has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aec6e6b0f2dba81a6cc8eeaddd1b05d4a76e8a88a58d947dace1453a350a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.inspectBun (cyclomatic 20): preparation.inspectBun 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":"lib/cso/preparation.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8396d42833914b4ade9d3e31e9c0de00b9ff3185d64fded47e6f4d20042ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.seed (cyclomatic 20): preparation-container.seed 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":"lib/cso/preparation-container.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d3f2f22d25800372eb25ee6e81ef0715a7a0b1bbc137b5f1c24cb5ba505244"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.main (cyclomatic 20): preparation-container.main 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":"lib/cso/preparation-container.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae066fe15a7b643c8e010b33c8699912631749f1eba3a30e73a8987ec8dd8479"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-docker.supervisePreparedCall (cyclomatic 20): preparation-docker.supervisePreparedCall 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6656fdd6848b93282ae2d0e2307d70b1f9c4212648c57265ecc3dd8a1c4c9d2"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.recheck (cyclomatic 20): cli.recheck has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 1935). 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: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d96c06a921847752a780eca63434e55f7235fc736bd14ac32e23848368b828"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-deadline.qaDeadlineMain (cyclomatic 20): qa-deadline.qaDeadlineMain 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 295). 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":"lib/qa-deadline.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab574c5d7e1b7824917c783b5f9222bbf7c0abb5507a7077d26b61fd79537075"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-plan.runPreregDiagnostics (cyclomatic 20): eval-plan.runPreregDiagnostics 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":"lib/eval-plan.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fcb4f43f5174d14e5ac174d55696021526836f63f7c59e83e3a0723ce4666b"}},{"ruleId":"D1","level":"warning","message":{"text":"eval-plan.startPilot (cyclomatic 20): eval-plan.startPilot has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7dbba44c07928a68ab941de9bb49d8f0344b5a9cdd4f17130ff1436eda350d"}},{"ruleId":"D1","level":"warning","message":{"text":"review-fetch.splitCommands (cyclomatic 20): review-fetch.splitCommands has cyclomatic complexity 20 (threshold 15). Of this number, 18 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":"lib/review-fetch.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8448a2d79e47a30d94a394dc77f7a95d8b0c8001c6db23e168f4ff34c20b1b"}},{"ruleId":"D1","level":"warning","message":{"text":"review-evidence.checkSharedLibsReuse (cyclomatic 20): review-evidence.checkSharedLibsReuse 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: review-evidence.canReuseSharedLibsAdvisory (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d067fa807114230dab98c22c81f13c854a6212a01a0b4504a4edaaff03413163"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.cmdNote (cyclomatic 20): ship-budget-cli.cmdNote has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 398). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b38f56ef2410ab8d836cd2a57a344889106663c3788f4212866f119bfa7ac32"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-handoff.cmdVerifyHandoff (cyclomatic 20): ship-handoff.cmdVerifyHandoff has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d352f7515d9378f2587168f94fca52ecf61d2cdff5065b064e6ae4954627535f"}},{"ruleId":"D1","level":"warning","message":{"text":"owned-read.ownedAutoplanRead (cyclomatic 19): owned-read.ownedAutoplanRead 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":"autoplan/bin/owned-read.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef93e2bd617f5a4a828bacbfd096a9ccb66f6747f6c45d8e009f4339687caf94"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy-readers.readersErrors (cyclomatic 19): ship-policy-readers.readersErrors 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":"lib/ship-policy-readers.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8dd0431f411046a6431fdb41a20c8f3f705f09bd36e75988786d9e58c94d8c"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.pythonFieldEnd (cyclomatic 19): redact-patterns.pythonFieldEnd 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":"lib/redact-patterns.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8bf093a0ce082e6aa13b330bd0680a21690392cdb986019f3e723bae17a639"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.isPropertyRead (cyclomatic 19): redact-patterns.isPropertyRead 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":"lib/redact-patterns.ts"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be016b9f8c25bb449aabce17fc34c73d3156581d81a7ada8bcf050c8da0a70e"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-helpers.secretScanFile (cyclomatic 19): gstack-memory-helpers.secretScanFile has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3316b42537ecb8ed40820b1f7937cb3f52df8fd9f670154fb5016ea428e39fe"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-design-detect.probe::checkSkillDir (cyclomatic 19): gstack-design-detect.probe::checkSkillDir has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (gstack-design-detect.probe) 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":"bin/gstack-design-detect.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2944fb54be7a76866bbd58712894dd998a334d5be6f481cfa92c103d3d356af3"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-gbrain-sync.pruneGoneWorktrees (cyclomatic 19): gstack-gbrain-sync.pruneGoneWorktrees 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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"688a4a870bb5e15cc8b52f8d5f346faf6038b1a90f5ccde8c8795cdd21729c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-pins.collectPins (cyclomatic 19): runtime-pins.collectPins has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"82709b6f4c32be6441099424d6e70bd75c2c998076e1b270dcda07e5bb15df85"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.gateAhead (cyclomatic 19): restamp.gateAhead 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":"lib/restamp.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7dd4d828bcb6084182415d78f008e96367fcdd5f165f50b4d1dc71a7370bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-gate-cost.recReopens (cyclomatic 19): autoplan-gate-cost.recReopens has cyclomatic complexity 19 (threshold 15). Of this number, 16 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":"lib/autoplan-gate-cost.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aecbf12611d47b0ce0305d0a70bb039dc489949da34391530dce6d5e459ffab"}},{"ruleId":"D1","level":"warning","message":{"text":"outside-voice-api.callModel (cyclomatic 19): outside-voice-api.callModel 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":"lib/outside-voice-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"887da85c6071027fd142af16395d5449ce77e06347c50365ce86915f352803de"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-shadow.publish (cyclomatic 19): autoplan-shadow.publish has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 396, 421). 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":"lib/autoplan-shadow.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed216c2a7f5845850621b9d78199caa8a4c9318818101c13f131014b34d3be5b"}},{"ruleId":"D1","level":"warning","message":{"text":"sealed-guard.renderSealed (cyclomatic 19): sealed-guard.renderSealed 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":"lib/sealed-guard.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4d900bb7b7dde696ea1de82f514afcb135e57b0665154eb0b4caf0c10191b7"}},{"ruleId":"D1","level":"warning","message":{"text":"workflows.commandTestFiles (cyclomatic 19): workflows.commandTestFiles 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":"lib/pregate/workflows.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce7e0fa6cfff07f712d406e0b6a603861545a8b9dbb292bce9341b40613faa2"}},{"ruleId":"D1","level":"warning","message":{"text":"rust.depSpecs (cyclomatic 19): rust.depSpecs 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":"lib/pregate/rust.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"faacc1571daddea92d441cddc28d7649b09141af51282df313482f03ce7bdad3"}},{"ruleId":"D1","level":"warning","message":{"text":"rust.cargoModel.membersOf (cyclomatic 19): rust.cargoModel.membersOf has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c51433e36cc512f843cff2fd47cce99d8847337fc9b195f245220e1cae1868"}},{"ruleId":"D1","level":"warning","message":{"text":"literals.run (cyclomatic 19): literals.run has cyclomatic complexity 19 (threshold 15). Of this number, 12 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":"lib/pregate/checks/literals.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"91326c9b93e40825fc9dabf86f85edb596a3fdb85c60b476166bc9ded1e3d158"}},{"ruleId":"D1","level":"warning","message":{"text":"timing.boundKind (cyclomatic 19): timing.boundKind 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":"lib/pregate/checks/timing.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4235a683bfab62ff333f4f92d8cbcf7ac53060e6b82e4f0fc65363079f2de2"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-receipt.classifyFiles (cyclomatic 19): tree-receipt.classifyFiles has cyclomatic complexity 19 (threshold 15). Of this number, 14 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":"lib/tree-receipt.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36625dd574b7c3c7bce78e39469c5f4445c0195f420fadacbe4e3c5a31a2942"}},{"ruleId":"D1","level":"warning","message":{"text":"review-collect.collectLive (cyclomatic 19): review-collect.collectLive has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0dad5a219a231939f01b35c00d80eeff3ba7ac61bcc8aaf81c288317cc13d5"}},{"ruleId":"D1","level":"warning","message":{"text":"review-secret-excerpt.hits (cyclomatic 19): review-secret-excerpt.hits 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":"lib/review-secret-excerpt.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cc057f89aa6d356d4d0f81f3fd468a1ad82761f6e9855076b9d626d53fb54c"}},{"ruleId":"D1","level":"warning","message":{"text":"review-exclude.readSelection (cyclomatic 19): review-exclude.readSelection 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":"lib/review-exclude.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcfe264a591baab47384199f9efbc91ceeec188e16e5b13f566a7a13937fa4f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-docs.parseReceiptDocs (cyclomatic 19): ship-receipt-docs.parseReceiptDocs 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":"lib/ship-receipt-docs.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac64d5bd1c32a1f46940fb4eab0fd0762b95976bb8ec9a05377180470486e9c7"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.reproduceGateAhead (cyclomatic 19): ship-queue.reproduceGateAhead 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":"lib/ship-queue.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ef17e79c993a6d327a0bb7263d3f0520628707babdb73325f1510259ac99fb"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-land.unstampLegacy (cyclomatic 19): ship-queue-land.unstampLegacy 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":"lib/ship-queue-land.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ec849e9068e4dc85f63b99b6dcaa539b16ea18bf2a19edb6937999563f276"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-watch.watchGeneric (cyclomatic 19): ship-queue-train-watch.watchGeneric 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":"crew/lib/ship-queue-train-watch.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a522170248aae4b070c051403819d8e7d87a8ddff46a5f7554851b5be632f6"}},{"ruleId":"D1","level":"warning","message":{"text":"replay-pr-selection.loadInput (cyclomatic 19): replay-pr-selection.loadInput 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":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3093972e3abfe9a9747a5f2962e1cd8e5aec411d76a5f2c6ad1ca36c0a4c317a"}},{"ruleId":"D1","level":"warning","message":{"text":"train-backstop.freeze (cyclomatic 19): train-backstop.freeze has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 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":"crew/scripts/train-backstop.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e9cccd4e95e3520b4aa53023982165d4464456f56eb3e122a4f1152a2d075"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-contract.checkContract (cyclomatic 19): skill-contract.checkContract has cyclomatic complexity 19 (threshold 15). Of this number, 16 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":"lib/skill-contract.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa828e7611360ce2d2e2dcbc58e719511675bbaaf9ab9e4c5591af96fe9245aa"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-stop-gate.handle (cyclomatic 19): autoplan-stop-gate.handle has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 103). 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":"hosts/claude/hooks/autoplan-stop-gate.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07d1c6b1ae8a664c38b716413fbe7689212a2e4e6bc2c065c461b13303ad51a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleTailnet (cyclomatic 19): index.handleTailnet 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":"ios-qa/daemon/src/index.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf20e2b1568bb7bfd9b71bff601a97243012b22727616925f12ec9b9a72244c"}},{"ruleId":"D1","level":"warning","message":{"text":"contracts.legacyJson (cyclomatic 19): contracts.legacyJson 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":"lib/cso/contracts.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"789d533da91782b7060ab419b8d2523dabaa0abac6d47febd989dde01a9b3f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"admission.admit (cyclomatic 19): admission.admit 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":"lib/cso/admission.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0261bcb68551ec3a70bdea8e871e837bd29a4e37df91a8c519da0ad3cd651a3"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicArchiveCache.withLock (cyclomatic 19): PublicArchiveCache.withLock has cyclomatic complexity 19 (threshold 15). Of this number, 14 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":"lib/cso/cache.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b09074c8ef441b0ca97a51889cfc14dfdbb9fb1509592fd3fc9d93605b221a"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.readPolicy (cyclomatic 19): preparation-container.readPolicy 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":"lib/cso/preparation-container.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"610d7fdaaae38e29caa4c6b36326c7895393e5484611ca67e120ab3cdb76886e"}},{"ruleId":"D1","level":"warning","message":{"text":"scanners.scannerLocation (cyclomatic 19): scanners.scannerLocation 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":"lib/cso/scanners.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d531301ded5c4af97a6f74a6f95dd554b769fa2af8b46d701aeb0d74f3703f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.recoveryEvents (cyclomatic 19): cli.recoveryEvents has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (walk). 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. This is NOT this file\u0027s highest cyclomatic complexity: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01d61c43ac54725bd2d8b083bc054f1a976532d9210a328248f13bd7dca88f"}},{"ruleId":"D1","level":"warning","message":{"text":"junit.readCase (cyclomatic 19): junit.readCase 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":"lib/junit.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb09364c73d3c6a23acd202f76c96571bb7087b72a720a68ed53a4b7ee56d61"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.command (cyclomatic 19): gstack-post.command has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c596fc32c5082567fe8bfdfff26e7bbf0b65b5a897943a1eac56e0473f66672"}},{"ruleId":"D1","level":"warning","message":{"text":"pr-shots.buildPage (cyclomatic 19): pr-shots.buildPage has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 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":"lib/pr-shots.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3072cd80a75f7d8ae97a27fe9213661584349b80b7f7376a185f0a4bae58fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"review-evidence.fixRangeBase (cyclomatic 19): review-evidence.fixRangeBase 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between 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: review-evidence.canReuseSharedLibsAdvisory (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e68444b2ca9d18f8578973fadf22d070302cf6bb13c838c5ac7ced58666f438"}},{"ruleId":"D1","level":"warning","message":{"text":"state-matrix.parseSpecialistOutput (cyclomatic 19): state-matrix.parseSpecialistOutput has cyclomatic complexity 19 (threshold 15). Of this number, 16 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":"lib/state-matrix.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"174497259cfa15efd954593c15a3009365c9e4ffddf79f53996bcd57b07464da"}},{"ruleId":"D1","level":"warning","message":{"text":"diagram-prepass.extractDiagramFences (cyclomatic 19): diagram-prepass.extractDiagramFences 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":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd8f0aeb938caea10b6306852c64a2a7b6ba7c9baa6f04856f11c8f45f9e7ca"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-journal-records.signatureField (cyclomatic 18): claude-journal-records.signatureField has cyclomatic complexity 18 (threshold 15). Of this number, 14 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":"lib/claude-journal-records.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df13c2a1858013a324d39ef3c09b851912483743e292aa37e33b63a33706cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.commandGateErrors (cyclomatic 18): ship-policy.commandGateErrors 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":"lib/ship-policy.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9124f8411bfb2d96e691fa01cde4dfb24041e90ed78d15fb3ff34b4896c83f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.baseRedErrors (cyclomatic 18): ship-policy.baseRedErrors has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 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":"lib/ship-policy.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45f0a46aaf56459df32c9b716d914276f5eb32631f1e464f03dd94040d9ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-autoplan-snapshot.snapshotIdentity (cyclomatic 18): gstack-autoplan-snapshot.snapshotIdentity 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b226fc4b4e7273a7748d6bb5600570b1e358186d860bc2b30fba701bed71399"}},{"ruleId":"D1","level":"warning","message":{"text":"phase-publication-hook.consumption (cyclomatic 18): phase-publication-hook.consumption 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: phase-publication-hook.snapshot (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac604cd3a93a9482f6466b90918de9a5a4dc0429d28c86b668c16159ac1f4edb"}},{"ruleId":"D1","level":"warning","message":{"text":"memory-ingest-landing.classifyImport (cyclomatic 18): memory-ingest-landing.classifyImport has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd425ab0dee32387b0761410a7644333192a69f8b0f83726da8793d44cdbc8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-global-discover.scanCodex (cyclomatic 18): gstack-global-discover.scanCodex 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":"bin/gstack-global-discover.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6033223a6f17e359f3a827e5deda6e7049c9b3b806acef4274297ec160c9bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.launch (cyclomatic 18): BrowserManager.launch has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f751667793577f271403da1f2a1ace517642a5c16603722886dc031aa2e6dc"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.canDispatchOverTunnel (cyclomatic 18): commands.canDispatchOverTunnel 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":"browse/src/routes/commands.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a8f801591aeb7a0fc5c0d0fb1f1d0f534d5cdcb019d20e6c176d57e963864b"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog-check.reheadChangelog (cyclomatic 18): changelog-check.reheadChangelog has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ceed362284410710eecc9813eb1512804480f24c9604d31e14497d3f261851"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog-check.mergeChangelogsWithNotes (cyclomatic 18): changelog-check.mergeChangelogsWithNotes has cyclomatic complexity 18 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e078c654a9933a03d753cee304e28ce712cd11c1a58719f6b6a970a0e11548"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence-bundle.verifyBundle (cyclomatic 18): evidence-bundle.verifyBundle has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a989875085412da93188a236ea1db7c6afbbaa5560a44837cd0c0f114ba7733"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.parseUnifiedDiff (cyclomatic 18): restamp.parseUnifiedDiff 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":"lib/restamp.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2fe9b9a4009e19447405cd961646a1b04a44c9c00cbd7752a1748d5aa2d165"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-confirm.lineDiff (cyclomatic 18): autoplan-confirm.lineDiff has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-confirm.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafaa2e43016f2a83bf95f7aac05c4d07ce75de9bb2085ed3f138303ca17ea86"}},{"ruleId":"D1","level":"warning","message":{"text":"spend-ledger.withFileLock (cyclomatic 18): spend-ledger.withFileLock has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee549b4cb4b0f4f1b9306848c83127e62f1a5e4dbda43b29ce0d049c68d648"}},{"ruleId":"D1","level":"warning","message":{"text":"outside-review-result.execution (cyclomatic 18): outside-review-result.execution 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":"lib/outside-review-result.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"74551607312da0009ae062f6a04fdd9568748a8160a1be186bb8702e4aa515da"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-run.statusLines (cyclomatic 18): autoplan-run.statusLines 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":"lib/autoplan-run.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c223d3f0ba7cf258ec78a89cb154846e22ab53f0cf394ddd1ab9b439d600aaa"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-shadow.shadowSwitch (cyclomatic 18): autoplan-shadow.shadowSwitch 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":"lib/autoplan-shadow.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"43014b7164e5cdfefc232e1c66cf436727b71960960eb3942c8f34591808441d"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-shadow.runShadow (cyclomatic 18): autoplan-shadow.runShadow has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 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":"lib/autoplan-shadow.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de28f1875417497c0c1532cfcd01813d39f562d11c393a8065c71c99561de4f"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-checkpoint.verifyGeneration (cyclomatic 18): autoplan-checkpoint.verifyGeneration has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"283cefee34f9a0c5ca7c9a34d07fd66d1c9e819ef4e7ec81b0e1e0840a561376"}},{"ruleId":"D1","level":"warning","message":{"text":"bin-context.markerSlug (cyclomatic 18): bin-context.markerSlug 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":"lib/bin-context.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"28abd289f6cf4785a28e6aeb21d59d72678251e7d239c493f7998af99da44b72"}},{"ruleId":"D1","level":"warning","message":{"text":"sealed-guard.publishedViaPulls (cyclomatic 18): sealed-guard.publishedViaPulls has cyclomatic complexity 18 (threshold 15). Of this number, 14 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":"lib/sealed-guard.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc6dfc884852c74b3099677d42ca9a07d810c88c650f482147ef6b18995b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"rust.rustEdges (cyclomatic 18): rust.rustEdges 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":"lib/pregate/rust.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad31b98fb554c41ddc76673da1ca626432236902345e81ef8995e6856d009a21"}},{"ruleId":"D1","level":"warning","message":{"text":"lanes.detectRunner (cyclomatic 18): lanes.detectRunner 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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd38ef0269b43b222b28f06ee5ae4fe93daf8aa5ce09d341485559a49b7273c"}},{"ruleId":"D1","level":"warning","message":{"text":"version-gate-train.regeneratedAtBase (cyclomatic 18): version-gate-train.regeneratedAtBase has cyclomatic complexity 18 (threshold 15). Of this number, 14 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":"crew/lib/version-gate-train.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33a2d170a39eef3b52a6cadd5074670f2e67bbe45c46ab3ad78d3fa0b6eceb1"}},{"ruleId":"D1","level":"warning","message":{"text":"flaky-exception.flakyDecision (cyclomatic 18): flaky-exception.flakyDecision 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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e848fcf1070d112c681dda41f23695af37dd1abe2034cf715c78c758a5613c4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.verifyPregate (cyclomatic 18): index.verifyPregate 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":"lib/pregate/index.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b100f581891a5c8e92b7ad711ec83d5954b2e0c99054574cfa965a1743844bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-dispositions.dispositionedOn (cyclomatic 18): gate-dispositions.dispositionedOn has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 199, commitOf, a function literal at line 207). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: gate-dispositions.writerShaped (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":"lib/gate-dispositions.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34acd71caff81b0b0c887f2216bda1ea2f308fd611a2d24270eaf9a645a6772"}},{"ruleId":"D1","level":"warning","message":{"text":"review-platform.platformReviewAt (cyclomatic 18): review-platform.platformReviewAt has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-platform.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec721daf65b574c376e28b0942f6f545cd906800a54311e53b4ebcf8adbb183"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.receiptReviewAtHead (cyclomatic 18): ship-receipt-depth.receiptReviewAtHead 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"026ec46259c0902f0edf54c7e3fed1749b7db82b71e9757d26a934ccca4850a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Watcher.emitConversation (cyclomatic 18): Watcher.emitConversation has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1002103a89f2641db05fa2c7d84efba74dcbce4bc38022b95e1e81dea882bdd"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-wave.groupWaves (cyclomatic 18): ship-queue-wave.groupWaves has cyclomatic complexity 18 (threshold 15). Of this number, 13 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"839af50ecdb9a1ae775c3c0ff32b1aafd362bc8d9a09e19e1e6e051cb2677222"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-wave.waveStatus (cyclomatic 18): ship-queue-wave.waveStatus 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a12e7e503b473daf2e6b1cc7a8a541b4b71f4ecffbe3715dbb65955f4252ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-gate.readWorkflowAttempt (cyclomatic 18): ship-queue-train-gate.readWorkflowAttempt 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea30a381f778daecd4c961f6f8bf1135a9ed0a5e21871363dfd2e0b231766ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-cost-replay.formatReport (cyclomatic 18): gate-cost-replay.formatReport 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":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d23badda648a0cefafeaa56dd6fd2c5792d31bc500fc2fee59d1942aaf8cbd9"}},{"ruleId":"D1","level":"warning","message":{"text":"ceo-review-gate.handle (cyclomatic 18): ceo-review-gate.handle has cyclomatic complexity 18 (threshold 15). Of this number, 11 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":"hosts/claude/hooks/ceo-review-gate.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c336a97f9f0667aa78a917a004c64dda72c26dbce21bba051dfa55b52a66e2"}},{"ruleId":"D1","level":"warning","message":{"text":"memorable-user-prompt-hook.policyVeto (cyclomatic 18): memorable-user-prompt-hook.policyVeto 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":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af0bf5ef909d3f24ad06ac542e54f9190365ca1061aef0e6ee67c2ca9a2673f"}},{"ruleId":"D1","level":"warning","message":{"text":"process.executable (cyclomatic 18): process.executable 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":"lib/cso/process.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"691499db9d8dd20d35b4142005f0e81c87f921a5d57a3375b80ff349a9d83369"}},{"ruleId":"D1","level":"warning","message":{"text":"state.retention::retainedReport (cyclomatic 18): state.retention::retainedReport 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 shape REPEATS in the file: one other method here (state.retention) 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":"lib/cso/state.ts"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097b364252a94157ac2d524dce04c7b77690b13bf352c83d262441f1fcb50d9"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.assertOpenedFileContained (cyclomatic 18): snapshot.assertOpenedFileContained 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":"lib/cso/snapshot.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a362b9eec954c39598eaafedd9ac0b3e36381e77ed8e363131ba81c115b2b851"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.rejectSpecialFiles (cyclomatic 18): snapshot.rejectSpecialFiles has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"585f71835ee378a9e15e94ebeff515054af29a1d28ea82efb22de7432f4b7db8"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot.capture::assertEntriesStable (cyclomatic 18): snapshot.capture::assertEntriesStable 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 (snapshot.capture) 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":"lib/cso/snapshot.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"006499cf8aff7e7bf6734bd63b59e83668039c93fc36a886e1266b27e5e02d98"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation.manifest (cyclomatic 18): preparation.manifest has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1433e390de8baa5c7a49b5b397446b1281d9cb40291cf7575ca91af73023f0"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-docker.copyPreparedBlob (cyclomatic 18): preparation-docker.copyPreparedBlob 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccf793e2c677eab435ec076f8dad529f08aeed68595d407e1a1103e3f66aee4"}},{"ruleId":"D1","level":"warning","message":{"text":"verifier.main (cyclomatic 18): verifier.main 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":"lib/cso/verifier.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc5951558b8d67b939b52288c024bd6b49d268a2ba3d9258a67471bc29fdda0"}},{"ruleId":"D1","level":"warning","message":{"text":"design-build.parseInventory.states (cyclomatic 18): design-build.parseInventory.states 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":"lib/design-build.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f962e2eb5d37fa86cf0e448c5270c8bfdb21f869d3917ebff2bc5b0377849bbf"}},{"ruleId":"D1","level":"warning","message":{"text":"factory-scorecard.readGateRuns (cyclomatic 18): factory-scorecard.readGateRuns has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e531016689b65f81602171f21334a78593d36d7763f25ed3d3348de8f8c94381"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-decision.validateDecide (cyclomatic 18): gstack-decision.validateDecide 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":"lib/gstack-decision.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f154488b8770d2f6dd7750eeae3f3cf686c80c4006ac0a0775c0a2377aed1a"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.resolveRemote (cyclomatic 18): gstack-post.resolveRemote 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":"lib/gstack-post.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce571a7a2068335a4592687347bd0606a30c5763ba868ef9342f76c0ffa7b32f"}},{"ruleId":"D1","level":"warning","message":{"text":"harness-register.finishHook (cyclomatic 18): harness-register.finishHook 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":"lib/harness-register.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"544193ba9729747c58ddbbde953096e537e77d2cf18d40b6309eca4ed172b3a3"}},{"ruleId":"D1","level":"warning","message":{"text":"motion-encode.manifestError (cyclomatic 18): motion-encode.manifestError 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":"lib/motion-encode.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dd2ca99d8a123589d7d902effc9ffecd680e1bc8728a55ad05e49318b9b9df"}},{"ruleId":"D1","level":"warning","message":{"text":"office-hours-probe.resolveProbe (cyclomatic 18): office-hours-probe.resolveProbe 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":"lib/office-hours-probe.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1da1e56723e702d610d42d188387b5d99f7e838c159e088451cea389c9200b"}},{"ruleId":"D1","level":"warning","message":{"text":"qa-evidence.reportDir (cyclomatic 18): qa-evidence.reportDir 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":"lib/qa-evidence.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a455ed885189493d916bd9bee0f7666dd640c29f5fcb877784e66b042d88e7"}},{"ruleId":"D1","level":"warning","message":{"text":"review-bots.record (cyclomatic 18): review-bots.record 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-bots.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502603813d28ea4021c153e0bbb232a2546d2b375325a2190e8ce042d28295b"}},{"ruleId":"D1","level":"warning","message":{"text":"review-fetch.scanEvents (cyclomatic 18): review-fetch.scanEvents has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 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":"lib/review-fetch.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a0c31def5e3067ccd088bab9b481274f27c65578a658883e787004d8e30117"}},{"ruleId":"D1","level":"warning","message":{"text":"review-ledger.collect (cyclomatic 18): review-ledger.collect 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9675bf29164e75425ac86b1eb3e84805eab0733e144304686872dc776ebc4b"}},{"ruleId":"D1","level":"warning","message":{"text":"review-ledger.ledgerBlockers (cyclomatic 18): review-ledger.ledgerBlockers has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac2d23fd2152c4ccbecf8ab9215e596fda1f2a7b0c9f1e49df0751e9473fb3a"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-patch.comparePath (cyclomatic 18): ship-patch.comparePath 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490fe26729f998f02ba4adc710b8155363fd8d1a17f93b041f9281c997cfb4d"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks-prior.supersede (cyclomatic 18): tasks-prior.supersede 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":"lib/tasks-prior.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec149f94442b5c7e1d836bca78cca490bf3c018a672d7ef0404c9bf5accdfb6c"}},{"ruleId":"D1","level":"warning","message":{"text":"toc-pages.pdfDestinationPages (cyclomatic 18): toc-pages.pdfDestinationPages has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/toc-pages.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a024eaabf0e98e4af7883992a9cd90b2d5291f8cf32f8660eaa0287b2362b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.docsErrors (cyclomatic 17): ship-policy.docsErrors has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). 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":"lib/ship-policy.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad781616bb38fb3593e2950895e945a00c370216d32c6c167c47f080fd3db35"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-policy.fragmentsErrors (cyclomatic 17): ship-policy.fragmentsErrors 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":"lib/ship-policy.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75f3ee1e2e5a9b3c66fe61ffd8738646f915a44c5559895a0a4b317b37a46b"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.isPublicIPv4 (cyclomatic 17): redact-patterns.isPublicIPv4 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":"lib/redact-patterns.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"91eb4bdb54247ea20fc555011a375f87fc2ccf65178c3f03d114821b60e5a0eb"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.jsSpans (cyclomatic 17): redact-patterns.jsSpans 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":"lib/redact-patterns.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead0e2198f9cd73dd6fb5e684ca633c177e39c72827c6b82507a50f6557b0340"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-patterns.isSourceExpression (cyclomatic 17): redact-patterns.isSourceExpression 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":"lib/redact-patterns.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e730a654799d1e579b446d64065bb94efb7c701ecc9d8131b70b36fab8ca42f4"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-engine.jsonTokens (cyclomatic 17): redact-engine.jsonTokens 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":"lib/redact-engine.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd639e98d41a703e8becf58747dc8a72c112c0ce796b422eafb2f9288eaf9c9"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.specialistsFor (cyclomatic 17): review-depth.specialistsFor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (want, a function literal at line 527, a function literal at line 515). 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":"lib/review-depth.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3576a3b9b5cb53147daa354e5096e830b76cd7b4f045fe2d96de140e22ffa31e"}},{"ruleId":"D1","level":"warning","message":{"text":"review-depth.batchChecklists (cyclomatic 17): review-depth.batchChecklists has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 545, 552). 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":"lib/review-depth.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bc47940c8b4126ba80a0ff3303c72b5dbbef705d22ea4c4d71a69b7d3217a3"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-autoplan-snapshot.methodologyContent (cyclomatic 17): gstack-autoplan-snapshot.methodologyContent 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e3143e77eb6b12b141683dd7d6fd835ff3864fb579e2f2779e2e06c31ba6f8"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-brain-context-load.parseArgs (cyclomatic 17): gstack-brain-context-load.parseArgs 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":"bin/gstack-brain-context-load.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadfd29577621935c0f3dabdf96b281bfe875282d30a6c4955f1aa11dad9b089"}},{"ruleId":"D1","level":"warning","message":{"text":"gbrain-repo-policy-client.repoPolicyTierBatch (cyclomatic 17): gbrain-repo-policy-client.repoPolicyTierBatch has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23a995ae9d6ae214a0ccd4ae0600f83f9834047be4297872dac31e14c4e6f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-global-discover.extractCwdFromJsonl (cyclomatic 17): gstack-global-discover.extractCwdFromJsonl has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-global-discover.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f97b70be5af8fe322cc5bfc4ab7e54f6fed94c138ab69cde307d6f3906c4c0"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-global-discover.scanKimiCode (cyclomatic 17): gstack-global-discover.scanKimiCode 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":"bin/gstack-global-discover.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"35098fbf39301a50e19162141102c2d59879ed2da2814d558f745301ece55433"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-pins.evaluatePins (cyclomatic 17): runtime-pins.evaluatePins 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":"lib/runtime-pins.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ef7d433a5a90dce0305535e55458f312aee0dfde32cf7f6ce1840813d75569"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy-config.noProxyToChromiumRules (cyclomatic 17): proxy-config.noProxyToChromiumRules 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":"browse/src/proxy-config.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2993f303059c1b809f99f87b033dc1cf0047876f5c52db97d5078022ac66f39"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.tunnelRevoke (cyclomatic 17): cli.tunnelRevoke 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":"browse/src/cli.ts"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbf07d66938a63d7f583daca2825bbaf1f242e2d5fa89005946315c92609a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-operation.parseCookieImportArgs (cyclomatic 17): cookie-import-operation.parseCookieImportArgs 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":"browse/src/cookie-import-operation.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe8337c4d0cd3e0f65ce0e1bb2dbdf8efe7fc7c84f6377d62087efc90618c25"}},{"ruleId":"D1","level":"warning","message":{"text":"session-tabs.runInSession (cyclomatic 17): session-tabs.runInSession 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":"browse/src/session-tabs.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e0510eab67154d2be24f82463aeb5a287940adab2593d37924bfa85dbb065e"}},{"ruleId":"D1","level":"warning","message":{"text":"recover-receipts.negativesFromRun (cyclomatic 17): recover-receipts.negativesFromRun has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, 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":"crew/scripts/recover-receipts.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a699ae99ce736c79c4b2d986b933ee32e59b90736bfddbc05635fce923c8222"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-confirm.annotateConfirm (cyclomatic 17): autoplan-confirm.annotateConfirm has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-confirm.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb1bae0a4f989469c336a082a5518a1261f9274dc9fd7dcbeab1940c403c232"}},{"ruleId":"D1","level":"warning","message":{"text":"no-stop.parseDiff (cyclomatic 17): no-stop.parseDiff has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e196c01a90d418831b75b7d24a7e384b625ff40137f06744dad73d7b0edfad6"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexCliRunner.run (cyclomatic 17): CodexCliRunner.run 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":"lib/outside-voice-runner.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"60957d022e23fa4e6a14f715b05bfb5a8539000bfe61978a4ad871613a09e50c"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-shadow.claimShadow (cyclomatic 17): autoplan-shadow.claimShadow has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bfa30b4d7ba8e276e5d410bfd594b37805deb08eb3492f98d35c6bdaff6064"}},{"ruleId":"D1","level":"warning","message":{"text":"bin-context.markerIgnoredReason (cyclomatic 17): bin-context.markerIgnoredReason 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":"lib/bin-context.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"419fe4fb3ddc673a1cdbd659c44f4a750a95cae2c60222a22180db32711cf992"}},{"ruleId":"D1","level":"warning","message":{"text":"headless-artifacts.validateRun (cyclomatic 17): headless-artifacts.validateRun 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":"lib/headless-artifacts.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adcadf7c9c59b0b95c6b38e4f6b1859241757c2cf2637b0d4b7a47ed6dd54a5"}},{"ruleId":"D1","level":"warning","message":{"text":"lanes.parseSummary (cyclomatic 17): lanes.parseSummary 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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd1e085162fc39b1bf46a66f8e0cb16f64e478105683356a7152f6593e4009"}},{"ruleId":"D1","level":"warning","message":{"text":"timing.scanTiming (cyclomatic 17): timing.scanTiming has cyclomatic complexity 17 (threshold 15). Of this number, 14 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":"lib/pregate/checks/timing.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd50ba3a4068127ca387c51108079603b574462e791dfee13e7d8cb442d5643"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.joblessRuns (cyclomatic 17): ship-queue.joblessRuns has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 7 function items inside it that branch (replaces, a function literal at line 198, order, \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":"lib/ship-queue.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a07b07121aa09ccaab283df7a46e23348d524168236c4d55b099ddca93dd6d8"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-wave.newWave (cyclomatic 17): ship-queue-wave.newWave 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e5cf49d1458c3af45d2c8d3b67824d8f6226f278ae2ba2089ad88f15d0ba44"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train.baseOverlap (cyclomatic 17): ship-queue-train.baseOverlap has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b27c8302f8d6367820bec64101673762ebcc8e14f6d3045744fb2e9225137"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-ready.dispatchScreen (cyclomatic 17): ship-queue-train-ready.dispatchScreen 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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"46740e0871fdf64501d416e5f4305d80c8a214566cbf33d3d56bf346f546105e"}},{"ruleId":"D1","level":"warning","message":{"text":"variants.readBriefsFile (cyclomatic 17): variants.readBriefsFile has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 319, 321). 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":"design/src/variants.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"eede30f0b25a7556f7f932ab57f8412d70ac5b96d229d5e0a6a0b6cf853f809a"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.generateGalleryHtml (cyclomatic 17): gallery.generateGalleryHtml has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 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":"design/src/gallery.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2a630b2eea844ea17e2c76663bac0e360f39ca542bcf3ab251ea1393af2caa"}},{"ruleId":"D1","level":"warning","message":{"text":"sidepanel-terminal.init (cyclomatic 17): sidepanel-terminal.init has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (applyFontSize, a function literal at line 941, a function literal at line 959, \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":"extension/sidepanel-terminal.js"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c1f747a526afc172dfa5d9a91209a7eef2a43db495c4fc11e1e0cf5ba7a242"}},{"ruleId":"D1","level":"warning","message":{"text":"ceo-review-gate.rankedRisksGap (cyclomatic 17): ceo-review-gate.rankedRisksGap 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":"lib/ceo-review-gate.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b58f16c41bb69f24d61b5a9af748e21d1590cf16f6f9d9a9534247e7dae95f5"}},{"ruleId":"D1","level":"warning","message":{"text":"cli-mint.parseArgs (cyclomatic 17): cli-mint.parseArgs 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":"ios-qa/daemon/src/cli-mint.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdca7cfd64fe80822d6f8ede684c05e2e7aefc3aa6c6926e6e9abe773c193ce"}},{"ruleId":"D1","level":"warning","message":{"text":"archive-check.checkThread (cyclomatic 17): archive-check.checkThread 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":"lib/archive-check.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fb2c629b0ec4d94d93b4d5da09dba7c815ec325e95e9a27a0d76df8529bf30"}},{"ruleId":"D1","level":"warning","message":{"text":"archive-check.landedIssues (cyclomatic 17): archive-check.landedIssues 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":"lib/archive-check.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e006197830e8d478dcafe4dbac60350947e7b91aa4ef98ee4a0323632868a081"}},{"ruleId":"D1","level":"warning","message":{"text":"base-red.parseEvidence (cyclomatic 17): base-red.parseEvidence 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":"lib/base-red.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d806c23bf568193a4baa5ce6dd2180ad3072382ddcd77c9324e05e67b394f"}},{"ruleId":"D1","level":"warning","message":{"text":"base-red.classifyBaseRed (cyclomatic 17): base-red.classifyBaseRed has cyclomatic complexity 17 (threshold 15). Of this number, 13 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":"lib/base-red.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8ff12912fbdad3dcf207d8324161be3e3fedd00ad608b2a9ac43b68838db77"}},{"ruleId":"D1","level":"warning","message":{"text":"context-bill.measureExactTokens (cyclomatic 17): context-bill.measureExactTokens has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4bfbc55f7603e294477745dfb373be894fd9a267a7e13b9fe0dc79dc0d2956"}},{"ruleId":"D1","level":"warning","message":{"text":"state.ensureDirectory (cyclomatic 17): state.ensureDirectory 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":"lib/cso/state.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cae10723099862d8d3dc63a0e55b101631bf5f4e54aca29aa14e290e0cd066c"}},{"ruleId":"D1","level":"warning","message":{"text":"state.hasPendingWatchdogCleanup::walk (cyclomatic 17): state.hasPendingWatchdogCleanup::walk 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":"lib/cso/state.ts"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb1fa078f4128d386ec4b905103f28c772af98bbb64dc0075d8a2c90f1a66b8"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-executor.provePreparedProjection (cyclomatic 17): preparation-executor.provePreparedProjection 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. This is NOT this file\u0027s highest cyclomatic complexity: preparation-executor.validateOfflineReceipt (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b94a253a8c2b00ea8ccbd3834f0c1d99e098d7cafca15f6561aed9ce2fc0f53"}},{"ruleId":"D1","level":"warning","message":{"text":"scanners.sarifBaseDir (cyclomatic 17): scanners.sarifBaseDir 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":"lib/cso/scanners.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5b1802ff8ad7e6a3d61698f57ae626cbbb308692f4ba332689e3fc92f09f12"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.recheckOriginalDirectory (cyclomatic 17): cli.recheckOriginalDirectory 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: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b115c7370e583aa65b2a942a6c51522028d048ac4548816c6441e43d24101e"}},{"ruleId":"D1","level":"warning","message":{"text":"junit.parseXml (cyclomatic 17): junit.parseXml 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":"lib/junit.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2f422879a8ec5c12f4619729d76be7015e40dfee1c78bdf73f1bfe8ececf87"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.receiptRunIdSpans (cyclomatic 17): gstack-post.receiptRunIdSpans has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (span, rows). 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":"lib/gstack-post.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a930896476e4044cc5dc46d7d38f2a93648c76ba70cefb8223c5587cdfb06d"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-reality-receipts.resolvePath (cyclomatic 17): plan-reality-receipts.resolvePath 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":"lib/plan-reality-receipts.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7512cc92ea902714ddd65a54a5c2e5bcf4dce167454191bd8749f598c641cc6d"}},{"ruleId":"D1","level":"warning","message":{"text":"state-matrix.checkMatrix (cyclomatic 17): state-matrix.checkMatrix has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/state-matrix.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6c96c2f506073a8ba5ce15661da44592a34af70bb8464b327bc0c87ca1ff91"}},{"ruleId":"D1","level":"warning","message":{"text":"review-scope.parseHunks (cyclomatic 17): review-scope.parseHunks 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":"lib/review-scope.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f9d386e598344fe8e5508c58c41949a77fe2b8fe04c736a22fa76b0c0bcf76"}},{"ruleId":"D1","level":"warning","message":{"text":"GenAccessors.main (cyclomatic 17): GenAccessors.main 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":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4de5c33a075cd4813e5b98ef935265bd6aa26101c934993dedb325eb65a15d"}},{"ruleId":"D1","level":"warning","message":{"text":"modelOf (cyclomatic 17): modelOf 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":"lib/capy-review-pass.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"052924be209251dfaad14a70fcae4f6f1f707bd7bc1b6d551bade74541e8c28a"}},{"ruleId":"D1","level":"warning","message":{"text":"redact-engine.inStructuralToken (cyclomatic 16): redact-engine.inStructuralToken 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":"lib/redact-engine.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"71915f1e01351e1839a9305ec4bb6d05469f3feea5bdfff4d96389806bda912f"}},{"ruleId":"D1","level":"warning","message":{"text":"autoplan-phase-publication.withResultWithdrawn (cyclomatic 16): autoplan-phase-publication.withResultWithdrawn 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":"lib/autoplan-phase-publication.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc47b65a8ffc1e9d28a2302443f3813432829134842181be92a0c5fe99522178"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-brain-context-load.dispatchList (cyclomatic 16): gstack-brain-context-load.dispatchList 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":"bin/gstack-brain-context-load.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b2683b819f6701c579edaed55880ea56e51e2fbf3cf4d85d6806de381d137"}},{"ruleId":"D1","level":"warning","message":{"text":"gbrain-sources.ensureSourceRegistered (cyclomatic 16): gbrain-sources.ensureSourceRegistered 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 180). 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":"lib/gbrain-sources.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc29f2e33b2be09bf3e15d8bc3b84476b23b7a5353b941adb9a849d00ca4c61b"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-memory-ingest.snapshotTranscriptCheckout (cyclomatic 16): gstack-memory-ingest.snapshotTranscriptCheckout has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"342cb1238ae5dc7866d579019bfbd77e36676158e2c3f75192958b2ecfef5ece"}},{"ruleId":"D1","level":"warning","message":{"text":"aside-render.buildRenderScript (cyclomatic 16): aside-render.buildRenderScript has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 236, setOverride, sized). 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":"lib/aside-render.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3f3521e3d6fb6f1b0e2da8d99ac1f9dc2f69a695ebd1df3aac67674dddd235"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowserManager.syncActiveTabByUrl (cyclomatic 16): BrowserManager.syncActiveTabByUrl 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":"browse/src/browser-manager.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d88a40bc820426661a7b754335edad04df578a74241359123e26b38e12c5214"}},{"ruleId":"D1","level":"warning","message":{"text":"cdp-inspector.formatInspectorResult (cyclomatic 16): cdp-inspector.formatInspectorResult 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":"browse/src/cdp-inspector.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfc2e7cdc4d78eafa5657968df5f7ceddd22ad7ce35e42770b935ebe761b418"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent-control.acquireAgentStateLock (cyclomatic 16): terminal-agent-control.acquireAgentStateLock 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb9bf675c57956a6b5e778df4352006a942987e8069a14f73ae6cceba21bffa"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie-import-browser.normalizeCookieDomain (cyclomatic 16): cookie-import-browser.normalizeCookieDomain 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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"373ae0b5469a11d8a04da4bda8727218e3c9870efa0c12fde9097f8f757ceaae"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-agent.maybeSpawnPty (cyclomatic 16): terminal-agent.maybeSpawnPty 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 cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5575d8c960d08c6167bbb40d54d0714ad2dba40c0a49544a064b40493b5323bf"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-cost.simulateTrains (cyclomatic 16): gate-cost.simulateTrains has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6320fd59b969d972eb8f386cc6ec97709cbcfda3e44f10359ac5351dcdb46e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence-bundle.buildBundle (cyclomatic 16): evidence-bundle.buildBundle 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":"lib/evidence-bundle.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd8e3c218a8252b762ec8143e4621e6e0813acd4a6a2da92d91425d8fe33385"}},{"ruleId":"D1","level":"warning","message":{"text":"restamp.applyToBranch (cyclomatic 16): restamp.applyToBranch has cyclomatic complexity 16 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cac603196e7aa4713034b70b1479f90da57c820d4a4b05070b45b798bc8787"}},{"ruleId":"D1","level":"warning","message":{"text":"no-stop.checkNoStop (cyclomatic 16): no-stop.checkNoStop 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":"lib/no-stop.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaa6d4bcc175672e911aed4790c7d49d9f2e9c4f111ae7eccdeec99b1f44edd"}},{"ruleId":"D1","level":"warning","message":{"text":"headless-artifacts.findCycle (cyclomatic 16): headless-artifacts.findCycle has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 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":"lib/headless-artifacts.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aecafcd5b033fac324cda92468451f0ea509044b710ac7f0ff768686f7687d"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.resolveBun (cyclomatic 16): runtime.resolveBun 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":"lib/pregate/runtime.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fca8ce6c1f3a496aa8735d57a96b81283653637fad3d2a2ba2221c1ed75a00c"}},{"ruleId":"D1","level":"warning","message":{"text":"import-graph.blankDartComments (cyclomatic 16): import-graph.blankDartComments 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":"lib/pregate/import-graph.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e057bc5bb222b291658bdfdd655d01eba88b8cc218ede797943525b3d13af24"}},{"ruleId":"D1","level":"warning","message":{"text":"import-graph.effectiveOptions (cyclomatic 16): import-graph.effectiveOptions 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":"lib/pregate/import-graph.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4783c1ac90d25129d874e3e3ffc54ffb32e16f59919127d755fb456f3b792ab8"}},{"ruleId":"D1","level":"warning","message":{"text":"timing.addedTestLines (cyclomatic 16): timing.addedTestLines 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":"lib/pregate/checks/timing.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30222c52182e86ac0e2123e84a1edc490dba988e0914082c4b079ddd1f9597e"}},{"ruleId":"D1","level":"warning","message":{"text":"release-stamp.openRelease (cyclomatic 16): release-stamp.openRelease 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":"lib/release-stamp.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a0a0747eccddc318fa6a82b144c40130fae31f5493650f793b27184c7c664b"}},{"ruleId":"D1","level":"warning","message":{"text":"review-collect.grepConsumers (cyclomatic 16): review-collect.grepConsumers 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":"lib/review-collect.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e51288dbea4d626ddfe4284321c9f7fcdc56242ae8da953397685b66dbe81"}},{"ruleId":"D1","level":"warning","message":{"text":"review-collect.executablesAt (cyclomatic 16): review-collect.executablesAt has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 306, plain, a function literal at line 305, \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":"lib/review-collect.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de1b800d5cc3aedd161264399898a3849faab21830a956d55e3d61629d81c28"}},{"ruleId":"D1","level":"warning","message":{"text":"review-exclude.pathReason (cyclomatic 16): review-exclude.pathReason 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":"lib/review-exclude.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c178aed4e8cb15e740439e875f25b80812f72fd647a0599997ca297fc206c01f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-depth.baseMergedChangelogCommit (cyclomatic 16): ship-receipt-depth.baseMergedChangelogCommit has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7095c97c65d0018f615463142751a26cbc08b3579b54ec367236bc99b719319"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue.stampPreflight (cyclomatic 16): ship-queue.stampPreflight has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc55b948834922444e29adf36846aa9e6d0074ae2996817b44601e2529ceb33c"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-gate.classifyWorkflowRun (cyclomatic 16): ship-queue-train-gate.classifyWorkflowRun 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e92fbc3dcd833d5f5d9efc7145975dc7ca353bba657385c76f34b0400ecd296"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-gate.parseTestRecord (cyclomatic 16): ship-queue-train-gate.parseTestRecord 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"33203bcfda5ca5aa604b702d24e1c725a233e8afa4ee3ba760eaad8cc37333b0"}},{"ruleId":"D1","level":"warning","message":{"text":"train-gate.stampFreeTree (cyclomatic 16): train-gate.stampFreeTree 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":"crew/scripts/train-gate.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1818decdf7bd56f9d73f061ae5e03e28922a4b3b691c1dcb7ba818b32070458e"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-ready.screenMerge (cyclomatic 16): ship-queue-train-ready.screenMerge 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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"107790a74f9c0bc6b970a689581bbe1170fb0748d8f7bb3cf49a94db1e5120ad"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-land.landChain (cyclomatic 16): ship-queue-train-land.landChain has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"833caff69a0a292809225e3108a2e9529be259885211d8329804ad850d035361"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-queue-train-forget.trainForget (cyclomatic 16): ship-queue-train-forget.trainForget 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":"crew/lib/ship-queue-train-forget.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb4feea384a071a80237746f6021ac0c54965dcbe44278fcfc374fea00abbfe"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-recheck.planRecheck (cyclomatic 16): ship-recheck.planRecheck 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":"crew/lib/ship-recheck.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d976c496adf65ea112a407f7e147756a4bae37b3101eaf3f7964cb0a0ef4233"}},{"ruleId":"D1","level":"warning","message":{"text":"gate-cost-replay.readGateRecord (cyclomatic 16): gate-cost-replay.readGateRecord 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":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f313defa62181aac557ac248f021ec561e513a6a393bc4bb94ff85c22fbf33"}},{"ruleId":"D1","level":"warning","message":{"text":"measure-journal-read.main (cyclomatic 16): measure-journal-read.main 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":"crew/scripts/measure-journal-read.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfd1c9db09ac0e8af422591dff1caf9ae0a3c40919cb7f260148ab7d2db1640"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-client.ensureDaemon (cyclomatic 16): daemon-client.ensureDaemon 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":"design/src/daemon-client.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"115cfce9e314fe1c4b77b2b027aa83f2fa40166fd1df53e85853efaca540f935"}},{"ruleId":"D1","level":"warning","message":{"text":"ceo-review-gate.checkOutput (cyclomatic 16): ceo-review-gate.checkOutput has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ceo-review-gate.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1194e61bc6c4dc08d9c50c8d8ef8e9b140661e9d95f989e6bfe8ea092894977b"}},{"ruleId":"D1","level":"warning","message":{"text":"session-cache.readSession (cyclomatic 16): session-cache.readSession 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":"ios-qa/daemon/src/session-cache.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"041598ea1a5b1551775e5f98801c57d14cce919aa25e1ce00987c9d29f518755"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-code.claudeCodeMain (cyclomatic 16): claude-code.claudeCodeMain has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c27136ab016011fb599c81fc7bcad402f2befa0b2185db28a8271394bc2eafb"}},{"ruleId":"D1","level":"warning","message":{"text":"contracts.validateFinding (cyclomatic 16): contracts.validateFinding 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":"lib/cso/contracts.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e8a7292ae9b8b2f0d345ef783bf5a43a9a01726836491b754d69b4c216eda7"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicArchiveCache.promote (cyclomatic 16): PublicArchiveCache.promote 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 389). 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: cache.readMetadata (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce223d715a4efd063024513b5cc759fd4e9a5b6c3b39db89fbd2d825e4eafc0a"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicArchiveCache.recoverMetadataTemp (cyclomatic 16): PublicArchiveCache.recoverMetadataTemp 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: cache.readMetadata (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"492a57cdc1e63641fccfef844fa3adc6332ffd08c73c84f78a266e57b05ded81"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerGroup.admitLocalImage (cyclomatic 16): DockerGroup.admitLocalImage 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":"lib/cso/docker.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2ebb4a4339b34e64681c71969001af78d26bb993727fa90da74c22816c1ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.download (cyclomatic 16): preparation-container.download 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":"lib/cso/preparation-container.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f679b714364a97398167e5ff4c30112611e5858a41536a3e40ab118c373df86a"}},{"ruleId":"D1","level":"warning","message":{"text":"preparation-container.forwarder (cyclomatic 16): preparation-container.forwarder has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (copyMetadata). 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":"lib/cso/preparation-container.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c5b652fac243b7483cfa47ebf86df784b6726180f79be6b18582a08c809ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.scanner (cyclomatic 16): cli.scanner has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: cli.dispatchCsoCommand (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c6f27f1dd193f32880a5e5312f89ab1e8d28fc369a938e93cbb1fe0e842fac"}},{"ruleId":"D1","level":"warning","message":{"text":"dx-error-capture.dxErrorCaptureMain (cyclomatic 16): dx-error-capture.dxErrorCaptureMain has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ee01e7f82bdef00eb05508678c43c05fb1fbb320ee02c35ecbd11c39e7bfd6"}},{"ruleId":"D1","level":"warning","message":{"text":"factory-scorecard.scorecardRows (cyclomatic 16): factory-scorecard.scorecardRows 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 9 function items inside it that branch (freeRetries, a function literal at line 416, row, \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":"lib/factory-scorecard.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed382e0a0f6d1c0ab58417eabb8c0d622e657df98417e0f5682088cdc165b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"gbrain-supabase-provision.cmdPoolerUrl (cyclomatic 16): gbrain-supabase-provision.cmdPoolerUrl 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fc3caf276e2d9a19077a1a6790766fcd2b23ceccc98cc1a9a0ed388d01eb54"}},{"ruleId":"D1","level":"warning","message":{"text":"gstack-post.targetNumber (cyclomatic 16): gstack-post.targetNumber 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":"lib/gstack-post.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffdf3edf2f0b5694461093f48deab618fefa087fff640f5d378ff1282e16877"}},{"ruleId":"D1","level":"warning","message":{"text":"office-hours-review.officeHoursDesignChanges (cyclomatic 16): office-hours-review.officeHoursDesignChanges has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3379abb59960285768eda74ec800c6f03b9a52a11653406d5e00e5edc6d326f6"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-patch.readScopedReview (cyclomatic 16): ship-patch.readScopedReview 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":"lib/ship-patch.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"935fcc0b70bbebb40268bb55d95493fdee311867d6030e3dbc7a7d8c29825106"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-audit.audit (cyclomatic 16): ship-audit.audit has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-audit.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b998d3ed26c8451e27bafd6d753dfde19996d709a981bc986d8652c0d491cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-budget-cli.cmdCalls (cyclomatic 16): ship-budget-cli.cmdCalls 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":"lib/ship-budget-cli.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc3758af9fc6ef458982f1268522e2d59284f2374353da113177f5d44dc0685"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-preflight.simulate (cyclomatic 16): ship-preflight.simulate has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9e024468a03c22167d6d46474430f5791193960a4e3f1c4f171f7cef57a7ad"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-prose.withoutApprovalsBlocks (cyclomatic 16): ship-receipt-prose.withoutApprovalsBlocks has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (blockEnd, skipBlank). 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":"lib/ship-receipt-prose.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c343b82b8bc62c225d1216363c1eb6c6e7ab165a998be93822b10060950d12"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-receipt-prose.withoutExceptionLines (cyclomatic 16): ship-receipt-prose.withoutExceptionLines has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-prose.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c76c2e56d64004beeb80df9e96e662c2197bc372a415b3e1cea98edf4ea792"}},{"ruleId":"D1","level":"warning","message":{"text":"ship-release.harnessRepin (cyclomatic 16): ship-release.harnessRepin 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, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f371934a026bbbba20e41c1c479c0df3cb4a652ff01a4c76a21e8c01522b25"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-bill.buildSkillBill (cyclomatic 16): skill-bill.buildSkillBill 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":"lib/skill-bill.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c61111022d7a8f02454e96f5803b496d14284bef12945cb8bd49a39968966ec"}},{"ruleId":"D1","level":"warning","message":{"text":"startReattachLoop (cyclomatic 16): startReattachLoop has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (tick, scheduleNextAttempt). 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":"extension/sidepanel-terminal.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5455602f422c3dae0be87399b71e25b6d335b7e8b7747b94e955e582395d6e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"write-commands.handleWriteCommand (cognitive 758): write-commands.handleWriteCommand has cognitive complexity 758 (threshold 15). Drivers by points: if/else 208 (515 pts), boolean chains 77, ternaries 24 (63 pts), loops 22 (54 pts), error handling 15 (45 pts), match/switch 2 (4 pts) (nesting depth added 410). Of this number, 593 points are the body\u0027s own statements and 165 belong to 17 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7524babccfe5874189fc416b35dfd05ba713be3fa782afd28452ced343602f43"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-commands.handleMetaCommand (cognitive 349): meta-commands.handleMetaCommand has cognitive complexity 349 (threshold 15). Drivers by points: if/else 76 (186 pts), ternaries 22 (57 pts), boolean chains 41, error handling 11 (35 pts), loops 12 (29 pts), match/switch 1 (nesting depth added 186). Of this number, 317 points are the body\u0027s own statements and 32 belong to 10 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":"browse/src/meta-commands.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcdacdb6624f7ac35e2edb0cbc8956462b00a07bdcca29234e9926c97e6b54e"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.handleSnapshot (cognitive 284): snapshot.handleSnapshot has cognitive complexity 284 (threshold 15). Drivers by points: if/else 68 (164 pts), boolean chains 39, error handling 14 (36 pts), loops 14 (30 pts), ternaries 5 (15 pts) (nesting depth added 144). Of this number, 203 points are the body\u0027s own statements and 81 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":"browse/src/snapshot.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4e7dabf28b7bfb8328c1bbb2bf7471001dfa936665319662251c63bb16e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"read-commands.handleReadCommand (cognitive 218): read-commands.handleReadCommand has cognitive complexity 218 (threshold 15). Drivers by points: if/else 54 (127 pts), boolean chains 39, ternaries 14 (34 pts), loops 5 (12 pts), error handling 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 103). Of this number, 140 points are the body\u0027s own statements and 78 belong to 17 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":"browse/src/read-commands.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19b9d693c1449d6c1babe150c5b47b8a6d269b9d703a8b9f49cdfcbbed7ee24"}},{"ruleId":"D2","level":"warning","message":{"text":"review-ledger.verify (cognitive 192): review-ledger.verify has cognitive complexity 192 (threshold 15). Drivers by points: ternaries 30 (79 pts), if/else 31 (61 pts), boolean chains 36, error handling 5 (11 pts), loops 4 (5 pts) (nesting depth added 86). Of this number, 179 points are the body\u0027s own statements and 13 belong to 12 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":"lib/review-ledger.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d21f517906ed0c771daf85ffb0602e1fe39448a5980b0d5f4b715aec6f4bbd8"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.probe (cognitive 173): gstack-design-detect.probe has cognitive complexity 173 (threshold 15). Drivers by points: if/else 51 (107 pts), ternaries 12 (29 pts), boolean chains 25, loops 13 (25 pts), error handling 4 (9 pts) (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. This shape REPEATS in the file: one other method here (gstack-design-detect.probe::checkSkillDir) 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":"bin/gstack-design-detect.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e494315b30235cb91716b753e488fbe2cce5a057549ff2580d51a14097316c"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-public-transcript.readPlanCountTranscript (cognitive 171): claude-public-transcript.readPlanCountTranscript has cognitive complexity 171 (threshold 15). Drivers by points: if/else 29 (114 pts), boolean chains 24, loops 5 (14 pts), ternaries 5 (14 pts), error handling 2 (5 pts) (nesting depth added 106). Of this number, 154 points are the body\u0027s own statements and 17 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":"lib/claude-public-transcript.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2eb7be8d9aa3e6c654c0f7087f9e6972afa767ec3ab05525f69f8741745d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"review-ledger.parseLabelled (cognitive 169): review-ledger.parseLabelled has cognitive complexity 169 (threshold 15). Drivers by points: if/else 41 (92 pts), boolean chains 53, ternaries 14 (20 pts), error handling 1 (3 pts), loops 1 (nesting depth added 59). Of this number, 137 points are the body\u0027s own statements and 32 belong to 11 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":"lib/review-ledger.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"096f750faa294eb9f4e916d2b37668b8700cc5e7b1b873ee916bf6415f480eca"}},{"ruleId":"D2","level":"warning","message":{"text":"state.scanRunLeases (cognitive 157): state.scanRunLeases has cognitive complexity 157 (threshold 15). Drivers by points: if/else 27 (98 pts), error handling 5 (19 pts), ternaries 6 (19 pts), boolean chains 16, loops 3 (5 pts) (nesting depth added 100). 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":"lib/cso/state.ts"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bc09a5f7764fa2c787dea996fad36257dc8c9c19cd18d39304a0bd921b4d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land.land (cognitive 141): ship-queue-land.land has cognitive complexity 141 (threshold 15). Drivers by points: if/else 49 (94 pts), ternaries 16 (30 pts), boolean chains 16, loops 1 (nesting depth added 59). Of this number, 129 points are the body\u0027s own statements and 12 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":"lib/ship-queue-land.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e7396856359d2e280f04074d8165cc58801f81e88bf25a166218d33779d7e6"}},{"ruleId":"D2","level":"warning","message":{"text":"config.validateConfig (cognitive 140): config.validateConfig has cognitive complexity 140 (threshold 15). Drivers by points: if/else 51 (100 pts), boolean chains 20, loops 8 (17 pts), ternaries 2 (3 pts) (nesting depth added 59). Of this number, 122 points are the body\u0027s own statements and 18 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":"lib/pregate/config.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07a6a72ee46737782bd651e8adce816da4b8c25de3c749d0619e5b6cf8d5f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 135): cli.main has cognitive complexity 135 (threshold 15). Drivers by points: if/else 47 (89 pts), boolean chains 21, error handling 6 (14 pts), ternaries 2 (9 pts), loops 1 (2 pts) (nesting depth added 58). Of this number, 130 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":"browse/src/cli.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"319bc788b9f61df113f4aaf8043769762e3b82152c3f376a02ce882bcc65e6b7"}},{"ruleId":"D2","level":"warning","message":{"text":"lane-selection.selectLanes (cognitive 132): lane-selection.selectLanes has cognitive complexity 132 (threshold 15). Drivers by points: if/else 31 (66 pts), ternaries 11 (27 pts), loops 14 (21 pts), boolean chains 18 (nesting depth added 58). Of this number, 127 points are the body\u0027s own statements and 5 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b295ab422d50f37bd67a4b4bcb73be8b610ae96f2881c9748da83158f74ed1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"gen-accessors.parseFields (cognitive 132): gen-accessors.parseFields has cognitive complexity 132 (threshold 15). Drivers by points: if/else 45 (99 pts), boolean chains 17, loops 8 (13 pts), ternaries 2 (3 pts) (nesting depth added 60). Of this number, 120 points are the body\u0027s own statements and 12 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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b403f83a58572360b3036c08dd2e6456b7775380cf32a93d49699a83dc4058d"}},{"ruleId":"D2","level":"warning","message":{"text":"review-scope.summarizeReviewLoop (cognitive 131): review-scope.summarizeReviewLoop has cognitive complexity 131 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 37, ternaries 15 (33 pts), loops 11 (15 pts) (nesting depth added 45). Of this number, 102 points are the body\u0027s own statements and 29 belong to 19 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":"lib/review-scope.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fc9ae1a804621e7d9adbfc8d6797b28c14cb942d1ab8ba471d49e39b667f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-register.register (cognitive 122): harness-register.register has cognitive complexity 122 (threshold 15). Drivers by points: if/else 26 (46 pts), ternaries 18 (33 pts), boolean chains 20, loops 11 (18 pts), error handling 2 (5 pts) (nesting depth added 45). Of this number, 99 points are the body\u0027s own statements and 23 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":"lib/harness-register.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12b374b48b0d6175ec690a8c00c7f64fc5d5f4cfa47c5d536e82b4d76eb1e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"run-evidence.runProfileErrors (cognitive 118): run-evidence.runProfileErrors has cognitive complexity 118 (threshold 15). Drivers by points: if/else 24 (78 pts), boolean chains 22, loops 5 (18 pts) (nesting depth added 67). Of this number, 115 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/run-evidence.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b45d0dbf6104e1f43080e04a0622304fed97a6d06f85f8f30609c865b4aacd"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent.buildServer (cognitive 116): terminal-agent.buildServer has cognitive complexity 116 (threshold 15). Drivers by points: if/else 42 (70 pts), boolean chains 20, error handling 6 (14 pts), ternaries 4 (10 pts), loops 1 (2 pts) (nesting depth added 43). Of this number, 93 points are the body\u0027s own statements and 23 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4feadcd8c36b8464f035a2a3d2fc869e91b0a7e2b1f51ac0a8700f9a7c989dd"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.capture (cognitive 115): snapshot.capture has cognitive complexity 115 (threshold 15). Drivers by points: if/else 43 (84 pts), ternaries 11 (24 pts), boolean chains 20, error handling 8 (14 pts), loops 7 (10 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (snapshot.capture::assertEntriesStable) 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":"lib/cso/snapshot.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f0d6f350f2d1d770bb1a63a6493650d32ed80db792ee387643f0163fa13707"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.route (cognitive 114): ship-release.route has cognitive complexity 114 (threshold 15). Drivers by points: ternaries 29 (58 pts), if/else 17 (23 pts), boolean chains 20, loops 9 (10 pts), error handling 1 (3 pts) (nesting depth added 38). Of this number, 110 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":"lib/ship-release.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0486676552f06119b52eeabf2c3f823be44a058211e209e3474c4cd726eef51"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.planReview (cognitive 113): review-depth.planReview has cognitive complexity 113 (threshold 15). Drivers by points: if/else 33 (52 pts), ternaries 14 (29 pts), boolean chains 27, loops 2 (5 pts) (nesting depth added 37). Of this number, 107 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bae047f613706b3c39252f0e0154204d81af7c6843e518ebabc8003d6a5613f"}},{"ruleId":"D2","level":"warning","message":{"text":"cdp-inspector.inspectElement (cognitive 110): cdp-inspector.inspectElement has cognitive complexity 110 (threshold 15). Drivers by points: if/else 24 (68 pts), boolean chains 20, loops 9 (19 pts), error handling 2, ternaries 1 (nesting depth added 54). Of this number, 109 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":"browse/src/cdp-inspector.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c677f7f5d46d3295fa59eefcccbfd3ab0440a135c70a09d6b0cd6c8dc9191d"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy.validatePolicy (cognitive 108): ship-policy.validatePolicy has cognitive complexity 108 (threshold 15). Drivers by points: if/else 49 (65 pts), boolean chains 29, ternaries 5 (9 pts), loops 3 (5 pts) (nesting depth added 22). Of this number, 99 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":"lib/ship-policy.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6513cc8e032096006539521a53258185d417016c985692bab192426ad62a9e8"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.inspectPython (cognitive 108): preparation.inspectPython has cognitive complexity 108 (threshold 15). Drivers by points: if/else 24 (74 pts), loops 4 (14 pts), boolean chains 10, ternaries 2 (10 pts) (nesting depth added 68). Of this number, 107 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"580fbc2ce0c68af60901b444aba4ed255d85902b4db82c7a17caf3bfe6a5e305"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-code-migration.migrateClaudeCodeSkills (cognitive 104): claude-code-migration.migrateClaudeCodeSkills has cognitive complexity 104 (threshold 15). Drivers by points: if/else 26 (62 pts), boolean chains 21, loops 7 (14 pts), ternaries 2 (5 pts), error handling 1 (2 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"db466468bca2ef6abba6c91243362e7d10688fc535f2ffabf11ed61f97f8c8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"run-evidence.verifyRun (cognitive 102): run-evidence.verifyRun has cognitive complexity 102 (threshold 15). Drivers by points: if/else 38 (57 pts), ternaries 10 (22 pts), boolean chains 19, error handling 2, loops 2 (nesting depth added 31). Of this number, 99 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":"lib/run-evidence.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6bd836110eef7cde8c4128b71dc42c9e7731789ade41f242602bb76cc55eff"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-journal-records.ownedCausalOrder (cognitive 99): claude-journal-records.ownedCausalOrder has cognitive complexity 99 (threshold 15). Drivers by points: if/else 26 (54 pts), ternaries 8 (19 pts), loops 12 (15 pts), boolean chains 11 (nesting depth added 42). Of this number, 67 points are the body\u0027s own statements and 32 belong to 8 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cc8ac023aa5305f4c0ab0b1147a5b8d1fca3137efe6cb66a6084cc8eea76d9"}},{"ruleId":"D2","level":"warning","message":{"text":"scanners.parseSarif (cognitive 97): scanners.parseSarif has cognitive complexity 97 (threshold 15). Drivers by points: if/else 13 (41 pts), ternaries 10 (34 pts), boolean chains 13, loops 4 (6 pts), error handling 1 (3 pts) (nesting depth added 56). Of this number, 96 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":"lib/cso/scanners.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2977ad5b5f083bb21aede09cdcc2cd267d10f8227953e8ca894bdfef67fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.fixChecked (cognitive 95): ship-release.fixChecked has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 27 (47 pts), boolean chains 25, if/else 10 (16 pts), loops 6, error handling 1 (nesting depth added 26). Of this number, 52 points are the body\u0027s own statements and 43 belong to 21 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"938294b6c1f1b2013d73694a4b05e129036f6365221b6eda193686be9a2f8435"}},{"ruleId":"D2","level":"warning","message":{"text":"index.clearDecision (cognitive 94): index.clearDecision has cognitive complexity 94 (threshold 15). Drivers by points: if/else 25 (42 pts), ternaries 12 (33 pts), boolean chains 12, error handling 3 (7 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"25592abf47e019a42e6261ff7cbea823a0831ebd48240c8fa8438686315d26a4"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.docsFresh (cognitive 93): ship-release.docsFresh has cognitive complexity 93 (threshold 15). Drivers by points: ternaries 19 (52 pts), boolean chains 18, if/else 14 (17 pts), error handling 4 (5 pts), loops 1 (nesting depth added 37). Of this number, 74 points are the body\u0027s own statements and 19 belong to 6 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a269058bb17660eb32871632d563f589f1eb84d9c5ca0a8c90f0d9cd7ed55363"}},{"ruleId":"D2","level":"warning","message":{"text":"server.handleCommandInternalImpl (cognitive 92): server.handleCommandInternalImpl has cognitive complexity 92 (threshold 15). Drivers by points: if/else 36 (64 pts), boolean chains 18, ternaries 4 (6 pts), error handling 2 (4 pts) (nesting depth added 32). Of this number, 84 points are the body\u0027s own statements and 8 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":"browse/src/server.ts"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff085f77f14f4859924364465208de7122157092707fe95a747cf3ac45d41f46"}},{"ruleId":"D2","level":"warning","message":{"text":"lanes.planRuns (cognitive 87): lanes.planRuns has cognitive complexity 87 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 15 (30 pts), loops 8 (10 pts), boolean chains 5 (nesting depth added 38). Of this number, 71 points are the body\u0027s own statements and 16 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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1e6a7d9575f8422fb0f3670062649d083eef17abc9563a6431f81b7a6d8dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-gate.answerGate (cognitive 86): autoplan-gate.answerGate has cognitive complexity 86 (threshold 15). Drivers by points: ternaries 27 (41 pts), boolean chains 25, if/else 17 (19 pts), loops 1 (nesting depth added 16). Of this number, 70 points are the body\u0027s own statements and 16 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc0f84bb840f338ba8f91719f2b09ea02868b9d77a68322b2b760d9e31d2bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.clearByRuns (cognitive 86): index.clearByRuns has cognitive complexity 86 (threshold 15). Drivers by points: if/else 27 (41 pts), ternaries 18 (28 pts), boolean chains 8, loops 4 (7 pts), error handling 1 (2 pts) (nesting depth added 28). Of this number, 73 points are the body\u0027s own statements and 13 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":"lib/pregate/index.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f6ae811d9c2f43eb56640684db9861b9d1a7996d6ca7a3a1dbf0456ef81141"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-gate.buildGate (cognitive 85): autoplan-gate.buildGate has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 12 (36 pts), if/else 11 (31 pts), boolean chains 11, loops 4 (7 pts) (nesting depth added 47). Of this number, 81 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":"lib/autoplan-gate.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbd1b7c72f013c5e6117cf0559bf5430c48a2d5a71f39a5bc2207f577dcf695"}},{"ruleId":"D2","level":"warning","message":{"text":"review-collect.scanConsumers (cognitive 85): review-collect.scanConsumers has cognitive complexity 85 (threshold 15). Drivers by points: if/else 9 (35 pts), ternaries 6 (24 pts), loops 8 (19 pts), boolean chains 7 (nesting depth added 55). Of this number, 83 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":"lib/review-collect.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ec739108a498a8621ffc276b162bc8df7d7c362e06a682d12ce4ac08cb72b"}},{"ruleId":"D2","level":"warning","message":{"text":"review-fetch.scanWords (cognitive 85): review-fetch.scanWords has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 22, loops 8 (17 pts), ternaries 3 (5 pts) (nesting depth added 31). Of this number, 81 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":"lib/review-fetch.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0fd7e61e01481abc3e8d39945c993f2248af5427eb6047f49403e59f5a0429"}},{"ruleId":"D2","level":"warning","message":{"text":"server.start (cognitive 84): server.start has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (42 pts), ternaries 9 (19 pts), error handling 7 (13 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 32). Of this number, 71 points are the body\u0027s own statements and 13 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"091e3f16db0b4cbbba3d96dc0831bcf13f6e988a3b5e22d7f7e8c04f4b906c96"}},{"ruleId":"D2","level":"warning","message":{"text":"shell-writes.tokenize (cognitive 84): shell-writes.tokenize has cognitive complexity 84 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 7 (23 pts), loops 6 (14 pts), boolean chains 11 (nesting depth added 39). Of this number, 77 points are the body\u0027s own statements and 7 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":"lib/shell-writes.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c5ab2ff089aa316e25efc94c6a912f1496d698249a0b87a25e3007c180c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-reuse.findReusableGate (cognitive 83): gate-reuse.findReusableGate has cognitive complexity 83 (threshold 15). Drivers by points: if/else 37 (57 pts), ternaries 8 (14 pts), boolean chains 9, error handling 1 (2 pts), loops 1 (nesting depth added 27). Of this number, 80 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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"039b19a4fa724768877f27ad26733450938614254cbae57cf31df37a6ef8bda5"}},{"ruleId":"D2","level":"warning","message":{"text":"scanners.parseResults (cognitive 83): scanners.parseResults has cognitive complexity 83 (threshold 15). Drivers by points: loops 10 (27 pts), ternaries 6 (27 pts), if/else 11 (20 pts), boolean chains 8, match/switch 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"743d3fdc22b8b546aba99fbaded81b1ef4881688a86df6b7c9559e4e8e1c6aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.version (cognitive 83): ship-release.version has cognitive complexity 83 (threshold 15). Drivers by points: if/else 28 (32 pts), boolean chains 27, ternaries 13 (22 pts), error handling 1, loops 1 (nesting depth added 13). Of this number, 82 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":"lib/ship-release.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb93c8ef97c699d61f43ad2e9707f1107c6b884b134369dac25779cba30f3df6"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.verifyRepair (cognitive 81): verification.verifyRepair has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (35 pts), ternaries 10 (32 pts), boolean chains 10, error handling 2, loops 2 (nesting depth added 32). Of this number, 80 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":"lib/cso/verification.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74035713a672c7d62856ead7c7996deb86183e798458be3b3e8b3228fd2fba5"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cut.planRelease (cognitive 80): release-cut.planRelease has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (40 pts), ternaries 14 (21 pts), boolean chains 18, loops 1 (nesting depth added 18). Of this number, 79 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":"crew/scripts/release-cut.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2d82f07adbf5bd2ad242be32814e3831ba64ba6702b8259a59fffe0a36f5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-docker.materializePreparedExport (cognitive 80): preparation-docker.materializePreparedExport has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 19, loops 7, ternaries 2 (5 pts), error handling 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6854fd4f07e5c32fc76469bbd1c4357b80679c099e90a30ac537815fb8cbab6b"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-picker-routes.handleCookiePickerRoute (cognitive 79): cookie-picker-routes.handleCookiePickerRoute has cognitive complexity 79 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 22, error handling 6 (14 pts), loops 3 (6 pts), ternaries 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":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"715d7ce76c1e0e26a7ccd6ea4d4d5bde42f67215ee574471cddb89ce2f572ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-owned-journal.readOwnedClaudePublicTranscript (cognitive 78): claude-owned-journal.readOwnedClaudePublicTranscript has cognitive complexity 78 (threshold 15). Drivers by points: if/else 19 (35 pts), ternaries 10 (19 pts), boolean chains 12, loops 4 (8 pts), error handling 2 (4 pts) (nesting depth added 31). Of this number, 50 points are the body\u0027s own statements and 28 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":"lib/claude-owned-journal.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a6035569abbef120bb783f02c25e3bce44f9518404aacbaef213fff4ee039f"}},{"ruleId":"D2","level":"warning","message":{"text":"image-provisioning.provisionCatalogImages (cognitive 78): image-provisioning.provisionCatalogImages has cognitive complexity 78 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 10 (22 pts), loops 5 (17 pts), boolean chains 5, error handling 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f97b2b7ae4293efce05b2d5b672ae54a425fcce3c34c30a933f80fa0ff22f4"}},{"ruleId":"D2","level":"warning","message":{"text":"design-md.convertLegacy (cognitive 77): design-md.convertLegacy has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (53 pts), loops 8 (16 pts), boolean chains 5, ternaries 2 (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":"lib/design-md.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d345893d96e5c46584f9a52d7d6901938319f2dfff48bc8784828c9c54e8f8"}},{"ruleId":"D2","level":"warning","message":{"text":"question-preference-hook.main (cognitive 77): question-preference-hook.main has cognitive complexity 77 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 14, error handling 3 (9 pts), loops 5 (9 pts), ternaries 3 (8 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":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3785fd365d2c0e99a24f43b041d7aa56ee097b0ca8ff398190629c3b086913"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-catalog.validateRuntimeCatalog (cognitive 77): runtime-catalog.validateRuntimeCatalog has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (51 pts), boolean chains 17, loops 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/runtime-catalog.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc038ef553006338d8c56d99c5cd4c1118c778320e609337b9072197110c84"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-check.carryWith (cognitive 76): changelog-check.carryWith has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 9 (19 pts), boolean chains 16, ternaries 2 (nesting depth added 28). Of this number, 52 points are the body\u0027s own statements and 24 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":"lib/changelog-check.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2911e9ba17fefe21ecf7bb01d9d4115c0b46831d3a13c6c03a9fbf783e9f2b48"}},{"ruleId":"D2","level":"warning","message":{"text":"guard-journal.select.\u003Creturned closure\u003E (cognitive 74): guard-journal.select.\u003Creturned closure\u003E has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 8 (12 pts), boolean chains 11, ternaries 3 (8 pts), error handling 1 (2 pts) (nesting depth added 36). Of this number, 55 points are the body\u0027s own statements and 19 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":"autoplan/bin/guard-journal.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9b23a573f1b8a78d90192ba4dcbaafcdd75e65ea985a68a034a553b481c23c"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerGroup.createContainer (cognitive 74): DockerGroup.createContainer has cognitive complexity 74 (threshold 15). Drivers by points: if/else 30 (38 pts), boolean chains 23, ternaries 8, loops 3, error handling 2 (nesting depth added 8). Of this number, 70 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03d673c552eba78939689e5aed2259114fd705e870089e70a7ca02c44c4ab04"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.validateRepairBundle (cognitive 74): verification.validateRepairBundle has cognitive complexity 74 (threshold 15). Drivers by points: if/else 26 (42 pts), boolean chains 22, loops 4 (8 pts), ternaries 1 (2 pts) (nesting depth added 21). Of this number, 72 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":"lib/cso/verification.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3266ba6e7701721579032153ba733c2b271eb1025fee67cbf27e13a453c35f"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-run.runFlaky (cognitive 74): flaky-run.runFlaky has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 16 (28 pts), if/else 15 (19 pts), loops 9 (15 pts), boolean chains 12 (nesting depth added 22). Of this number, 62 points are the body\u0027s own statements and 12 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":"lib/flaky-run.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3769642e7e0dc1ce3fcc668a76e4251c7bee00479b0efadefaea17803c032b"}},{"ruleId":"D2","level":"warning","message":{"text":"shell-writes.writeTargets (cognitive 73): shell-writes.writeTargets has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (37 pts), ternaries 6 (15 pts), boolean chains 14, loops 4 (7 pts) (nesting depth added 27). Of this number, 71 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":"lib/shell-writes.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d940eaf8e98cf180d480e047df83ec51ca667af2dde0784fbd67695496b9f341"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.canonicalStartPlan (cognitive 73): verification.canonicalStartPlan has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (46 pts), boolean chains 12, loops 3 (7 pts), ternaries 2 (6 pts), error handling 1 (2 pts) (nesting depth added 35). Of this number, 70 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":"lib/cso/verification.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b989846631c1ecdfcf5d375b0d6a377899aa9afd5617b2ebedc11434ecf14"}},{"ruleId":"D2","level":"warning","message":{"text":"model-policy-cli.modelsMain (cognitive 71): model-policy-cli.modelsMain has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (28 pts), ternaries 13 (27 pts), boolean chains 9, loops 4 (6 pts), error handling 1 (nesting depth added 28). Of this number, 68 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":"lib/model-policy-cli.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2384e0e22d96ed6efea8316d644f6ba1eaa35ae23fe249dbb6d0445f9439b95"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land-direct.landDirect (cognitive 70): ship-queue-land-direct.landDirect has cognitive complexity 70 (threshold 15). Drivers by points: if/else 56 (74 pts), ternaries 19 (30 pts), boolean chains 19, 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. This shape REPEATS in the file: one other method here (ship-queue-land-direct.landDirect::locked) 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e78cae34ab10c5fcfa1ae6086520bc4ff6b7715802f113bb8a18eea0dc3ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.scan (cognitive 69): gstack-design-detect.scan has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (39 pts), ternaries 8 (15 pts), loops 7 (10 pts), boolean chains 3, error handling 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":"bin/gstack-design-detect.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"2600a6cd2b9db3637fc770460e6ed2de7899d5db2ced40a55c4f03a0464dc148"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.admitSlots (cognitive 69): ship-queue-train.admitSlots has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (29 pts), ternaries 11 (29 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e483e89afe045c708fdc241a00e200252aae8d3031b398f342179cc8e229fb0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-docs-result.checkDocsResult (cognitive 69): ship-docs-result.checkDocsResult has cognitive complexity 69 (threshold 15). Drivers by points: if/else 27 (46 pts), boolean chains 18, loops 4, error handling 1 (nesting depth added 19). 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":"lib/ship-docs-result.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d198fe313a55de336a4e9e3870097c45227637c9f502b4ea41286fe802ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.finishStages (cognitive 69): ship-release.finishStages has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (36 pts), ternaries 12 (19 pts), boolean chains 6, loops 3 (5 pts), error handling 2 (3 pts) (nesting depth added 24). Of this number, 68 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":"lib/ship-release.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c055a4593c3afdedaa5a3a6a8fafb6a853372267b4ee34130b72f3459ee84cd"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-reconcile.reconcile (cognitive 68): autoplan-reconcile.reconcile has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 14, ternaries 5 (12 pts), loops 4 (5 pts) (nesting depth added 28). Of this number, 62 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ca4664b5859efe22b7ff219c9b347b15ec826e296d1b8399b6c29aa9db19f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-carry.findCarry (cognitive 67): ci-carry.findCarry has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 16 (35 pts), if/else 16 (23 pts), boolean chains 6, loops 2, error handling 1 (nesting depth added 26). Of this number, 64 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":"lib/ci-carry.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"620f84ab5b709bdbd3daecce65db6e7d9d53ae8e23c636b1b214b52edfa7b517"}},{"ruleId":"D2","level":"warning","message":{"text":"variants.requestVariantImage (cognitive 67): variants.requestVariantImage has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (53 pts), ternaries 2 (7 pts), error handling 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f0eb986f4098d5dd1205cd02e61d6e0d55ddf47f851c8d7123d3b3ca6b658c"}},{"ruleId":"D2","level":"warning","message":{"text":"model-policy-freshness.assessFreshness (cognitive 67): model-policy-freshness.assessFreshness has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 18, ternaries 7 (16 pts), loops 4 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-freshness.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"be984f7684e4f1b2aa4b83881552c0d5fe1857724d2bcfea21d6438924e34f27"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-journal-records.recordEvents (cognitive 66): claude-journal-records.recordEvents has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (46 pts), boolean chains 10, ternaries 3 (8 pts), loops 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2a6be9f4ca4201a929feb5e6ae7a234552c8e549a08d3a7f0ec2a0a2639680"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.walkGstackArtifacts (cognitive 66): gstack-memory-ingest.walkGstackArtifacts has cognitive complexity 66 (threshold 15). Drivers by points: if/else 14 (35 pts), error handling 5 (14 pts), loops 4 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b29ff81b4c4f917c24567ee2c2145c779bf83bf3b5623f514e7724b355320"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.sendCommand (cognitive 66): cli.sendCommand has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (40 pts), ternaries 6 (11 pts), boolean chains 9, error handling 2 (3 pts), loops 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3afc0abd21c8fc7f8c017e6d050f720976518edd95815c63700cab0e1ae6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"lanes.runSelected (cognitive 66): lanes.runSelected has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 24 (42 pts), if/else 14 (16 pts), boolean chains 8 (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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffcd1ad8ba3f01ab8106d6442415f6fdf97592efabf41609ff0cdad4b3401eb"}},{"ruleId":"D2","level":"warning","message":{"text":"version-gate-train.classify (cognitive 66): version-gate-train.classify has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (33 pts), ternaries 11 (20 pts), boolean chains 11, error handling 2 (nesting depth added 18). Of this number, 64 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":"crew/lib/version-gate-train.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3ae1d7104fd25beecd727306486f60dacbd15122e8032659282c4db8340a14"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-land.landUpdate (cognitive 66): ship-queue-train-land.landUpdate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (39 pts), ternaries 8 (21 pts), boolean chains 5, error handling 1 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"849b0c269fb37350eb7ba9876bc436339f924b8a4aae43c4fd3891a6f35cd24f"}},{"ruleId":"D2","level":"warning","message":{"text":"state.ensureLockProtocol (cognitive 66): state.ensureLockProtocol has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (36 pts), error handling 7 (21 pts), boolean chains 9 (nesting depth added 34). 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":"lib/cso/state.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf063dafca6375411713889b89b24721c32bbcb37ddfff282f58edb3133cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-engine.scanInternal (cognitive 65): redact-engine.scanInternal has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (44 pts), boolean chains 9, loops 5 (7 pts), ternaries 3 (5 pts) (nesting depth added 33). Of this number, 64 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":"lib/redact-engine.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbef4aa06a68940dc53c2641efc3a3153d8afc6760d043b099736211120a69aa"}},{"ruleId":"D2","level":"warning","message":{"text":"review-risk.matchRisk (cognitive 65): review-risk.matchRisk has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 23, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 23). Of this number, 64 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":"lib/review-risk.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fafd768e5d7442f25ffe1fb491c6a7ca79880a35a52407f88e3a40aba89ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-contract.parseTranscript (cognitive 65): skill-contract.parseTranscript has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (34 pts), ternaries 4 (16 pts), boolean chains 10, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57157d511a774c403bf6f484fc7188b6e30536cd630b439e47721fc107e2d37"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-auth-verification.verifyCookieAuthentication (cognitive 64): cookie-auth-verification.verifyCookieAuthentication has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (33 pts), ternaries 8 (17 pts), boolean chains 10, error handling 2, loops 2 (nesting depth added 21). Of this number, 17 points are the body\u0027s own statements and 47 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":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1814fce930b9d0ef68913205bccb7e7af9a11f068cc1011d56154d24a6b7d09"}},{"ruleId":"D2","level":"warning","message":{"text":"approval-record.importAutoplan (cognitive 64): approval-record.importAutoplan has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 16 (42 pts), if/else 6 (8 pts), boolean chains 7, error handling 2 (4 pts), loops 3 (nesting depth added 30). Of this number, 60 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"61690d4746213ce635e2335bc659ce3ca9d30ac2d38b926d8548e064d5d9ea62"}},{"ruleId":"D2","level":"warning","message":{"text":"state.recoverAtomicNoReplaceJson (cognitive 64): state.recoverAtomicNoReplaceJson has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (40 pts), error handling 8 (12 pts), boolean chains 9, loops 1 (2 pts), ternaries 1 (nesting depth added 24). Of this number, 61 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":"lib/cso/state.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"237759bd6fbeaf3ddd37cb5e75189bd8afd3f875127cb561634f5630277da99e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.writeExcludeBinds::bindAudits (cognitive 63): ship-receipt-depth.writeExcludeBinds::bindAudits has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (27 pts), ternaries 10 (20 pts), loops 7 (9 pts), boolean chains 7 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ship-receipt-depth.writeExcludeBinds) 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cd6a26ad04e83fdd28277ead0f8c1f0d6443bc055c059f486fbc1284c70fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.pruneTrains (cognitive 63): ship-queue-train.pruneTrains has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 8 (22 pts), loops 4 (9 pts), boolean chains 6 (nesting depth added 31). Of this number, 58 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e03d10aee2bf8e393bd23a540e5dcfbdddcffea2b9c05c6cff8a369599365e"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.parseArgs (cognitive 63): gstack-post.parseArgs has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (33 pts), ternaries 8 (17 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e490f7e92d36d57bbd9061e5759399e396087dc573a8118103e44e938f91f85"}},{"ruleId":"D2","level":"warning","message":{"text":"forceRestart (cognitive 63): forceRestart has cognitive complexity 63 (threshold 15). Drivers by points: error handling 14 (23 pts), if/else 19 (21 pts), boolean chains 14, ternaries 3 (4 pts), other 1 (nesting depth added 12). Of this number, 29 points are the body\u0027s own statements and 34 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"7296ae2e2dc71e2ffd57a240db0d699230cbde226d3c33246a732c9d40bedd36"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.preparePages (cognitive 62): gstack-memory-ingest.preparePages has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (33 pts), ternaries 4 (17 pts), boolean chains 9, error handling 1 (2 pts), loops 1 (nesting depth added 32). Of this number, 60 points are the body\u0027s own statements and 2 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4597b1ae249191fb563ba4ce07357f6c858724313a22c003d14a66056752a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-ready.trainReady (cognitive 62): ship-queue-train-ready.trainReady has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (31 pts), ternaries 11 (20 pts), boolean chains 11 (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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4197091c225bbb0a8ed23249f3983192c330308a724dd0bf25b9eb8dfc5a93cc"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.verifyResumeDir (cognitive 61): gstack-memory-ingest.verifyResumeDir has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (35 pts), ternaries 5 (14 pts), boolean chains 8, loops 2 (3 pts), error handling 1 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc7a930db0421fc18041d7e071c45d0bc25187f9ca8e637ed9906898e5d0716"}},{"ruleId":"D2","level":"warning","message":{"text":"literals.consumersOf (cognitive 61): literals.consumersOf has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 16, ternaries 6 (8 pts), loops 4 (7 pts), error handling 1 (2 pts) (nesting depth added 23). Of this number, 30 points are the body\u0027s own statements and 31 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/literals.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b04b534c184e1fe458f7fa7b1306918fad1d360d2ea996fdf0c47802b2e8df6"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-wave.waveSettle (cognitive 61): ship-queue-wave.waveSettle has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 14 (30 pts), if/else 14 (18 pts), boolean chains 11, error handling 1, loops 1 (nesting depth added 20). Of this number, 51 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2870d26c6ef18f431d22d292ae9efa70400c5df3575cfca28e3ec615058645e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-cli.trainMain (cognitive 61): ship-queue-train-cli.trainMain has cognitive complexity 61 (threshold 15). Drivers by points: if/else 26 (40 pts), boolean chains 14, ternaries 3 (7 pts) (nesting depth added 18). Of this number, 54 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0135d069fc87eb35ac676c41bb4a7885a79877a8e5e44b6f35b3d97bf1a87bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.extractNpmArchive::consume (cognitive 61): preparation-container.extractNpmArchive::consume has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 2 (5 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"118781570db367b472cc2b2f17a7638f8d5114835cac9795934f19c14dcd8251"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.loopStep (cognitive 60): review-depth.loopStep has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 11 (40 pts), if/else 10 (12 pts), boolean chains 8 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce4f3a9b6a69a9494f44d6e7d0bfea107fd89bc54f7f2c8814c969d55594be3"}},{"ruleId":"D2","level":"warning","message":{"text":"bin-context.slugFromEnvironment (cognitive 60): bin-context.slugFromEnvironment has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 11, error handling 3 (6 pts), ternaries 3 (6 pts), loops 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb5f69f48ea18a7449df9428d63808f7b56ef8ecd0e1077fabbfe1b5a68b82d"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-executor.treeManifest::walk (cognitive 60): preparation-executor.treeManifest::walk has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 9, error handling 2 (5 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c470c76104b207e6ab7ec3888e02e36073891a9f407ea6e247d7bbf6ea7d17"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.leanPlan (cognitive 59): review-depth.leanPlan has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 11 (25 pts), if/else 13 (17 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 20). Of this number, 52 points are the body\u0027s own statements and 7 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":"lib/review-depth.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"2534d51f48ba59ff9224205f1d816878d1646a669bccfdd518fcfbfa86483d32"}},{"ruleId":"D2","level":"warning","message":{"text":"train-gate.routeDispatch (cognitive 59): train-gate.routeDispatch has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 13, ternaries 3 (5 pts) (nesting depth added 21). Of this number, 57 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":"crew/scripts/train-gate.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eb9c2d02aca909754d9627c5e0c69be2e486df2ae71c4507ba69ff5528aae4"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-public.scan (cognitive 59): autoplan-public.scan has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 13 (35 pts), if/else 5 (11 pts), loops 3 (6 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 33). Most of this is not in the body itself: 13 of the 59 points are its own statements and the rest belongs to 8 function items inside it that branch (values, a function literal at line 106, a function literal at line 118, \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":"lib/autoplan-public.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7003ba947a8fe9a9c4d8b9e420813be7dbda3e97fdef8fcc9cc8935d180565"}},{"ruleId":"D2","level":"warning","message":{"text":"inventory.validateEntry (cognitive 59): inventory.validateEntry has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 15, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inventory.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8388e47a4ef831886f99e56948bef0d5bfb8143efa81eab6f98a9af1aa433047"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-patch.boundedPaths (cognitive 59): ship-patch.boundedPaths has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (32 pts), ternaries 8 (20 pts), boolean chains 6, loops 1 (nesting depth added 31). Of this number, 41 points are the body\u0027s own statements and 18 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":"lib/ship-patch.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b6a595deac68c1d35e7fbcd6cc5d0e020d195a245e3f990bcbfdf7305dc181"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost-history.classifyReds (cognitive 58): gate-cost-history.classifyReds has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (29 pts), ternaries 7 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 35). Of this number, 16 points are the body\u0027s own statements and 42 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":"crew/lib/gate-cost-history.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd98ff0225c8022e203fe3897d11cb69a0c4c30cd6bdeef1ae16f8470f151a9"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparationExecutor.acquire (cognitive 58): PreparationExecutor.acquire has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 12, error handling 3 (7 pts), loops 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa76dc0c1cf60c37182eb1f230a46f4f9f6fff2b8cc0869d096599d0119556e9"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.parseEvalCalls (cognitive 58): eval-plan.parseEvalCalls has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (51 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fa2b515fbd9423f8cb0a1194d53546c5b6aac894f1ff605cec095656dceef1"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.mergeSplit (cognitive 58): gstack-post.mergeSplit has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 19, ternaries 10 (15 pts), loops 3 (nesting depth added 14). Of this number, 44 points are the body\u0027s own statements and 14 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":"lib/gstack-post.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"982cb5f32a28cad0c7fe4116760471bfebc76cc7753c4c5d2e0cfb318af05823"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.ensureServer (cognitive 57): cli.ensureServer has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 16, loops 2 (6 pts), ternaries 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae05498c45bfd766062921a23caadff2958f5b6369a0a5a9c2cd960f14dc14f3"}},{"ruleId":"D2","level":"warning","message":{"text":"review-evidence.bindReview (cognitive 57): review-evidence.bindReview has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 17, ternaries 4 (7 pts), loops 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a4637b878d7be2e2db782f9cdf4228aca3227835ce8e5f8a20f306ef72b823"}},{"ruleId":"D2","level":"warning","message":{"text":"runaway.runawayMain (cognitive 57): runaway.runawayMain has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (24 pts), ternaries 9 (15 pts), boolean chains 7, loops 5 (7 pts), error handling 2 (4 pts) (nesting depth added 17). Of this number, 49 points are the body\u0027s own statements and 8 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":"lib/runaway.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d2b690479bdfedb82614e7d7802c7079491bf01384f80150465bb596ebc7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-mechanical.mechanicalPaths (cognitive 57): ship-mechanical.mechanicalPaths has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 12, ternaries 4 (6 pts), loops 3 (nesting depth added 20). Of this number, 47 points are the body\u0027s own statements and 10 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-mechanical.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fcd74b12801aed751cb48914f9fa3ea09b2595f4ad50601e94f0b2915d1670"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-revise.reviseRun (cognitive 56): autoplan-revise.reviseRun has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 15 (19 pts), boolean chains 17, if/else 9 (10 pts), loops 7 (9 pts), error handling 1 (nesting depth added 7). Of this number, 53 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-revise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4607b0e6287ca46035b644bd6f9c3837b03e921b198abdc453ff82383ebc931"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-carry.shipLanesErrors (cognitive 56): ci-carry.shipLanesErrors has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 4 (10 pts), boolean chains 9 (nesting depth added 25). Of this number, 55 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":"lib/ci-carry.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a422862145b1fe7404ea05ca0a5efed122010312ace85151ea8c2ef85a4400"}},{"ruleId":"D2","level":"warning","message":{"text":"secrets.run (cognitive 56): secrets.run has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 11 (18 pts), boolean chains 16, if/else 8 (12 pts), loops 3 (6 pts), error handling 2 (4 pts) (nesting depth added 16). Of this number, 39 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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e0b7f174807f250d9c45065d70a7b97b4790ac0e92b7ca390887d12eb17207"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.trainStatus (cognitive 56): ship-queue-train.trainStatus has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 12 (28 pts), if/else 8 (18 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"48568c0412ccabfbdf5d5986526013432b59d4e6b4787024b6cd531e83def2a1"}},{"ruleId":"D2","level":"warning","message":{"text":"review-pass.buildManifest (cognitive 56): review-pass.buildManifest has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 18 (32 pts), if/else 7 (12 pts), boolean chains 8, error handling 1 (2 pts), loops 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31589369f9bc75c37d10fc151e400ff19c965879770a373be9fe14eb93152e0"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-receipt.classifyFile (cognitive 55): tree-receipt.classifyFile has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 11 (23 pts), if/else 15 (21 pts), boolean chains 9, error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f1ea4a376f15ef179e8ef52d3abd4b23477c21123ae876d177fec943b6c60a"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-receipt.buildReceipt (cognitive 55): tree-receipt.buildReceipt has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (25 pts), ternaries 12 (13 pts), boolean chains 11, loops 3 (6 pts) (nesting depth added 9). Of this number, 51 points are the body\u0027s own statements and 4 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd753373e1dc78befd6726aabe7adf64d4e17f9143906fee0679552d8d8eae65"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.ready (cognitive 55): ship-queue.ready has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (28 pts), ternaries 13 (17 pts), boolean chains 9, error handling 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"62437a1b6e7e5ebb3a3a5bc4beabd305246677100da9340cf59cb07647549d82"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.mergeStep (cognitive 55): ship-queue-train.mergeStep has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 8 (19 pts), boolean chains 7, loops 3 (nesting depth added 21). Of this number, 50 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8b795742d6138f6a8d6f6338871f3192f2c902cb9c3272f44b0edc0a1b3266"}},{"ruleId":"D2","level":"warning","message":{"text":"gen-accessors.maskSwiftSource (cognitive 55): gen-accessors.maskSwiftSource has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (17 pts), boolean chains 10, ternaries 1 (3 pts) (nesting depth added 27). Of this number, 51 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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e5c459788dc00d4a8cdfd6520232dd0ef88d84035591f14462bdb44d369db7"}},{"ruleId":"D2","level":"warning","message":{"text":"state.recoveryJson (cognitive 55): state.recoveryJson has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 15, error handling 5 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"543e94a0baa5282c8438acd7072ac794f7262ba1ef48d5d75c8ee76cb839fbdb"}},{"ruleId":"D2","level":"warning","message":{"text":"state.retention (cognitive 55): state.retention has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 8 (12 pts), boolean chains 11, error handling 2 (nesting depth added 19). Of this number, 39 points are the body\u0027s own statements and 16 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":"lib/cso/state.ts"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbd8fa90776be156f0cbbd445126ab1ddef6bd56e066967bb16e62646f7dff3"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-gbrain-sync.runCodeImport (cognitive 54): gstack-gbrain-sync.runCodeImport has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (29 pts), ternaries 9 (13 pts), boolean chains 9, error handling 2 (3 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1fca08a932c4a2e149e14da1065226facfd7f0fe8449ca4f026ebe2a049017"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-browser.listProfiles (cognitive 54): cookie-import-browser.listProfiles has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (34 pts), error handling 3 (7 pts), ternaries 3 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 30). Of this number, 48 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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7039a4cc0e1f0f69c6c6295a73b520f1b80ef5a988fea04e795829e006e439"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cut.gateVerdict (cognitive 54): release-cut.gateVerdict has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 7 (19 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 27). Of this number, 52 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":"crew/scripts/release-cut.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3a4396b09067282d7dabe8ce4609fb4981a1c1a66deab517bcb9b0dc9ba229"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cut.readTrainNotes (cognitive 54): release-cut.readTrainNotes has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 15, ternaries 2 (6 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 20). Of this number, 52 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":"crew/scripts/release-cut.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"468916cd2430b0b735f42bf0a65c7acd6c07a1019cb1ed7f1aefdbdec033d502"}},{"ruleId":"D2","level":"warning","message":{"text":"question-log-hook.extractUserChoices (cognitive 54): question-log-hook.extractUserChoices has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 7 (21 pts), loops 7 (13 pts), boolean chains 10, if/else 6 (10 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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5f0c7f6cc4df78718f0defdc1e0554b2b945fab3fbfc2e204a2d97b8acccf3"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-executor.createDockerScannerRunner (cognitive 54): scanner-executor.createDockerScannerRunner has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (34 pts), ternaries 5 (8 pts), boolean chains 5, loops 2 (4 pts), error handling 2 (3 pts) (nesting depth added 23). Most of this is not in the body itself: 5 of the 54 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 753, capture, writePolicy, \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":"lib/cso/scanner-executor.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dda3669de21f5c19d4f950e9b1881e94bd744a9410ef2750c214e4635f3c6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-autoplan-snapshot.acceptedBlocks (cognitive 53): gstack-autoplan-snapshot.acceptedBlocks has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (41 pts), boolean chains 11, loops 1 (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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d318aaed339f5c52ef75e88ebd8b8e63718990b92c5f72df97e9704e16be1e"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-shadow-reader.exportShadow (cognitive 53): autoplan-shadow-reader.exportShadow has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 8 (35 pts), loops 3 (6 pts), boolean chains 5, if/else 2 (5 pts), error handling 1 (2 pts) (nesting depth added 34). Of this number, 52 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":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f67d4327de463cafd3315f8bcd76153a7c4b038a9df88d0c7e29001d8bb80bf"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-docker.superviseRegistrySocket (cognitive 53): preparation-docker.superviseRegistrySocket has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (25 pts), error handling 9 (13 pts), boolean chains 9, loops 3, ternaries 2 (3 pts) (nesting depth added 13). Of this number, 35 points are the body\u0027s own statements and 18 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"9643c55d3f51d6cc5594d6546e6ef6f8cd486e13370d8cd7d67a08e23e0a8b28"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.runPost (cognitive 53): gstack-post.runPost has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 13 (20 pts), if/else 13 (16 pts), boolean chains 10, loops 3 (6 pts), error handling 1 (nesting depth added 13). Of this number, 47 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d5ef3135d89cc18ef14a162cff56a6c24656d9637b2774b3df4ad69ee1fa2f"}},{"ruleId":"D2","level":"warning","message":{"text":"office-hours-review.validateOfficeHoursReview (cognitive 53): office-hours-review.validateOfficeHoursReview has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 11, loops 4, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d500b5852725cd55cb23c6eb877be9b064a4abae77985bc08f09072bc6b130"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.parseJSONSnapshotType (cognitive 53): main.swift.parseJSONSnapshotType has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 6 (16 pts), ternaries 3 (8 pts), boolean chains 5 (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":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b44b3859188fb4e9a6e693c5b773957a51bd8ed1da0ece896ca66ce185878b"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-phase-publication.autoplanPhaseCompletions (cognitive 52): autoplan-phase-publication.autoplanPhaseCompletions has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 11, loops 3 (7 pts) (nesting depth added 26). Of this number, 51 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":"lib/autoplan-phase-publication.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"14518661d8219f587ce005789bca872cd44209c3bb5ef7e9477fabf27d3daed5"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost-history.simulateArrivalTrains (cognitive 52): gate-cost-history.simulateArrivalTrains has cognitive complexity 52 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 7 (21 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 31). Of this number, 50 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":"crew/lib/gate-cost-history.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ef93f67a0ec34cf891bf2fc325b150156e0e36dfcf50561161c6e759e55337"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.nextStep (cognitive 52): autoplan-run.nextStep has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (27 pts), ternaries 6 (12 pts), boolean chains 8, loops 3, error handling 1 (2 pts) (nesting depth added 13). Of this number, 49 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":"lib/autoplan-run.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b920fbff306e4414d935beb107e11240bfd2f57a834420151b744724191cd1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.resumeRun (cognitive 52): autoplan-run.resumeRun has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 11, ternaries 3 (10 pts), loops 4 (nesting depth added 20). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3ccd677eed2febffcd40bf35fcc53d45de36856820bd735f993c1e486f2556"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-contract.checkItem (cognitive 52): skill-contract.checkItem has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 9 (21 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (nesting depth added 24). Of this number, 36 points are the body\u0027s own statements and 16 belong to 5 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":"lib/skill-contract.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e03d9ae6d338a6107ad71bcc9718fc2a2d5cd874b025aa9a7512bc00cd0ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.manifest (cognitive 52): preparation-container.manifest has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (8 pts), error handling 2 (7 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 23). Of this number, 48 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":"lib/cso/preparation-container.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"53715ccef77a49c9755d4e230dbcf7ab3d1ceb1602b7a131269e814b91295ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"design-build.receipt (cognitive 52): design-build.receipt has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 16 (19 pts), boolean chains 17, if/else 15, loops 1 (nesting depth added 3). Of this number, 30 points are the body\u0027s own statements and 22 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d40d88d7044a7d65e7e421666259dcadf24f39b471d342c881e7c536e4cdb8"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-evidence.capture (cognitive 52): qa-evidence.capture has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 10 (13 pts), boolean chains 10, error handling 3 (6 pts), loops 1 (nesting depth added 11). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/qa-evidence.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7314a79accac41168cf3503703f81649126bfc5dcd9bb08552ad28161f0081f"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-bill.checkEvalTasks (cognitive 52): skill-bill.checkEvalTasks has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 10, loops 5 (10 pts), error handling 2 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-bill.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a9689b84eaadee14489f1e8d88c6781a25b8282e090bb66cba8e66a5d84127"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.phaseDecision (cognitive 51): phase-publication-hook.phaseDecision has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 12, error handling 3 (9 pts), loops 1 (nesting depth added 18). Of this number, 49 points are the body\u0027s own statements and 2 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6e0c1c44d9c444578e2322c716e2b7f63df5f40f5546be1d60427c72c0c732"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-carry.submitCarryCheck (cognitive 51): autoplan-carry.submitCarryCheck has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (28 pts), ternaries 7 (14 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 21). Of this number, 49 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-carry.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9e1f0bbfdf06df27cadc13d735e12ae6c070d3843167b3870ca6dcef6e75dd"}},{"ruleId":"D2","level":"warning","message":{"text":"supervise.supervise (cognitive 51): supervise.supervise has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 9, ternaries 7 (8 pts), error handling 5 (6 pts), loops 1 (nesting depth added 7). Most of this is not in the body itself: 2 of the 51 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 215, readNew, a function literal at line 203, \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":"lib/pregate/supervise.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6707a46317c581a19a1dd75290b19bcb82d1c6140f9060aa237c82ed2fd72c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-owner-words.ownerSpans (cognitive 51): autoplan-owner-words.ownerSpans has cognitive complexity 51 (threshold 15). Drivers by points: loops 12 (34 pts), ternaries 2 (7 pts), if/else 3 (6 pts), boolean chains 4 (nesting depth added 30). Of this number, 48 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39c937c3fdce53567dfa9ab91e29152ffb33047948fb7f31a1162cd52a2949e"}},{"ruleId":"D2","level":"warning","message":{"text":"scanners.scannerPlans (cognitive 51): scanners.scannerPlans has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 6 (10 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (nesting depth added 17). Most of this is not in the body itself: 8 of the 51 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 217, 438). 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":"lib/cso/scanners.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b126f75f7747ad54c85b28294dea6ed2c9fdd837e48fa6a30aca4e9f6770a7"}},{"ruleId":"D2","level":"warning","message":{"text":"review-pass.renderStage (cognitive 51): review-pass.renderStage has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 7 (15 pts), error handling 3 (9 pts), boolean chains 7, loops 1 (nesting depth added 23). Of this number, 42 points are the body\u0027s own statements and 9 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":"lib/review-pass.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcafaa86c424863bdc88de6fadac33725e4753fadf4992551d51cab7b6664680"}},{"ruleId":"D2","level":"warning","message":{"text":"runaway.assess (cognitive 51): runaway.assess has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 16, ternaries 9 (11 pts), loops 3 (6 pts) (nesting depth added 12). Of this number, 50 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":"lib/runaway.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae39949e76e3fe0a1c7bad9bbe376ef87abc859a511cbd9d6fe4b9f68b8a75e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 51): (anonymous) has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 17, loops 6 (7 pts), error handling 1 (nesting depth added 7). Of this number, 36 points are the body\u0027s own statements and 15 belong to 7 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dom-dump.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1ba1ff03169987cef6b087364529bb25e291681500ee44c26a742715596312"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.resolveTargets (cognitive 50): gstack-design-detect.resolveTargets has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (34 pts), error handling 2 (6 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 24). Of this number, 37 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":"bin/gstack-design-detect.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88186dd772c8ce4781ca48d265767e04116983ce6df79a60dad2c23e8c3ba64"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-global-discover.scanGemini (cognitive 50): gstack-global-discover.scanGemini has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (22 pts), error handling 6 (15 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-global-discover.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a729b0462f89712fe8b565f71ed86a8b83c7c9e43e1609445be0248d29e2db"}},{"ruleId":"D2","level":"warning","message":{"text":"recover-receipts.collectRecovery (cognitive 50): recover-receipts.collectRecovery has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 11, ternaries 4 (7 pts), error handling 3 (6 pts), loops 4 (6 pts) (nesting depth added 17). Of this number, 43 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/recover-receipts.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5703f3a7cd320b7d4f51ef0fc728eda8e280e16cca86f68769eeebbe8d9f70ec"}},{"ruleId":"D2","level":"warning","message":{"text":"review-exclude.grepFixed (cognitive 50): review-exclude.grepFixed has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (29 pts), ternaries 3 (9 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c10520f276d2d38dac5ceebeb3dcc1dc61959cc58d263e2c293ecacde0386c4"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.assertSnapshot (cognitive 50): snapshot.assertSnapshot has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 22, loops 2, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 25 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ac6338fb292f8aaf448597dcc93d25707503c19602dcf0d5e1ffacade94a15"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.doctor (cognitive 50): cli.doctor has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 12 (20 pts), if/else 13 (16 pts), boolean chains 7, error handling 5 (6 pts), loops 1 (nesting depth added 12). Of this number, 41 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fdf3cfb9acc54d85f8b524b97d3df5385795feea3a3ce4b181ab61abcd184a"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land-direct.landDirect::locked (cognitive 50): ship-queue-land-direct.landDirect::locked has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (32 pts), ternaries 5 (10 pts), boolean chains 7, 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 shape REPEATS in the file: one other method here (ship-queue-land-direct.landDirect) 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fddc6a9c3a3de634d08836c1516bea5ad61d14adb1531198574da3a8d0dcb65"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.parseTranscriptJsonl (cognitive 49): gstack-memory-ingest.parseTranscriptJsonl has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 12, loops 3 (4 pts), error handling 2 (3 pts), 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aece79f227cb5522515c42ad8042b97b0ba3d2869fd3c915ce642b0b41c026b"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.ingestPassScoped (cognitive 49): gstack-memory-ingest.ingestPassScoped has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (27 pts), ternaries 8 (13 pts), boolean chains 7, error handling 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f052369001235d3b274c730073c71bdeaecc78a2310d1a3a606eb2dac56384"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-global-discover.scanCodex (cognitive 49): gstack-global-discover.scanCodex has cognitive complexity 49 (threshold 15). Drivers by points: if/else 7 (25 pts), error handling 3 (11 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 32). Of this number, 48 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":"bin/gstack-global-discover.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ef06aca3414dbaaee7c075c0056e9a233faf980789c40ff6030559d7eab894"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-operation.runCookieImport (cognitive 49): cookie-import-operation.runCookieImport has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 14, error handling 3 (5 pts), ternaries 4, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-operation.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d8daa5bc453f0163a846bff3ee584be75ed88aa39fb0ba49c8aee10ddde7a3"}},{"ruleId":"D2","level":"warning","message":{"text":"media-extract.extractMedia (cognitive 49): media-extract.extractMedia has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 31, if/else 6 (11 pts), ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 2 of the 49 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 75, 88, 110, \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":"browse/src/media-extract.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b143aec1d771118082aa3425e4574e60004a64f8c63295e8f9e2cb4280b29b"}},{"ruleId":"D2","level":"warning","message":{"text":"regen.runRegen (cognitive 49): regen.runRegen has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 11 (23 pts), if/else 8 (15 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 22). Of this number, 43 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fc1986f41df38529ad4e28499e7fc89703cef6dade1187f85073caaba418a4"}},{"ruleId":"D2","level":"warning","message":{"text":"django.djangoEdges (cognitive 49): django.djangoEdges has cognitive complexity 49 (threshold 15). Drivers by points: loops 11 (25 pts), if/else 8 (17 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/django.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86f50ab995686a2717640395ce59975b0cfb06d23fac5d331917b903126677f"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher.poll (cognitive 49): Watcher.poll has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 11, ternaries 2 (5 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549a71fccdd4a9f45ad47872ceddeed485b181c804bd1015af8d92bf3eb65fc"}},{"ruleId":"D2","level":"warning","message":{"text":"state.discardAtomicNoReplaceTemp (cognitive 49): state.discardAtomicNoReplaceTemp has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (36 pts), error handling 5 (9 pts), boolean chains 4 (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":"lib/cso/state.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e4f0aeadeee2386b2cb37540c805d4d2ba48a1c954fd1894688c28e90e9c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-autoplan-snapshot.initializePlan (cognitive 48): gstack-autoplan-snapshot.initializePlan has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 16, error handling 2 (4 pts), loops 1 (2 pts), ternaries 2 (nesting depth added 7). Of this number, 32 points are the body\u0027s own statements and 16 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f6deabd9905c2aad8eec8f9a7691cac58cf3ee0e59622c55c0a3d698f5ce9e"}},{"ruleId":"D2","level":"warning","message":{"text":"server.buildFetchHandler.shutdown (cognitive 48): server.buildFetchHandler.shutdown has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 16, error handling 5 (8 pts) (nesting depth added 12). Of this number, 47 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":"browse/src/server.ts"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd68c2554dfe051aa831c7cf061bae427e7ccdfaa343500ac3c1e88dadb6eccb"}},{"ruleId":"D2","level":"warning","message":{"text":"review-exclude.binaryContent (cognitive 48): review-exclude.binaryContent has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 6 (12 pts), loops 6 (9 pts), boolean chains 7, error handling 1 (3 pts) (nesting depth added 19). Of this number, 44 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":"lib/review-exclude.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f930365801d234f27a3acc2cc075e44f314f11715fd4b32dc204249ea1c318"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.verify (cognitive 48): ship-queue.verify has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 7, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"340bf1cf6f6660f8773430f50db89bfc76ab3b8351f74b7d37105d2f6210b9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"memorable-user-prompt-hook.main (cognitive 48): memorable-user-prompt-hook.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (29 pts), ternaries 4 (7 pts), error handling 4 (6 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25856b0d640ea17c5530b2483c7f098b014c5ceaaa4fe32ffe720c03c41baed"}},{"ruleId":"D2","level":"warning","message":{"text":"state.activateRunLease (cognitive 48): state.activateRunLease has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 4 (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":"lib/cso/state.ts"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad99ba6be12c3fffa6862335a4c44ce68954f5562ce9039c625f93152cde612"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-local-status.freshClassify (cognitive 47): gbrain-local-status.freshClassify has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 5 (13 pts), boolean chains 7, error handling 3 (4 pts) (nesting depth added 19). Of this number, 18 points are the body\u0027s own statements and 29 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":"lib/gbrain-local-status.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f464612386063cc396df7ad4cfbff1de062e35e7a7318373837dc2c2d03bd206"}},{"ruleId":"D2","level":"warning","message":{"text":"content-security.markHiddenElements (cognitive 47): content-security.markHiddenElements has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 24). None of this is in the body itself: all 47 points belong to one function literal inside it that branches (line 89). 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":"browse/src/content-security.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"430e0cf1b1a38a42141e7f5ea3a3e41b70270744119976746edbe219ba217b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"content.captureBasicData (cognitive 47): content.captureBasicData has cognitive complexity 47 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 16, loops 4 (8 pts), error handling 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"538e4de7e489211da50a485134eb8caad2580c2681479c604432db01b6006c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"inspector.captureBasicData (cognitive 47): inspector.captureBasicData has cognitive complexity 47 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 16, loops 4 (8 pts), error handling 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6ea9332993f7e5657bf5ad344998d789cc199575641bc0457a8c2ad90acb99"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-contract.validateContract (cognitive 47): skill-contract.validateContract has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 7, loops 3 (5 pts), error handling 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f48c72453fca430179c413b361394363fbcd6ec6cf51548bd7c619e1972fa3a"}},{"ruleId":"D2","level":"warning","message":{"text":"state.recoverLeasePublications (cognitive 47): state.recoverLeasePublications has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (27 pts), error handling 3 (8 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 27). Of this number, 39 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d18ae57b9b27443dfc0d4a535dd8aaaf789f8b49915b26d1e448465b4cdd82"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.certify (cognitive 47): verification.certify has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 13, ternaries 9 (10 pts), loops 1 (2 pts) (nesting depth added 10). Of this number, 45 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":"lib/cso/verification.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac1646919d626acf70400718a036dd5dfee1b98d15d65a0660173f64eb8269"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.cmdResume (cognitive 47): ship-budget-cli.cmdResume has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 13 (16 pts), boolean chains 9, error handling 2 (5 pts) (nesting depth added 13). Most of this is not in the body itself: 11 of the 47 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 455, 462). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb179ea37b0bc1c6a6e4a866a8fb2a8b186a2bd74ab255185a1122c70636d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.codeLineStart (cognitive 46): redact-patterns.codeLineStart has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 11, loops 1, ternaries 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":"lib/redact-patterns.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"176715fce90d332b3396fa9c3ad9d4044cae58db11402de9ae1d2e2828fc4683"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.svgDrawing (cognitive 46): review-depth.svgDrawing has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 7, ternaries 2 (7 pts), loops 4 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cd27ef4bc05d52e94fe91d004c386a9b90a5be93eb456b4eda043ddb0bcb4e"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.launchHeaded (cognitive 46): BrowserManager.launchHeaded has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (25 pts), error handling 5 (11 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 16). Of this number, 29 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":"browse/src/browser-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84d5f849e5bef3c0c5f6c676095961f31f74ff91415f0c30f1a55a09b7c7381"}},{"ruleId":"D2","level":"warning","message":{"text":"stamp-only.versionStampOnly (cognitive 46): stamp-only.versionStampOnly has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 4 (11 pts), boolean chains 5, error handling 2, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/stamp-only.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d98628ac9b0f988787e42425a6c19fe44ea945418db1268fba5a007c28b2bca"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 46): cli.main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 10, ternaries 2 (5 pts), match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"87be4f89260fa6e23e0fb8e6dc52004771a3849f73e39d5ac8209789aaf02c62"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.inspectRails (cognitive 46): preparation.inspectRails has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (35 pts), ternaries 3 (5 pts), boolean chains 3, loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d809397bea51bb18c4d7c863fe93e143bff3099c5bbfb0dbb9be30d84d38ed"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.priceGate (cognitive 46): eval-plan.priceGate has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 9 (14 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f9a543667e9664e9a23a1905b459d17ece337714716f80ae5819b422c89734"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state-clean.report (cognitive 46): repo-state-clean.report has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 17 (36 pts), if/else 5 (7 pts), loops 2, boolean chains 1 (nesting depth added 21). Of this number, 38 points are the body\u0027s own statements and 8 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":"lib/repo-state-clean.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f561f082fe3721bff6cc556039001aa76663a749612b0c25ec245b10172462bb"}},{"ruleId":"D2","level":"warning","message":{"text":"review-brief.renderRole (cognitive 46): review-brief.renderRole has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 13 (25 pts), if/else 6 (11 pts), boolean chains 5, error handling 2 (4 pts), match/switch 1 (nesting depth added 19). Of this number, 39 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-brief.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c8827df95161f667008c8463240badbf242756600c38e70edf7f949e3d768a"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.classifyDiff (cognitive 45): review-depth.classifyDiff has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 6, loops 4 (5 pts), ternaries 2 (3 pts) (nesting depth added 13). Of this number, 41 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac6d454bbbce72a1b4c308ea490f48d28464101395819112cdc6c48de2165f1"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-fragments.readFragments (cognitive 45): changelog-fragments.readFragments has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 9 (18 pts), boolean chains 2, loops 2 (nesting depth added 20). Of this number, 36 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":"lib/changelog-fragments.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b81ac04858d39de44146709957d00457bf19a2f0c45d4174b90442a042f79e"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.rewriteStampPaths (cognitive 45): restamp.rewriteStampPaths has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 8, loops 4 (7 pts), ternaries 7 (nesting depth added 13). Of this number, 28 points are the body\u0027s own statements and 17 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":"lib/restamp.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3301dcd7aa07478a89806f1eac66c7e3a73752fb8ee8ebc2e0694bf09651672a"}},{"ruleId":"D2","level":"warning","message":{"text":"release-stamp.classifyRelease (cognitive 45): release-stamp.classifyRelease has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (27 pts), ternaries 6 (9 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 10). Of this number, 40 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/release-stamp.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"960f8a17b35b464c1123f502b1b775f72a335bafe3f47d989468461db0612aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"admission.admit (cognitive 45): admission.admit has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (30 pts), error handling 4 (11 pts), boolean chains 3, 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":"lib/cso/admission.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c6ed373762757af9eb330e3d5fed8fde745bb4773eb15132d96b3b70919a32"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.createPreparedExport::walk (cognitive 45): preparation-container.createPreparedExport::walk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 8, error handling 1 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"da13157aac09b9fc07d096be17b14d8f60cdc8635f43969c8292fbc4871c358b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.accept (cognitive 45): ship-release.accept has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 6 (9 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 12). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"91418acff8ea7522515d9fa553716ceb3e76a6ef140344ec0f500acfc8214737"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-helpers.extractGbrainBlock (cognitive 44): gstack-memory-helpers.extractGbrainBlock has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 2 (3 pts), boolean chains 2, ternaries 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":"lib/gstack-memory-helpers.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee8b7d0cb7c88adabbca72b979dc539e08bb0ed4661415c5971c46b0edf20b"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.restamp (cognitive 44): restamp.restamp has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (22 pts), ternaries 6 (12 pts), boolean chains 7, error handling 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":"lib/restamp.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3091ecefbddc296d0da531daf055288b0021e4bda5c53f4a08675fac658dab5b"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-carry.assess (cognitive 44): autoplan-carry.assess has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 16, ternaries 3, loops 2, error handling 1 (nesting depth added 4). Of this number, 37 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-carry.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c83720f35cb421dd9360c321d04629a6260792745d764e22fd10f1d8c146282"}},{"ruleId":"D2","level":"warning","message":{"text":"regen.validateRegistry (cognitive 44): regen.validateRegistry has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 10, loops 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 11). Most of this is not in the body itself: 8 of the 44 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 57, 74). 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":"lib/regen.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"810bf5b6c5693f28208798ea2e9377124630c1586c9fdfc40d69e858389fa5a0"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-exception.readRunFailures (cognitive 44): flaky-exception.readRunFailures has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 9, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 8). Of this number, 43 points are the body\u0027s own statements and 1 belongs 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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf87d31a8d36a72937682a5a63a87795e500a0939d5d01e78b306b6ad49275df"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.submit (cognitive 44): cli.submit has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 11, loops 2 (nesting depth added 10). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1401, 1463). 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":"lib/cso/cli.ts"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed89fe54ab306186391acd0a1a6b23fd7c42c9ddd20201aaa37abdd341fe2e90"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.cmdStart (cognitive 44): ship-budget-cli.cmdStart has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 13 (16 pts), if/else 13 (15 pts), boolean chains 13 (nesting depth added 5). Of this number, 37 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":"lib/ship-budget-cli.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e68d1600733f9a180f3c3e1a487a3221b1a9dc77192dee9a3b2712ad6731020"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 44): (anonymous) has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (27 pts), error handling 4 (10 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 12). Of this number, 27 points are the body\u0027s own statements and 17 belong to 17 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":"extension/background.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d323457704980859fa8f4f8923be8e5c0d687bf72a170412f68ff12a3c61ba24"}},{"ruleId":"D2","level":"warning","message":{"text":"connect (cognitive 44): connect has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (17 pts), error handling 9 (15 pts), boolean chains 10, other 1, ternaries 1 (nesting depth added 9). Most of this is not in the body itself: 10 of the 44 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 639, 664, 601, \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":"extension/sidepanel-terminal.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f401faa2693781a3d1c7cb3fec2d728dab5995671b71bc4e077c8a72e0c149"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.redactCommandArgs (cognitive 43): audit.redactCommandArgs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (28 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/audit.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bc5857643611f3662a74bb32e17e989ffe3dd88147341082537539be7809fe"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.handlePairAgent (cognitive 43): cli.handlePairAgent has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 10, error handling 4 (9 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"337f4c9808b0e99f6307328f82d3b9acf6b7c55313f5194584cc80e2af680663"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent.main (cognitive 43): terminal-agent.main has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 10, loops 6 (8 pts), error handling 2 (3 pts), ternaries 1 (nesting depth added 9). 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":"browse/src/terminal-agent.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eb0607dda28329c8146a943c7500e9b33206838381b84a00fea6a586aae03c"}},{"ruleId":"D2","level":"warning","message":{"text":"spend-ledger.withFileLock (cognitive 43): spend-ledger.withFileLock has cognitive complexity 43 (threshold 15). Drivers by points: error handling 7 (22 pts), if/else 5 (16 pts), boolean chains 4, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e097b704c181ea6bb922b73561d5f8e004c87b1ee2fa5f7e24f1487718f159"}},{"ruleId":"D2","level":"warning","message":{"text":"captain-brief.renderCaptainBrief (cognitive 43): captain-brief.renderCaptainBrief has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 19 (27 pts), if/else 8 (9 pts), boolean chains 7 (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 16 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":"lib/captain-brief.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaaf1df79f5c622dd87b256626584896bace085459acbbd21615c95e9ac2f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.withRunLock (cognitive 43): autoplan-run.withRunLock has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 6 (17 pts), ternaries 1 (4 pts), boolean chains 3, 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":"lib/autoplan-run.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"752deb5e967fa51c1c40c110b1e70c66db8ae08a716a932ba3e4d67352b069d0"}},{"ruleId":"D2","level":"warning","message":{"text":"context.buildContext (cognitive 43): context.buildContext has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 10 (15 pts), boolean chains 7, 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":"lib/pregate/context.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168e6ff7e5a59eb25d101fc2b13f5d5bba847702161a5bb7d164c52a709223f"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.referencesIn (cognitive 43): import-graph.referencesIn has cognitive complexity 43 (threshold 15). Drivers by points: loops 14 (27 pts), if/else 7 (9 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43ae900eb10fed5a32502de85833626d7cdd98829efdf652e18aca038871e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.newTrain (cognitive 43): ship-queue-train.newTrain has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 13, if/else 12 (13 pts), loops 1 (nesting depth added 3). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d093b374988cb0bf1d458f34935efcc8b09ded1c75d0c3c05a70673b578d79"}},{"ruleId":"D2","level":"warning","message":{"text":"release-gate.runGate (cognitive 43): release-gate.runGate has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 11, ternaries 8, error handling 1 (nesting depth added 3). Of this number, 37 points are the body\u0027s own statements and 6 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a0195806a52840be71b5590d1f48a077beddc0a1108050ddc3ac217b57ff4c"}},{"ruleId":"D2","level":"warning","message":{"text":"regate.evaluateRegate (cognitive 43): regate.evaluateRegate has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 5 (11 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/regate.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"43736861e999efe40bc2da06d2b1c7cb1835f964e6dec6546a92e2391a865a13"}},{"ruleId":"D2","level":"warning","message":{"text":"retro-friction.frictionBySkill (cognitive 43): retro-friction.frictionBySkill has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 5 (10 pts), boolean chains 9, loops 4 (nesting depth added 14). Of this number, 41 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":"lib/retro-friction.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"121c6f51a4041cb4285414d7b1d394840bd828d8ba3c1e5bd935493a1b17d732"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-engine.redactJsonFindingSpans (cognitive 42): redact-engine.redactJsonFindingSpans has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 4 (9 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":"lib/redact-engine.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7c0791838624ecb59eeb08add9180fc53c7c899111bac6b21437df9e765fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.restoreState (cognitive 42): BrowserManager.restoreState has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (23 pts), error handling 3 (9 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 22). Of this number, 28 points are the body\u0027s own statements and 14 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":"browse/src/browser-manager.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12f50209caa32fc090d012846447c9c40e7dd5c98f4050565777403beb569a0"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.buildGraph (cognitive 42): import-graph.buildGraph has cognitive complexity 42 (threshold 15). Drivers by points: loops 13 (21 pts), if/else 6 (12 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 17). 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, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d49613f004ce2e03c8ac8ea78c1b1a7f6faa005d5585f00fada99039489b6d2"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-record.resolveApproved (cognitive 42): plan-record.resolveApproved has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 10 (22 pts), if/else 12 (17 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b013a5d28166b73541ed39fe8a116653ad0f4087e61d14fb8286d19b103c68da"}},{"ruleId":"D2","level":"warning","message":{"text":"review-collect.readDiff (cognitive 42): review-collect.readDiff has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 8, loops 3, ternaries 1 (nesting depth added 17). Of this number, 40 points are the body\u0027s own statements and 2 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":"lib/review-collect.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e1b85a62f26c54cc07b77d868f16e2107717d5f405b4931aa8a41f1656360"}},{"ruleId":"D2","level":"warning","message":{"text":"release-gate.bisectRecord (cognitive 42): release-gate.bisectRecord has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc7c6453ec5dc76eb5c16fd76d9ba85b0e106c935346a471134c14b31a90efb"}},{"ruleId":"D2","level":"warning","message":{"text":"witness.testExecutionSummary (cognitive 42): witness.testExecutionSummary has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 24, if/else 13 (14 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 2). Of this number, 34 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c9964836a81475ff932e55b60335275e8c9a72fc3ddb0457d29f5a5196985a"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-supabase-provision.apiCall (cognitive 42): gbrain-supabase-provision.apiCall has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (23 pts), error handling 5 (11 pts), ternaries 2 (4 pts), boolean chains 3, 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":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef94810c14bb77745aa5b1d6b8e470cdebc92c992c6a65d187d8303792cc81ad"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.promoteToHeaded (cognitive 41): BrowserManager.promoteToHeaded has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (27 pts), error handling 4 (5 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 11). Of this number, 39 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":"browse/src/browser-manager.ts"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfed1f84951b43c6567f4e16cf250b0418cd569f3a8766110f4ded4957ab579"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.gateAhead (cognitive 41): restamp.gateAhead has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 3 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"f365d470f643bb6f731bc59714956d325925a1580d5e90202c23bd70590a4b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-export.runLog (cognitive 41): autoplan-export.runLog has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 16 (29 pts), if/else 5 (8 pts), boolean chains 2, loops 2 (nesting depth added 16). Of this number, 33 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":"lib/autoplan-export.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"550c29d1691c37d25036f4c7f5ee6bd4b7e08150bd380885f177a4230f57370d"}},{"ruleId":"D2","level":"warning","message":{"text":"outside-review-result.classifyOutsideReview (cognitive 41): outside-review-result.classifyOutsideReview has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 13, ternaries 9 (12 pts) (nesting depth added 7). Of this number, 35 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-review-result.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f304a62c8a1b54472a65ef88b55d2ad15982f26c886345b96d831b704d4c6aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher.emitBots (cognitive 41): Watcher.emitBots has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 6 (13 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 19). Of this number, 39 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":"lib/pr-wait.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e686bb81a4928e28e40e46f74944d03cfa6abb0c667b9094124b0470282ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-init.trainDoctor (cognitive 41): ship-queue-train-init.trainDoctor has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 5 (11 pts), loops 3 (6 pts), boolean chains 2, error handling 1 (nesting depth added 19). 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":"crew/lib/ship-queue-train-init.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece19abfbdf94037b5114b94000e00f7a1e50c63540f74e6ab16e5cf78d6eaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerVerificationExecutor.observe (cognitive 41): DockerVerificationExecutor.observe has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 7, loops 3 (4 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 9). Of this number, 40 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":"lib/cso/verification.ts"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9891c1fab6769d4179b6e11e09052548bfd21555db30bbce618ca0a96fb197"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-shots.paneRows (cognitive 41): pr-shots.paneRows has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 9 (24 pts), if/else 6 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 20). Of this number, 40 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b534ba216b7ddae35e9a3f3bc42c5ed878ee16db1a6c9005169fb89e1b73b0"}},{"ruleId":"D2","level":"warning","message":{"text":"diagram-prepass.inlineLocalImages (cognitive 41): diagram-prepass.inlineLocalImages has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (32 pts), ternaries 3 (4 pts), boolean chains 3, error handling 2 (nesting depth added 11). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 563, 679, 693). 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":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b352d9fc90c22e9d1668640b610f8f57fb941f4a38d5f1a7f741646c725e19"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy.trainErrors (cognitive 40): ship-policy.trainErrors has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 6 (14 pts), boolean chains 8, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe5649c58f5388c579276496ae2471d5f50a98ec8dfc567a8c9d9b82b0ec151"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-gbrain-sync.main (cognitive 40): gstack-gbrain-sync.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (27 pts), ternaries 3 (6 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 12). Of this number, 37 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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8343c53c5c3991cc45826e70af2eca3feea4c45e29567a052a1366ccd1eb4676"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.initRun (cognitive 40): autoplan-run.initRun has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 20 (22 pts), if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 6). Of this number, 37 points are the body\u0027s own statements and 3 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":"lib/autoplan-run.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f094a0ba4d69d543a9cd9286dcde641df06a5db4a71bd5b33af73e01ea3584"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.submitResult (cognitive 40): autoplan-run.submitResult has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (24 pts), boolean chains 8, ternaries 6 (8 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"024489fe1bd0c956ae760ad4d75b2be10872bb8c3bfdf1234fcdc185522bc8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"stamp-only.jsonDiff (cognitive 40): stamp-only.jsonDiff has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 5 (10 pts), boolean chains 5 (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":"lib/pregate/stamp-only.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d0ec89a2a9fcafd86a93d62b64bd2ab4b770c8f67bd88b5ae38da6031b06c"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-wait.parsePrWaitArgs (cognitive 40): pr-wait.parsePrWaitArgs has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"121bc9d9dda7efe6f17fc5ababda970b7f009370f300a67e09163f30cc23b200"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runSetup (cognitive 40): cli.runSetup has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 9 (22 pts), if/else 10 (13 pts), boolean chains 4, 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":"design/src/cli.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7c77ee8921b86ef91d639ce2ada01f76fbac9905355545422a386a3ae5eb69"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.contextBillMain (cognitive 40): context-bill.contextBillMain has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28 (38 pts), loops 5 (13 pts), ternaries 8 (11 pts), boolean chains 3, error handling 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. This shape REPEATS in the file: one other method here (context-bill.contextBillMain::exactFor) 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":"lib/context-bill.ts"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9088f3a31b8e802c90ac12a8b89d8f67c78b32a0da8f1b27c540d4edae5403c8"}},{"ruleId":"D2","level":"warning","message":{"text":"state.recoverDeadLease (cognitive 40): state.recoverDeadLease has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (27 pts), error handling 3 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35612e951f746da01a4ee4e6bae3d7d88439fa5117d5255189a24034afefe40"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.guardOutput (cognitive 39): phase-publication-hook.guardOutput has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, ternaries 1 (3 pts), error handling 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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f53c0f112655b1a1e7ce6f0809e2aa0ae30bf7e39cd64752b3742671bc8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"motion-capture.parseCaptureArgs (cognitive 39): motion-capture.parseCaptureArgs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 11, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/motion-capture.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa9e6873cca77568f873167d93a0657faf0062a3fdc289cfa3027cd06b70ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.runStages (cognitive 39): restamp.runStages has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 6 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). Of this number, 37 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":"lib/restamp.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1c0f45b56c0bda35a6596b72b414bd90c97a8c89160810da066d62f7ff4030"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-list.validateGateList (cognitive 39): gate-list.validateGateList has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 10, loops 1 (3 pts) (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 18 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":"lib/gate-list.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b5d57f5bec68b1bba7093db13c8788ac68613d9e611d017c19aa9d3d3f3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-reconcile.parseFences (cognitive 39): autoplan-reconcile.parseFences has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 17). Most of this is not in the body itself: 1 of the 39 points is its own statement and the rest belongs to one function literal inside it that branches (line 74). 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":"lib/autoplan-reconcile.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d6f810a13ff797df93a3ce33db56414b24bb9f624ff0cb5df7152f0a38c157"}},{"ruleId":"D2","level":"warning","message":{"text":"workflows.commandTestFiles (cognitive 39): workflows.commandTestFiles has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (10 pts), ternaries 2 (7 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":"lib/pregate/workflows.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7058f8c32169e52b731ac67096d73b9b75c428f713b8aa528fe3fca65ad6d327"}},{"ruleId":"D2","level":"warning","message":{"text":"tunnel-bootstrap.bootstrapTunnel (cognitive 39): tunnel-bootstrap.bootstrapTunnel has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 4, error handling 2 (3 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 13). Of this number, 30 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":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07898a820e9b38a4c5b9e40704ebab65adc30b7750f2b6ab3a9b1c98b930b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"state.chooseRunLeaseTicket (cognitive 39): state.chooseRunLeaseTicket has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf6858be8a6b44d1557bc8e40766e323abec7edbe1634349a65ea7c05dbc830"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-executor.executeScanner (cognitive 39): scanner-executor.executeScanner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (23 pts), error handling 4 (7 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"796c77fd66095d2b85d886a4fd6b7fe5856674863fdd624e664a9efae4ae94de"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.start (cognitive 39): cli.start has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 9 (21 pts), if/else 6 (8 pts), boolean chains 5, error handling 3 (5 pts) (nesting depth added 16). Of this number, 35 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":"lib/cso/cli.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"858925c273bb2d426ffac1b2b3b827ddcd35ddf21ae11979e4454a6436c133fd"}},{"ruleId":"D2","level":"warning","message":{"text":"dx-error-capture.parseArgs (cognitive 39): dx-error-capture.parseArgs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 4 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"191f73bc39b70f83285c4d1423384948d87aa69742f74d5636022341dae25edf"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.splitSections (cognitive 39): gstack-post.splitSections has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 9, ternaries 3 (4 pts), loops 1 (nesting depth added 11). Of this number, 37 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":"lib/gstack-post.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd55f73635e4c885e45d0ae81d065d72de0650837277367ae836d724c6f11a5"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-evidence.qaEvidenceMain (cognitive 39): qa-evidence.qaEvidenceMain has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 7 (12 pts), boolean chains 10, error handling 2 (3 pts) (nesting depth added 9). None of this is in the body itself: all 39 points belong to 2 function literals inside it that branch (lines 426, 424). 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":"lib/qa-evidence.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02e6c202ef20c65e3a2acf6e547dc10f9b6968e56c2bc314ab44c568c5a3f65"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.push (cognitive 39): ship-release.push has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 6 (9 pts), boolean chains 8, error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3f6e0c38c782faf11e38c2961ebfddbe6177c870a19083c7989b0e8ad38a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-gbrain-read-capability.readCapability (cognitive 38): gstack-gbrain-read-capability.readCapability has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 12, error handling 4, ternaries 2 (3 pts) (nesting depth added 2). Of this number, 36 points are the body\u0027s own statements and 2 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":"bin/gstack-gbrain-read-capability.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8bcbb918aa70d4ecd413be8d7a20f9a5de9c15d38c2799571241ba81a3c35c"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.wirePageEvents (cognitive 38): BrowserManager.wirePageEvents has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (5 pts), ternaries 3 (5 pts), boolean chains 4, error handling 2 (nesting depth added 13). None of this is in the body itself: all 38 points belong to 5 function literals inside it that branch (lines 2429, 2451, 2464, \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":"browse/src/browser-manager.ts"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc830e38daecc51ec43b9f83abbcdd919ff721db52d84817997127247d05f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-gate.evaluateChecks (cognitive 38): ci-gate.evaluateChecks has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 8 (14 pts), boolean chains 6, loops 4 (nesting depth added 9). Of this number, 33 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":"lib/ci-gate.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3f8150664a495fe7d602158ddd0c79ae1d67c9c0b69c1c8d4ce41f614039df"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-list.parseReply (cognitive 38): gate-list.parseReply has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 5 (9 pts), boolean chains 6, loops 2 (nesting depth added 8). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-list.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"140bc41f474f4843133809e93d417e5a7356ebf5cd3f3210ed4ff924dd17f7fc"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.launchRuntime (cognitive 38): runtime.launchRuntime has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 19). Of this number, 35 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":"lib/pregate/runtime.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1184c52cedc1c5e378dd9e3626c1dd27a4e7db3e0a670af7dcc7ca07e460c9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land.census (cognitive 38): ship-queue-land.census has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 12 (26 pts), boolean chains 4, if/else 3 (4 pts), loops 2 (3 pts), error handling 1 (nesting depth added 16). Of this number, 37 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":"lib/ship-queue-land.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"731ebe2ecda980b0f6ab0db1c33214620dfcf32cb00631b7b4215760c2f2a981"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.buildTrain (cognitive 38): ship-queue-train.buildTrain has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 5, ternaries 2 (5 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf5db7434bbe648b927c9523a01d07fb65882f309b406696cfcf4224f304a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-dispatch-ci.dispatchCi (cognitive 38): ship-queue-dispatch-ci.dispatchCi has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 2 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 16). Of this number, 37 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":"crew/lib/ship-queue-dispatch-ci.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f4c65f10ed9a2494818d7bf5dfd1650ba14f2ab2caeb806c544b24026b6e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"scanners.parseScannerOutput (cognitive 38): scanners.parseScannerOutput has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 9, ternaries 3 (4 pts), loops 1 (2 pts), error handling 1 (nesting depth added 5). Of this number, 34 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bc661f8d423c4a684fc7aa7d491af043889c60d26f4bcb6a64eab070b6a757"}},{"ruleId":"D2","level":"warning","message":{"text":"regate.migrationReport (cognitive 38): regate.migrationReport has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (21 pts), ternaries 5 (7 pts), loops 4 (5 pts), boolean chains 4, error handling 1 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 8 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":"lib/pregate/regate.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a037d1e1ed6f7d3354845c97ab4f3085346e8c73482fa5a6151a30eb1c040cc"}},{"ruleId":"D2","level":"warning","message":{"text":"review-bots.fetch (cognitive 38): review-bots.fetch has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 5 (9 pts), loops 6, boolean chains 5 (nesting depth added 10). Of this number, 36 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":"lib/review-bots.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"394482fe46728b9e9a40225a71904a76cce6976bde251ea4aeb7c6a50bcba542"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.decide (cognitive 38): ship-budget-cli.decide has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 12 (24 pts), boolean chains 7, if/else 7 (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":"lib/ship-budget-cli.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a11eafc0cea4909bde048ea18b88c25b3f5bbb81ded19f87dd0d4c7d338cebf"}},{"ruleId":"D2","level":"warning","message":{"text":"openReattachWebSocket (cognitive 38): openReattachWebSocket has cognitive complexity 38 (threshold 15). Drivers by points: error handling 7 (14 pts), if/else 10 (13 pts), boolean chains 7, ternaries 2 (3 pts), other 1 (nesting depth added 11). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 329, 362, 323, \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":"extension/sidepanel-terminal.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be024c0e56397ddaafcdfa544d604a8db6bd0613dff1a30b4a64ed2185c5f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"transcript-consent.readTranscriptConsent (cognitive 37): transcript-consent.readTranscriptConsent has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 6 (10 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/transcript-consent.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c38713e84332b536f46b2e7d7cf6f5f44c76f41afd41090c2758a75c55fc3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"aside-render.renderWithBrowse (cognitive 37): aside-render.renderWithBrowse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (30 pts), ternaries 1 (3 pts), error handling 2, loops 2 (nesting depth added 13). Of this number, 31 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a3f8e9e5233a5f5d72ccad8dd5813afa54d0bc201a2c1e4885f68ade75c94"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-commands.parsePdfArgs (cognitive 37): meta-commands.parsePdfArgs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (31 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0836283ce8e1c03fabb00bf0640f49974cd0257c45abda7e9bca941b87cf768c"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-reconcile.parseRecordFindings (cognitive 37): autoplan-reconcile.parseRecordFindings has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (29 pts), ternaries 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d5f7722e99588b4e5f833d15811ad1abed5bf87158737df8595520814d65cc"}},{"ruleId":"D2","level":"warning","message":{"text":"guards.run (cognitive 37): guards.run has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 10 (19 pts), if/else 11 (15 pts), loops 2, boolean chains 1 (nesting depth added 13). Of this number, 33 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/guards.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a621a1fb74855dbb8190f751803611e0dddb57fac5a695adf180c4b1ad7595"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.stamp (cognitive 37): ship-queue.stamp has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 7, ternaries 3 (4 pts) (nesting depth added 9). Of this number, 34 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":"lib/ship-queue.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b807c99a2e7ac0530f8b72eedaa6965dca5cd773e59ae11c400cf916610c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-wave.wavePlan (cognitive 37): ship-queue-wave.wavePlan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (7 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 13). Of this number, 34 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8bb1a7ec51af349460134ee78cd61798bb204d73e8e749a9574164d1666abc"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-wave.waveMain (cognitive 37): ship-queue-wave.waveMain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 6 (11 pts), boolean chains 9, error handling 1 (nesting depth added 10). Of this number, 33 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86bf493b0cb81a50db017be02fff5ed104c19dc16e24639a9ecc13f0f080796"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.dispatchWorkflows (cognitive 37): ship-queue-train-gate.dispatchWorkflows has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 4 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4b2ec18077372079cb8f059a955b78ae02b871375358baf1b48e613fc6ccc8"}},{"ruleId":"D2","level":"warning","message":{"text":"train-gate.stampFreeTree (cognitive 37): train-gate.stampFreeTree has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 6 (21 pts), if/else 8 (12 pts), error handling 1 (3 pts), loops 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":"crew/scripts/train-gate.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d83f4c6343a53ee825d79f15b9f75a47374f3039ee2ceed256e087ed49c97c0"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.walkMdFiles::walk (cognitive 37): context-bill.walkMdFiles::walk has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 8, error handling 3 (6 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91ceef8ba444be28adb54a3176eca966eb1312dba5eff8297c47f89f185537e"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.inspectNode (cognitive 37): preparation.inspectNode has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 4 (7 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 16). Of this number, 29 points are the body\u0027s own statements and 8 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":"lib/cso/preparation.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a845208267d1dd7760ffb7b78d34f4287db69fbb0237107b6eb961274d49ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-preflight.preflight (cognitive 37): ship-preflight.preflight has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 11, ternaries 5 (11 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":"lib/ship-preflight.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b36e89e0523eec17b1c0abd0956b62bed429b60bdff2b5db3634aa82ffa7724"}},{"ruleId":"D2","level":"warning","message":{"text":"index.Deno.serve() (cognitive 37): index.Deno.serve() has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 10 (19 pts), if/else 9 (13 pts), boolean chains 2, loops 2, 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":"supabase/functions/telemetry-ingest/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"05157c988a33423ce67cbc2c1aa4fbc6ebaaf97ab13375253eb8ff6d07a2ebbe"}},{"ruleId":"D2","level":"warning","message":{"text":"ObservableClassVisitor.visit (cognitive 37): ObservableClassVisitor.visit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a5fd551dee8a68a2c5cc9cbaa5103544e3c88aa05437414906b844682273f"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-owned-journal.scan (cognitive 36): claude-owned-journal.scan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 10, ternaries 3 (10 pts), loops 4 (7 pts), error handling 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (claude-owned-journal.scan::record) 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":"lib/claude-owned-journal.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2722fd751000e236bac638a64d58b2eb1032b286c283222747912d426decf"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-engine.jsonTokens (cognitive 36): redact-engine.jsonTokens has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 3 (6 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":"lib/redact-engine.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc56f656870340874cda8d80a62b74de60e4c2e89042c2de2809ffacb781f108"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-local-status.hasRemoteOnlyGbrainMcp (cognitive 36): gbrain-local-status.hasRemoteOnlyGbrainMcp has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 9, loops 3 (4 pts), error handling 1 (nesting depth added 13). Of this number, 26 points are the body\u0027s own statements and 10 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":"lib/gbrain-local-status.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b4614bbf645db456d87e262ba32413426392dd1c0d961ceff448a6e2a18d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.probeMode (cognitive 36): gstack-memory-ingest.probeMode has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 16). 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0745e62562516c586f60148d25e44a452004c2ec64e8b08f6a362560ae8552"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.admitTranscriptSource (cognitive 36): gstack-memory-ingest.admitTranscriptSource has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 8, ternaries 3 (7 pts), loops 1 (2 pts) (nesting depth added 12). Of this number, 34 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d45c5899edfac7cc48d3797fb32d6d0523c02698d3456762ce0362f0d2f332"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-native.importNativeCookies (cognitive 36): cookie-import-native.importNativeCookies has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15, boolean chains 9, error handling 6, ternaries 3 (6 pts) (nesting depth added 3). Of this number, 27 points are the body\u0027s own statements and 9 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"004429c505497b47f30036fe5b0b50aeaa57a22309b143f05aced40e2aa16912"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.depSpecs (cognitive 36): rust.depSpecs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 4 (11 pts), loops 5 (10 pts), boolean chains 4 (nesting depth added 19). 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":"lib/pregate/rust.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"87397de4a9c9ce2cc8c27994bbf138d1ed386cf6a1778445bb263c4edd656d84"}},{"ruleId":"D2","level":"warning","message":{"text":"doc-links.brokenLinks (cognitive 36): doc-links.brokenLinks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 19). Most of this is not in the body itself: 3 of the 36 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 50, anchorsAt). 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":"lib/doc-links.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1104830fe3f44bd4341a1bccc247c16e29e87f0b02d2ce3c95c9ee7733d431"}},{"ruleId":"D2","level":"warning","message":{"text":"review-secret-excerpt.hits (cognitive 36): review-secret-excerpt.hits has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 7 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 18). 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":"lib/review-secret-excerpt.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"02617b33a4e70f5ce0bee6689b458ad394c90563cbe7a2350ee1b23c4673664f"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.parseReviewLoopException (cognitive 36): ship-receipt-depth.parseReviewLoopException has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 7, loops 4 (5 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7703b558cdc51040613e6858e76a851469e6a03a08633e595fe2c3861aa4c570"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost-replay.parseArgs (cognitive 36): gate-cost-replay.parseArgs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 6, loops 1 (nesting depth added 5). Of this number, 34 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":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"839faab7ec95d3718e446f1e45542af6fcd4af866052b664a047bd84169a89c6"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon.fetchHandler (cognitive 36): daemon.fetchHandler has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 12 (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":"design/src/daemon.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe874746ebb7939ab34d3d5f94dd4503eedb8876afb3bd750fef7e3e0a45816"}},{"ruleId":"D2","level":"warning","message":{"text":"model-policy.readModelPolicyConfig (cognitive 36): model-policy.readModelPolicyConfig has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (18 pts), ternaries 3 (9 pts), error handling 2 (5 pts), loops 1 (3 pts), boolean chains 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":"lib/model-policy.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f299634fca8324aacf4cc68313ac08b50349634411a947de84077b0cf65669d4"}},{"ruleId":"D2","level":"warning","message":{"text":"contracts.renderReport (cognitive 36): contracts.renderReport has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 24 (32 pts), boolean chains 4 (nesting depth added 8). Of this number, 27 points are the body\u0027s own statements and 9 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea020e6b98d8a330c24e7fc84f15497353b37f56534702f8ca273f1e13a77d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.canonicalTestPlan (cognitive 36): verification.canonicalTestPlan has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (12 pts), ternaries 4 (8 pts), error handling 1 (2 pts) (nesting depth added 8). Of this number, 26 points are the body\u0027s own statements and 10 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":"lib/cso/verification.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7334befd0ce17accc51e9ed2dcf8d92854c0655954b9b2482d2650874e183572"}},{"ruleId":"D2","level":"warning","message":{"text":"junit.parseXml (cognitive 36): junit.parseXml has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/junit.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6073fea109b1d7967cbb96d18651c5a2406911585b9d8ed27fa0a70cdcc22d3"}},{"ruleId":"D2","level":"warning","message":{"text":"quarantine.entryProblems (cognitive 36): quarantine.entryProblems has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 9, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddae6241bef0be34554abed81af39c77d99bc45d1a2efaee289a754878fcac5a"}},{"ruleId":"D2","level":"warning","message":{"text":"review-evidence.sharedLibsSnapshotCoverage (cognitive 36): review-evidence.sharedLibsSnapshotCoverage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 11, error handling 2, loops 2, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 36 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 93, git, a function literal at line 83). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd345137cbd16839946b2c09a78aa906f54ebca1521ff0af500fefe91f25c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-preflight.integrate (cognitive 36): ship-preflight.integrate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 8, 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":"lib/ship-preflight.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be05ed18896b80b0852b3010ce10f61b930959cfaa4bf1986826005feaf2c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"git.sectionToFile (cognitive 35): git.sectionToFile has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 9, ternaries 3, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4b3f39a7b9aea5879781af3d5642c0d40f5497f4ff2f579242b43fd726a5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"config.allowlistErrors (cognitive 35): config.allowlistErrors has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 6, ternaries 2 (5 pts), error handling 1 (3 pts), loops 1 (nesting depth added 10). Most of this is not in the body itself: 2 of the 35 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 170, 180). 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":"lib/pregate/config.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdf2a641720126f311d9ee3b78057468fe8a2c45831e032c35bb4d93cd3379f"}},{"ruleId":"D2","level":"warning","message":{"text":"banned-terms.validateBannedTerms (cognitive 35): banned-terms.validateBannedTerms has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, ternaries 2 (5 pts), loops 2 (4 pts) (nesting depth added 14). Most of this is not in the body itself: 11 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 64). 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":"lib/banned-terms.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"39042e0c0f76a9c496d3756b3c1ef8c3c9966b19b8525fcab784d9ce10fb44ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.parseTestRecord (cognitive 35): ship-queue-train-gate.parseTestRecord has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (7 pts), error handling 1 (3 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"22621d2a70cc6cd1d778f37829d682fb88b92a0c01c850e07a520229959fae2c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.scanCandidate (cognitive 35): index.scanCandidate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf93f87d088ad9c46909a9a39657fd0053ee9eeb8ad019d0ceca1b31a0bdb9"}},{"ruleId":"D2","level":"warning","message":{"text":"docker.dockerEndpoint (cognitive 35): docker.dockerEndpoint has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, error handling 3 (4 pts), ternaries 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":"lib/cso/docker.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb757486312ff8fcb892eb94645799e3e5b50044b88e232ecf944f83b24c1d43"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-models.parseEvalModels (cognitive 35): eval-models.parseEvalModels has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 4 (7 pts), loops 5 (6 pts), boolean chains 3, error handling 1 (nesting depth added 11). 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":"lib/eval-models.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a5fdfb3451567873a06b0d57d72f21fcb8de5a0e726b4a248be13082998afd"}},{"ruleId":"D2","level":"warning","message":{"text":"review-ledger.judge (cognitive 35): review-ledger.judge has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, ternaries 2 (5 pts), loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d9aedf0a2f6e88b61043913ca6a8717d011f71eba8fa8a725d51e4d8d857ae"}},{"ruleId":"D2","level":"warning","message":{"text":"git.resolveBase (cognitive 34): git.resolveBase has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 9). Of this number, 23 points are the body\u0027s own statements and 11 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":"lib/gate-diff/git.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a667497a58d4d1c53bd05a4da9eb46db9a24d9e728765a3defc76331ef292d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.genericVerdict (cognitive 34): ship-queue-train-gate.genericVerdict has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 8 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1d43cd5b755245b277a735b36e0dabd0e3d85982d3c241259f5cad628d1d97"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-verify.verifyTrain (cognitive 34): ship-queue-train-verify.verifyTrain has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (21 pts), ternaries 8 (10 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf0cfb1d7d3e8bb2e7b0a323007402883282917292fbb6c154d533e3d42787d"}},{"ruleId":"D2","level":"warning","message":{"text":"background.chrome.runtime.onMessage.addListener() (cognitive 34): background.chrome.runtime.onMessage.addListener() has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 22 points are the body\u0027s own statements and 12 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6d5aa104868baa87ccce1ddfc792095b1c4b97464e7b499ed33a977cf9eae0"}},{"ruleId":"D2","level":"warning","message":{"text":"process.git (cognitive 34): process.git has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (30 pts), boolean chains 3, if/else 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":"lib/cso/process.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb2275d2bf0704ddb976eb7502c84bc4f0092011e094688e6b9ecd6063a4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"admission.acquireClaim (cognitive 34): admission.acquireClaim has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 4 (9 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 16). Of this number, 26 points are the body\u0027s own statements and 8 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":"lib/cso/admission.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"512be06ace6b96571535f639521326a7478def1c0ca2500e7246ed83b7c5552a"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.pythonFieldEnd (cognitive 33): redact-patterns.pythonFieldEnd has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5fa1c3ccac278c705114c504ba10b908f9e9d7a183d6ce2dec02b0e4b4580f"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.importBatch (cognitive 33): gstack-memory-ingest.importBatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7, loops 1 (3 pts), ternaries 1 (3 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2539599b303e3c03b8e8964264490c017577965a311550a15cc36425435330"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-native-job.createNativeCookieJob (cognitive 33): cookie-import-native-job.createNativeCookieJob has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 4, error handling 2 (3 pts), loops 3, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 29 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-job.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9965792852914443ca32fddaa11a7b100a8390b5efb7115ed5d89a6ee2442f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-lean.captureDraft (cognitive 33): autoplan-lean.captureDraft has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 9 (13 pts), boolean chains 5, loops 2 (nesting depth added 7). Of this number, 23 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":"lib/autoplan-lean.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb7090ba526c666381c6717e6c34e2e7f9a989ec1d4b47120c43c4193c3c62c"}},{"ruleId":"D2","level":"warning","message":{"text":"headless-artifacts.checkPhases (cognitive 33): headless-artifacts.checkPhases has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9ea873f2027b61bfd4ccd53ab8934a96e7dc1610eba58b2a099a66f73b8ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-reuse.ownDiffSignature (cognitive 33): gate-reuse.ownDiffSignature has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 4 (5 pts), boolean chains 4, loops 2 (4 pts), error handling 2 (nesting depth added 9). Of this number, 22 points are the body\u0027s own statements and 11 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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1fd50fe0bd053e92956b35c56bcb9627f2c28e7b8ce5356bd6f0839af71c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-post-merge.verifyPostMerge (cognitive 33): ship-queue-post-merge.verifyPostMerge has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 9, if/else 4 (8 pts), loops 1 (nesting depth added 14). Of this number, 28 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-post-merge.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2d39d984033c1e5532c8cdb538a682dd17cdb566d04c82316288edf863b409"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-stop-gate.checkRun (cognitive 33): autoplan-stop-gate.checkRun has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, ternaries 3 (4 pts), loops 3 (nesting depth added 10). Of this number, 31 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":"lib/autoplan-stop-gate.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f0c2de1fdf927b2604accef22070d381aa9116768b498a8e714bf596f16efd"}},{"ruleId":"D2","level":"warning","message":{"text":"timeline-stop-hook.repairTimeline (cognitive 33): timeline-stop-hook.repairTimeline has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 4 (6 pts), error handling 4 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 11). Of this number, 31 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":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2107f2d6250c40746e8b19538b787d669503b6b60e3117c5707361bed46efff4"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-code.runClaudeCode (cognitive 33): claude-code.runClaudeCode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 10, error handling 2 (3 pts), ternaries 1 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 16 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c8240e03376d71292d2236b36d8d79e3aa8330767baffb0e8fba73f9abc213"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.replay (cognitive 33): cli.replay has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 7, ternaries 2 (3 pts), error handling 1 (nesting depth added 5). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2615, 2626). 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":"lib/cso/cli.ts"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"281692600a85f9464228d3854313a5220b455fb829a1111a49acbf1a953348b3"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-deadline.runQaDeadlineCommand (cognitive 33): qa-deadline.runQaDeadlineCommand has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (19 pts), error handling 3 (6 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 33 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 159, 148, 169, \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":"lib/qa-deadline.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"987f8cf9f1169121453cf2d13aca49a136dfc25caeab7c7fe64d4c75b6a2159a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.Deno.serve() (cognitive 33): index.Deno.serve() has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 3, error handling 2, 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":"supabase/functions/community-pulse/index.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da15bffc53e7f64519a504da585612dbc016ca3a3db932b3279f12c4b9a0057"}},{"ruleId":"D2","level":"warning","message":{"text":"land-merged-checks.runMergedChecks (cognitive 32): land-merged-checks.runMergedChecks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 6 (9 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/land-merged-checks.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18c0c428b2f0263b66b433449214d802f326de6d2fe1b1f3197c16b04f25aba"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-gbrain-sync.runDream (cognitive 32): gstack-gbrain-sync.runDream has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 11, boolean chains 3, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7d33b484ee324f8c2cc4fefc7fbaaf278fdbfa90afa7d7c4347d7faabe8947"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-pins.collectPins (cognitive 32): runtime-pins.collectPins has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 14). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e603d8f803c752211ad4029ad074a8b637c62b9041d9e535cc4efb01044ad37"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-commands.parseScreenshotArgs (cognitive 32): meta-commands.parseScreenshotArgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 11). Of this number, 30 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":"browse/src/meta-commands.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73c368cf8c5ac29950b69ff94145a336d297baeac39bd4262654d4f40022455"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost.simulateTrains (cognitive 32): gate-cost.simulateTrains has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 pts), boolean chains 3, ternaries 2 (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"da513498d22a57c76f58e9d63b01ec738a84cf33f3e8147d2cef1aba61edf989"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.rustEdges (cognitive 32): rust.rustEdges has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 5 (11 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 16). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7193917a3a2ef17be0013de90953ab692172e2b09264b96612cd30b18bfa0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"init-draft.draftConfig (cognitive 32): init-draft.draftConfig has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 5 (10 pts), boolean chains 4, loops 2 (nesting depth added 15). 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, 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":"lib/pregate/init-draft.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fde4268c4968a6871e4561ede670ad5af30ae8d2688cb1cbcdd8e81be9e731"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-gate.recomputeMergeTree (cognitive 32): ship-queue-gate.recomputeMergeTree has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, ternaries 2 (4 pts), loops 3 (nesting depth added 11). Of this number, 27 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":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c05e18f2f2f92ad46beb1965e696244529052f63a6ddf9e413d4111409397b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-wave.groupWaves (cognitive 32): ship-queue-wave.groupWaves has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 8 (11 pts), boolean chains 3 (nesting depth added 13). Of this number, 25 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"364a31c02c2dc00c50961d4801ad63db022f80ecce46a6f64153e8e2f2c46228"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-verdict.trainVerdict (cognitive 32): ship-queue-train-verdict.trainVerdict has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 7 (13 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec16f2e6ef472f8cf49c8c0205169f0fa6bae38c6052796dd68a0a7323415bb"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost-replay.readGateRecord (cognitive 32): gate-cost-replay.readGateRecord has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 pts), ternaries 2 (5 pts), error handling 1 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc92ca3d83a36f7bba76c8ad774a60c6c467ec588b26f61c8d0677bb95434562"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-public.exportPublic (cognitive 32): autoplan-public.exportPublic has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, ternaries 3 (6 pts), error handling 1 (2 pts), loops 2 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 13 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":"lib/autoplan-public.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20dbedf022d92b2afb1f6431840ddd0b22502ee8ed2d103cc95e9735655a84f"}},{"ruleId":"D2","level":"warning","message":{"text":"quarantine.quarantineMain (cognitive 32): quarantine.quarantineMain has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 6 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd931c578b5302bdf6b275f33486a314490aa7baf76d88410246ee056ebe8a"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-autoplan-snapshot.baselineEditRecords (cognitive 31): gstack-autoplan-snapshot.baselineEditRecords has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b632a8ee50cc01211a61f7dcd80a54d4a881674a1509e336215f206324d64647"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.invocation (cognitive 31): phase-publication-hook.invocation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 8, error handling 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b1f4b727621f96ee04b8dfc60e94a114dbf255b4706c3964f7a881390e8792"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-md.main (cognitive 31): gstack-design-md.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-md.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb5d575bc1456295b300a7155614e4bee913c50279630fe165e6bc64e1087d2"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent-control.reclaimPublicationLock (cognitive 31): terminal-agent-control.reclaimPublicationLock has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 7, 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aea6a6929af6160d3a8db4f7a0e46c19007a1fe9da09d4b6624947251a34e0"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.statusLines (cognitive 31): autoplan-run.statusLines has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 4 (8 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 14). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"9306b5292439b7477f6aa8152b67d646bf7f917c308c25318360eddfcff387e1"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.blankDartComments (cognitive 31): import-graph.blankDartComments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c9e0b5d7aed94b71cb291df5a84af9eac5d58506fe6e92713bf296c17a19e5"}},{"ruleId":"D2","level":"warning","message":{"text":"timing.clockVariables (cognitive 31): timing.clockVariables has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 18). Of this number, 30 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":"lib/pregate/checks/timing.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"858cc78465a98b2fa67fa78a96720f710a0130c4ed675ccccc4de7bd41c31ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-land.landSlot (cognitive 31): ship-queue-train-land.landSlot has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 7 (12 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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2637ff2d217a8ac42d70dba8d0a6c742ac72f9ec4d7b8ed843778453b91f99f"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-owner-words.ownerWords (cognitive 31): autoplan-owner-words.ownerWords has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 10, if/else 3 (5 pts), loops 4, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 7 function items inside it that branch (strings, note, gateText, \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":"lib/autoplan-owner-words.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"320905dd0f481f8fcf91f95c39e6c4515a681c7116e9e0ffa6a93ff155120a10"}},{"ruleId":"D2","level":"warning","message":{"text":"state.boundedRemoveTree (cognitive 31): state.boundedRemoveTree has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b494d4acba87cd452272fc6de52b8799303d4d32b13bada9f54a94f41e921233"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicArchiveCache.cleanIncoming (cognitive 31): PublicArchiveCache.cleanIncoming has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8abda3b4221122800991ff4b5e4b528b59a899323a23fbc201e5f1155bc2c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerPreparationSandboxRunner.prepareOffline (cognitive 31): DockerPreparationSandboxRunner.prepareOffline has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 2 (5 pts), loops 4, boolean chains 1, ternaries 1 (nesting depth added 10). 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5907f768d7e317e70c71264cd731cb0517466dc63a9ebbc43fcffbbc6feb8f75"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.sarifCheckoutRoot (cognitive 31): cli.sarifCheckoutRoot has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (13 pts), error handling 3 (8 pts), loops 3 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3346a7567c84d7786ddace7a80fd5f76d418d100f05f2a088dbc32ae4266e5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-evidence.materialize (cognitive 31): qa-evidence.materialize has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 10, if/else 8 (9 pts), loops 1 (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 4 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":"lib/qa-evidence.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7755867f4e1951fbdf854f23bb64d659e9e9386e471a4b234568b9bc975bcd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.cmdClose (cognitive 31): ship-budget-cli.cmdClose has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 7, if/else 6 (7 pts), loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 8). None of this is in the body itself: all 31 points belong to 3 function literals inside it that branch (lines 350, 355, 364). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c462b84e9ae44da59e5090197a6d61d57fc51062f3dfb71cf59df744b1b99b"}},{"ruleId":"D2","level":"warning","message":{"text":"orchestrator.generate (cognitive 31): orchestrator.generate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (21 pts), ternaries 5 (7 pts), boolean chains 3 (nesting depth added 9). Of this number, 29 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":"make-pdf/src/orchestrator.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5147fd5fe42ca1245ebbfbd00706e271f8ea45f329a434997f5e044481074"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.runLocked (cognitive 30): gstack-memory-ingest.runLocked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1 (nesting depth added 8). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6a5bf1f41d88730b4e3582ba98835a7c388850f426b920a85d1a5aeea45abc"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-global-discover.scanKimiCode (cognitive 30): gstack-global-discover.scanKimiCode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (9 pts), error handling 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-global-discover.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75f9aa0fdbfdd7b3887a6499057ec136398e18bd355c9b61160b27e173e645b"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-pins.evaluatePins (cognitive 30): runtime-pins.evaluatePins has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 5 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da98e9fb1fa0b3256a1bd59d3701630ce7ebc4084838c7a1350d2e878437224"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.startServer (cognitive 30): cli.startServer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, loops 2 (4 pts), error handling 1, ternaries 1 (nesting depth added 8). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb0eb54e6df34b9f00d998c5ad02b43fbbe02a412cf5df978a40c486244d247"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-bundle.verifyBundle (cognitive 30): evidence-bundle.verifyBundle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 4 (9 pts), boolean chains 3, loops 1 (nesting depth added 14). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e76240a12929866ff6254ed476513d7160c53d45450a768caf3359c1444eab"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.planVersions (cognitive 30): restamp.planVersions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 6 (9 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbbe24e16ba611c24e888b0522b0f62c857f7bf5efd1852dbba04577e2161e"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-prompts.detectScope (cognitive 30): autoplan-prompts.detectScope has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 11 (19 pts), boolean chains 11 (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":"lib/autoplan-prompts.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7848339338948bd0e2871bcab2a78d07248304040d6f2a3853c664d1f37dea31"}},{"ruleId":"D2","level":"warning","message":{"text":"timing.boundKind (cognitive 30): timing.boundKind has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb91ffdcfd6f3a5a45ae706cad021669089d715a510bf4e7325856680b179ede"}},{"ruleId":"D2","level":"warning","message":{"text":"timing.scanTiming (cognitive 30): timing.scanTiming has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 14). Of this number, 26 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":"lib/pregate/checks/timing.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d3219c6f3918e2b04f19567c9e343c2551548298505e2fa9b599003f64abe0"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-dispositions.gateAcceptance (cognitive 30): gate-dispositions.gateAcceptance has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (6 pts), ternaries 3 (5 pts), boolean chains 3, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"088369057bb052ce17f6cd61bf6fa2a37cc44b30c8806b7001bcaff28299d214"}},{"ruleId":"D2","level":"warning","message":{"text":"review-exclude.reviewExclude (cognitive 30): review-exclude.reviewExclude has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, loops 5 (6 pts), ternaries 4 (6 pts) (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 5 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":"lib/review-exclude.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5a1f51d8d1d60ca16df42a8f8652265704aa43533da01a77deb5a843d2f97"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-verdict.trainBisect (cognitive 30): ship-queue-train-verdict.trainBisect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 4, loops 3, ternaries 1 (nesting depth added 5). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7f9d52731f503cffba6135a91a94b05a52105ab4df1ff5d7c1cc6cb1be0e39"}},{"ruleId":"D2","level":"warning","message":{"text":"replay-pr-selection.loadInput (cognitive 30): replay-pr-selection.loadInput has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (7 pts), error handling 1 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 13). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a6d0109b07966e46dd80edc6f6e7316f74ddb5bf70624b16a607d05aa775f"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-client.ensureDaemon (cognitive 30): daemon-client.ensureDaemon has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 1 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efe8b5e518e84b427cb9f1fef1e787e6ccc99323379c8923b63c3f639c53080"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-owner-words.ownerIndex (cognitive 30): autoplan-owner-words.ownerIndex has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 3 (10 pts), boolean chains 2 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"017ed174eba42b6b5573891dd42e5ddfac7b78639cc1da6592808096f6de9254"}},{"ruleId":"D2","level":"warning","message":{"text":"process.safeMetadata (cognitive 30): process.safeMetadata has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, if/else 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":"lib/cso/process.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"68222a51fcaea98ef97497927a89b17cfb40929cea11c31c0fcb6fe5441c81b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicArchiveCache.materialize (cognitive 30): PublicArchiveCache.materialize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 4 (10 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 12). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 541). 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":"lib/cso/cache.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c893557ac48a075b47b76403246eb76f856cfc329650dd31cf56460849ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-executor.validatePlan (cognitive 30): preparation-executor.validatePlan has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (12 pts), loops 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"98270e7943d69e98f006b4d3ee7e1c834424abe6def1a28cd7092a7ee2a4e9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"state-matrix.checkMatrix (cognitive 30): state-matrix.checkMatrix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/state-matrix.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4245146c37983c364f717887217588bf879bfe0f7da56aca352a67a3d8c69999"}},{"ruleId":"D2","level":"warning","message":{"text":"review-scope.parseHunks (cognitive 30): review-scope.parseHunks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-scope.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec1d74769c71e9dc82fa20fe841bb9872ded127c6be22353c6714b1e01431ce"}},{"ruleId":"D2","level":"warning","message":{"text":"design-md.tokensFlat (cognitive 29): design-md.tokensFlat has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (6 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"041d1ca26a395f0f0de51ac5523d6d8b15914bd1567b1306f03a4e1b9258f30b"}},{"ruleId":"D2","level":"warning","message":{"text":"transcript-consent.guardUnpublished (cognitive 29): transcript-consent.guardUnpublished has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 2 (3 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":"lib/transcript-consent.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb61604f6ab2fb9aa138395e29136d61995e6a635dd4c6607150b73601c6869"}},{"ruleId":"D2","level":"warning","message":{"text":"aside-render.buildRenderScript (cognitive 29): aside-render.buildRenderScript has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 10). Most of this is not in the body itself: 2 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 236, setOverride, sized). 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":"lib/aside-render.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"739b801b778bca6411814bf46192fae0946cb8b5b89922045031970532289df3"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.filterArgs (cognitive 29): activity.filterArgs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/activity.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33087de04c59f25a19fe30eb2304efa948b2d70ab4147e7a5ed9784e8eceda3"}},{"ruleId":"D2","level":"warning","message":{"text":"headless-artifacts.findCycle (cognitive 29): headless-artifacts.findCycle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (7 pts), loops 4 (nesting depth added 14). Of this number, 16 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":"lib/headless-artifacts.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067f25ed807351fda8780f5a806875f1ec3277ea917d09bdeb584d51028c03b"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-exception.logProblem (cognitive 29): flaky-exception.logProblem has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc2654abeaa623035ddffb8b7f069c94e5ee392a9ccd9b804a70c76f9452e37"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.parseReviewTargeted (cognitive 29): ship-receipt-depth.parseReviewTargeted has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 3 (8 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"36433fcd59a3e82bd3c1c7eb81b61a4266b2f65325a4b0566cbe8dd50955706e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.writeExcludeBinds (cognitive 29): ship-receipt-depth.writeExcludeBinds has cognitive complexity 29 (threshold 15). Drivers by points: if/else 33 (49 pts), ternaries 16 (26 pts), boolean chains 17, loops 9 (11 pts), error handling 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. This shape REPEATS in the file: one other method here (ship-receipt-depth.writeExcludeBinds::bindAudits) 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b660c8b018c9258d26ddb07216b34788b164bfbc91b658297dd8522194e3d716"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.ownChangeSince (cognitive 29): ship-receipt-depth.ownChangeSince has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), ternaries 7, loops 2 (nesting depth added 2). Of this number, 25 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee8e50724de83624de3cfc823ebfc34e8ff8c4d819fd31ec6582ac90187e44a"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-watch.watchGeneric (cognitive 29): ship-queue-train-watch.watchGeneric has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, ternaries 1 (3 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-watch.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"700d8225407ca7bbeaada97f7dbbadcb6005441b092b10d3abd5b86c43863307"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-contract-stop-hook.main (cognitive 29): skill-contract-stop-hook.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 8, error handling 2, ternaries 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":"hosts/claude/hooks/skill-contract-stop-hook.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a1d36a24b3ebdcdebc3d287dc766924f4815fe773a12a957b35a3cfeca0999"}},{"ruleId":"D2","level":"warning","message":{"text":"gen-accessors.snapshotTypeIssue (cognitive 29): gen-accessors.snapshotTypeIssue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7705ae4312ad56d5b42290f5a57410632cc86ffd5480251ca99aeb0070e3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"state.releaseKnownLease (cognitive 29): state.releaseKnownLease has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 12, error handling 3, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a673ef03f4a32c76a4a968c052262a3e4ff17f4f9426c03a9e6c161f30c242"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.directPackageTest (cognitive 29): verification.directPackageTest has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (9 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"376eb2abec95c1ebf4672000888bd0e5f55d0aeecbe5d4bc54bb521bc79e86ca"}},{"ruleId":"D2","level":"warning","message":{"text":"review-ledger.ledgerBlockers (cognitive 29): review-ledger.ledgerBlockers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts), error handling 2 (nesting depth added 13). Of this number, 25 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7dd5023d3d04ce4100d46d5847e77c68465eddf3c92c2dadbc067a7b561fec"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-call-log.countLoggedCalls (cognitive 29): ship-call-log.countLoggedCalls has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 4 (8 pts), boolean chains 7, loops 3 (nesting depth added 8). Of this number, 21 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":"lib/ship-call-log.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac779c9b06b877036edf343de9aef23f3aec0eb5f6555ba87f465973a47c356"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-sidecar.uidSidecars (cognitive 29): ship-sidecar.uidSidecars has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 8, 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":"lib/ship-sidecar.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"430a3970a2bbff944c5af711ba08a0e58102182345d3a707048a8f9b6cd2078d"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.requirePublication (cognitive 28): phase-publication-hook.requirePublication has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 10, loops 2 (3 pts), ternaries 3 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"54882a12bbce1adfbec5b25a03055c1f9d7c7adb961cff5e682d750c4075b6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"chromium-profiles.runProfilesCommand (cognitive 28): chromium-profiles.runProfilesCommand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 3 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/chromium-profiles.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f8aaf6398e994504db725984c35411e66fd6ebc0c7525cec55ffff81041c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"cdp-inspector.formatInspectorResult (cognitive 28): cdp-inspector.formatInspectorResult has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (9 pts), ternaries 5 (9 pts) (nesting depth added 11). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"b505c8cd65776d51c64e6191e1362cc0f138d69d773edc7eeafe7454b713d72d"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.applyToBranch (cognitive 28): restamp.applyToBranch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 10 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":"lib/restamp.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f257861ac4784c2f1d72decb4bd863e94ff552c814a721767a39aaf8fffda5"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-shadow.runShadow (cognitive 28): autoplan-shadow.runShadow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 4 (6 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 10). Of this number, 22 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9824c5f5a671ae09d9079dbcc4ca25cad54643fcf7aebc5d7d87165956ded769"}},{"ruleId":"D2","level":"warning","message":{"text":"lane-selection.removedPath (cognitive 28): lane-selection.removedPath has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, ternaries 4 (5 pts), loops 3 (4 pts) (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc4a93a84cd9671c4914b30cbce3ef11287b6ba1a7e967e287b373884ae1778"}},{"ruleId":"D2","level":"warning","message":{"text":"secrets.addedLines (cognitive 28): secrets.addedLines has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). Of this number, 26 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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d45e3fee07e4468b8def953393e3630f49d0f404aaa0af9fb3102953a0e1a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land-lock.acquireLandLock (cognitive 28): ship-queue-land-lock.acquireLandLock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 4 (5 pts), boolean chains 4 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-land-lock.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"00492b182b05a1689774124afab2504236f9bb7164430faee298a95376fbb7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train.freePhase (cognitive 28): ship-queue-train.freePhase has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 7, if/else 5 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"66739f6c703e4e2c21c436604ac6552ba74f8289c6b1bffb7474834272d06a01"}},{"ruleId":"D2","level":"warning","message":{"text":"serve.serve (cognitive 28): serve.serve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 8, error handling 2, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 10 of the 28 points are its own statements and the rest belongs to 2 function items inside it that branch (handleFeedback, handleReload). 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":"design/src/serve.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"85674a982b5098b825c08d0276ab4d3867c7a816f2f7095e229e0f546d101330"}},{"ruleId":"D2","level":"warning","message":{"text":"shell-writes.shellCommands (cognitive 28): shell-writes.shellCommands has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 10 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":"lib/shell-writes.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8c3f8f173287154041847c94cd07bed22363806f044ee1d1711e58d65ef4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"checks.manifestChecks (cognitive 28): checks.manifestChecks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 7). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b69ccf1ade53f9414536f074c912779ef50363a2d90d51de88e0440ec7aa619"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-code.parseClaudeCodeResult (cognitive 28): claude-code.parseClaudeCodeResult has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, ternaries 3 (4 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":"lib/claude-code.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4961a121506841f3bf21e32915990107d8ba681f28656a57b3fce0929678ccba"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.inspectBun (cognitive 28): preparation.inspectBun has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9de3a96a791ad530b8e4781a06813172ec6dfa71c9f630136a52af5dea1b86"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.download (cognitive 28): preparation-container.download has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 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":"lib/cso/preparation-container.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a2cef1a8800072c507c72018809bb86b771adedc563a6c2e05185663cfcb76"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-catalog.validateScannerCatalog (cognitive 28): scanner-catalog.validateScannerCatalog has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, 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":"lib/cso/scanner-catalog.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5139ca9b1df0ea16b56a9ebda224c37f349cd56f32d98bca67832b8878a47016"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.finish (cognitive 28): cli.finish has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, loops 1 (nesting depth added 10). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 1512, 1546, 1527, \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":"lib/cso/cli.ts"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b07d3c6380c46787d1f6e4da69f1360d2b45d1eb6d3627068e3d2742181002"}},{"ruleId":"D2","level":"warning","message":{"text":"dx-error-capture.release (cognitive 28): dx-error-capture.release has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4, ternaries 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d26a11c04d7106c0de1c9c1eaf4f28c626b35db89893f08d4d3aad37d3ddb2"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.startPilot (cognitive 28): eval-plan.startPilot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (9 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b916d3e9ff516ac937f1e630376ce6b4e030aa9575aa944a9d360be17e082b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land-direct.verifyMerge (cognitive 28): ship-queue-land-direct.verifyMerge has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7, ternaries 2 (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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ede81f15d015de33b19ab45e237c9503f2d0b90d6bcc6902ef57a79753f134"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.prepushGuards (cognitive 28): ship-release.prepushGuards has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (8 pts), ternaries 4 (5 pts), error handling 2 (3 pts), loops 1 (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 2 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":"lib/ship-release.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efc7a3b6a526496c9a594c7d3fa78557e0237de0cb41468a6e5ff8d7a484c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-release.release (cognitive 28): ship-release.release has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 5 (12 pts), boolean chains 8, if/else 8 (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":"lib/ship-release.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d8ead344bb37a7c1bc5b8064bdb5afcc3abe21f1bd6226179d316f874e8891"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks-prior.supersede (cognitive 28): tasks-prior.supersede has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 1 (nesting depth added 11). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tasks-prior.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27245405a3baff425ee1bd69502dadafee2a0e1b8fb01b13b3efa3d99965d9"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-journal-records.signatureField (cognitive 27): claude-journal-records.signatureField has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). Of this number, 20 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":"lib/claude-journal-records.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dbd0201fe71a7a81d30dbb54c33f23f988696fbeaf116e1a0ec11075719ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-owned-journal.scan::record (cognitive 27): claude-owned-journal.scan::record has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, loops 2 (5 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (claude-owned-journal.scan) 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":"lib/claude-owned-journal.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d83a95e39d85547412860d76b2a835d7d10fe402b0244aa0d070feb83d25b1"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.install (cognitive 27): gstack-design-detect.install has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 5, boolean chains 4, ternaries 2, loops 1 (nesting depth added 2). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"bin/gstack-design-detect.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9204eefc88f2f3bfe88659b425f85c9d3a0e42c536a2a3a7983a4bb9154a07c7"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.transcriptPrefix (cognitive 27): gstack-memory-ingest.transcriptPrefix has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, error handling 2 (3 pts), loops 2, 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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c17031d11aa6a0680113e47e60906ecb8886e6b951845eb77300150eae0a4"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-gbrain-sync.runMemoryIngest (cognitive 27): gstack-gbrain-sync.runMemoryIngest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 4 (7 pts), boolean chains 4 (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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"697eeb48e214c8f0b7ec97818eeb2c09c25d1c9f8f38ca77dd7a7c2bf91361c7"}},{"ruleId":"D2","level":"warning","message":{"text":"path-security.validateOutputPath (cognitive 27): path-security.validateOutputPath has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), error handling 2 (6 pts), boolean chains 3, 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":"browse/src/path-security.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3887f12c3b6aaa96763c586a8db9d2bb9907c76c3154df53085d053beda3d23d"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy-config.parseProxyConfig (cognitive 27): proxy-config.parseProxyConfig has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 9, ternaries 6 (9 pts), if/else 8, 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":"browse/src/proxy-config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1278d7b0577bedb4bbbab442f40fd8b3ba2598330718a18dcac4307960a6ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.close (cognitive 27): BrowserManager.close has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, error handling 2 (7 pts), ternaries 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":"browse/src/browser-manager.ts"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"007e17ee425daa98425dd80780499f7d104f0059812e23dd69a7307952144b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-skills.listBrowserSkills (cognitive 27): browser-skills.listBrowserSkills has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 3 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef91b37066e08f0f4c22f90496d8c35e063c39d4edecb606a13649abaf29c001"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-operation.parseCookieImportArgs (cognitive 27): cookie-import-operation.parseCookieImportArgs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-operation.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"710552a3a39120b91c975f6de169356e57a4f7dd11dab876ad9f2fa5c83f71f3"}},{"ruleId":"D2","level":"warning","message":{"text":"security.combineVerdict (cognitive 27): security.combineVerdict has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69fd769bedd51628c3d986513725782fbfaee688fbac4d2fec1d7b97082f716"}},{"ruleId":"D2","level":"warning","message":{"text":"outside-voice-api.callModel (cognitive 27): outside-voice-api.callModel has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 12 (20 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6119c1c93220e30ee5bac9e5c18df728acc1735486a768f286a0f3f2247a48b9"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.stripJsonc (cognitive 27): import-graph.stripJsonc has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 11). Of this number, 20 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":"lib/pregate/import-graph.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0431a3d6b73965fd05635017b5f928f5f25c9f92ea334d46a12330b2954a94f9"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-receipt.substituteStampOnlyTree (cognitive 27): remote-receipt.substituteStampOnlyTree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 7 (12 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/remote-receipt.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"111fe61d058982ee47abe5dbdfd652793109a7d0a586e4b3126f3a722790b22a"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-exception.shardFailures (cognitive 27): flaky-exception.shardFailures has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 10, ternaries 1 (2 pts), loops 1 (nesting depth added 2). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2edc433748b8b29809b5e59175bed6cde55d8ed7426bc35cd7685769e2f16"}},{"ruleId":"D2","level":"warning","message":{"text":"review-exclude.readSelection (cognitive 27): review-exclude.readSelection has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 6 (10 pts), boolean chains 4, loops 2 (nesting depth added 8). 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":"lib/review-exclude.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e07c11c190101b8841f01a35106ef0ef1ac3fe7a7c1db1b598ee0557505688b"}},{"ruleId":"D2","level":"warning","message":{"text":"tags.tagHunk (cognitive 27): tags.tagHunk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 8, loops 1 (2 pts), 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":"lib/gate-diff/tags.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec90b5bc72b8dbca47831a6a415c69e12e5154ce48b095b60cef3f17a3b1e97"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cut.planDaily (cognitive 27): release-cut.planDaily has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 10 (20 pts), boolean chains 5, if/else 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc56a570cfdceb18db7749aa4e15873439f217eef320751a9cc2536c12ea2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cadence.decideDaily (cognitive 27): release-cadence.decideDaily has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 11 (17 pts), boolean chains 5, if/else 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":"crew/scripts/release-cadence.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0e3f47a32fa4e1d53bf0aa6391810a75445458114cd92d7a85b7907d53d47"}},{"ruleId":"D2","level":"warning","message":{"text":"train-backstop.runBackstop (cognitive 27): train-backstop.runBackstop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 6 (10 pts), boolean chains 3, loops 1 (nesting depth added 7). 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":"crew/scripts/train-backstop.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"170a686b8eb34653da59d1b74a345525be51dcb4b8f214d09476482d14dac634"}},{"ruleId":"D2","level":"warning","message":{"text":"variants.runBriefsBatch (cognitive 27): variants.runBriefsBatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 4 (6 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 5). None of this is in the body itself: all 27 points belong to 4 function items inside it that branch (runOne, runOne::attempt, runOne::check, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"82219916f68cb95a8e285642b155c3d0c03af236e682fcfcf5d51887ad6258b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ceo-review-gate.checkOutput (cognitive 27): ceo-review-gate.checkOutput has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts), ternaries 3 (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ceo-review-gate.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6b318d302660edee3992294b29d7253d73c7f360f7d9080a2906c0ee7a947d"}},{"ruleId":"D2","level":"warning","message":{"text":"plain-title.loadPlainTitlePolicy (cognitive 27): plain-title.loadPlainTitlePolicy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8, error handling 2, loops 2 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 12 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":"lib/plain-title.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a053b374293d989efe6a9d5e369c58703a84be3687b1fe7f99e5455cb4faa493"}},{"ruleId":"D2","level":"warning","message":{"text":"contracts.validateVerificationRequest (cognitive 27): contracts.validateVerificationRequest has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, if/else 11, ternaries 4, loops 1. Of this number, 20 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb67a9a028efd403a8a80e450760d5beb497beb3b8b13c97fffc5e0d2abeb92"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.verify (cognitive 27): cli.verify has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 3 (7 pts), boolean chains 5, error handling 2 (nesting depth added 5). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 2309, 2316). 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":"lib/cso/cli.ts"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92c2fddda33f8e85f955e3f406cf517f1384b376bad287309cae7669941cefe"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-shots.pathSides (cognitive 27): pr-shots.pathSides has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 8 (9 pts), boolean chains 5, loops 1 (nesting depth added 5). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/pr-shots.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc5bd9b39c9b8233574f00205b15ceb5e51b80517475174764e9692705aed49"}},{"ruleId":"D2","level":"warning","message":{"text":"review-sweep.inventory::walk (cognitive 27): review-sweep.inventory::walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea034eeb573c2b23182afde8527ada3aeb98bd660d78c7879a621064cb7ca4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"diagram-prepass.extractDiagramFences (cognitive 27): diagram-prepass.extractDiagramFences has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d986e2e77d1b0930f6b718630e07b228189d7516f0e30518f0d0683998c651"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.stringAt (cognitive 26): redact-patterns.stringAt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, ternaries 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"334d39b6d343d1f818c77d9c83bb36e43fecd49f68dab15f25448a0759e9d104"}},{"ruleId":"D2","level":"warning","message":{"text":"script-invocation.resolveWindowsBash (cognitive 26): script-invocation.resolveWindowsBash has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/script-invocation.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"664570e9bed6488b2c7636249308eaf2cf6add19a58978cdb823189896559e62"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-identity.canonicalRemote (cognitive 26): remote-identity.canonicalRemote has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, 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":"lib/remote-identity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"65318e13f427989b11ea24564827f9fd22c9d6674b5b4ae4d35f0d2e42fee45b"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy-config.noProxyToChromiumRules (cognitive 26): proxy-config.noProxyToChromiumRules 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1a1135a6db7f54bfda265979aba843bbcf72810a2401eb39c9acab589771a2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.acquireServerLock (cognitive 26): cli.acquireServerLock has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, error handling 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee09e4035211179e0349470867231386b582eedd370e2aba15d9814ad161bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-export.buildTasks (cognitive 26): autoplan-export.buildTasks has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-export.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"17caa96821484088cc1efec20203a38d9d03dbb449cee1243b6c7856b7457e95"}},{"ruleId":"D2","level":"warning","message":{"text":"outside-review-result.execution (cognitive 26): outside-review-result.execution has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 4 (7 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":"lib/outside-review-result.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4e4f9bdaf57152ebf5c54b8e5beb7cfeb0d14802df39ee841342f94bb7256c"}},{"ruleId":"D2","level":"warning","message":{"text":"django.settingsModules (cognitive 26): django.settingsModules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/django.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f23a43d608ee739f4d2e4dc979f8cfd01ba742b44747aef8ed8211eb86a1171"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.componentMatch (cognitive 26): rust.componentMatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (8 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 10 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":"lib/pregate/rust.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbed40299bfe339f6c10ad802cd20925f104e831810ed5755ff98e0f57c494d"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land.buildStamp (cognitive 26): ship-queue-land.buildStamp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 6). 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":"lib/ship-queue-land.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcf16321dee504f8e4396639bd55c38b4791d131d974a1b1ab96049aea0ae5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-cli.readyMain (cognitive 26): ship-queue-train-cli.readyMain has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 9, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6d813c7ea471f2165ac2f240ff82910623474f26ef34cb4004e8e89d6c08e1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handleLoopback (cognitive 26): index.handleLoopback has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 1 (3 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a28889003efb2e1294b63c544421330a1e4d005341042c666b10781ab0661ef"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-executor.validateClosure (cognitive 26): preparation-executor.validateClosure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (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":"lib/cso/preparation-executor.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d971b092a901f5a7897fbd038ae0b14fd331dcada50d5eb29d383374a9d3f211"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.resolveArms (cognitive 26): eval-plan.resolveArms has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ae35078260e0ff7483193ab10f10d256de293fef03ab4a1fd6e99919e0c7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.resolveRemote (cognitive 26): gstack-post.resolveRemote has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 5 (7 pts), boolean chains 3, error handling 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":"lib/gstack-post.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5680d04624c9bf3c45a44302562e942f3b99566e85634e93a10316c8fc651d"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-evidence.reportDir (cognitive 26): qa-evidence.reportDir has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (5 pts), error handling 2 (4 pts), boolean chains 3, 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":"lib/qa-evidence.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4d213130899f714caac63032d3d175bbe537afb492f4b3007163a43608c724"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state-clean.evaluate (cognitive 26): repo-state-clean.evaluate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 3 (6 pts), error handling 4, boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f9b0e3171ee344cdd40dbd5456c7770bc8733d51f08a176549f5d1f43b69b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-preflight.merge (cognitive 26): ship-preflight.merge has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 8 (9 pts), boolean chains 5, error handling 1 (nesting depth added 6). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698fe385f179cba2413b0f66001f2b93d7971945ad93fcac8a1e6d4d77edefd"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy-readers.readersErrors (cognitive 25): ship-policy-readers.readersErrors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, loops 1 (nesting depth added 7). Of this number, 21 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":"lib/ship-policy-readers.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"767f90623642ce2171346547504401003e571dcac36467f09b2b42c922fefeb7"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.pluginCacheImpeccableSkillDirs (cognitive 25): gstack-design-detect.pluginCacheImpeccableSkillDirs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), error handling 2 (5 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 13). Of this number, 20 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":"bin/gstack-design-detect.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"baccfc875f1fa15b6cb4d01ccd17a7e29726971d986d3e130f4f581de86444ab"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-gbrain-sync.pruneGoneWorktrees (cognitive 25): gstack-gbrain-sync.pruneGoneWorktrees has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 5 (9 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 7). 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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93ffc8ef709a4c87e1a52bc74457f7c7f9334c640b8a86253cd1aadb1b7e108"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-global-discover.extractCwdFromJsonl (cognitive 25): gstack-global-discover.extractCwdFromJsonl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (5 pts), error handling 3, loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 8 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":"bin/gstack-global-discover.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce478fcb06172da39496f7a34749169bb0aee30c979905c8ad87e49573db526d"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.syncActiveTabByUrl (cognitive 25): BrowserManager.syncActiveTabByUrl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e84ada7be173c956c7b3927ee99d5f1fd4cad4d86d2357356ad43080ab5d50"}},{"ruleId":"D2","level":"warning","message":{"text":"cdp-inspector.modifyStyle (cognitive 25): cdp-inspector.modifyStyle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, error handling 2 (3 pts), loops 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa13fbe1d8e657feaa4e5aa280b57a0fcb081eefaadc1d94110ab1a177b9160"}},{"ruleId":"D2","level":"warning","message":{"text":"lane-ownership.laneCheck (cognitive 25): lane-ownership.laneCheck has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (8 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":"crew/lib/lane-ownership.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cf4bf9959de2f52b1507dedfe1dadbe3ad0f3f5a664f3d0484f29f3ebe388f"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-gate-cost.recReopens (cognitive 25): autoplan-gate-cost.recReopens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2 (4 pts), ternaries 3 (nesting depth added 9). 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":"lib/autoplan-gate-cost.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b20b1c99154264300d10b6b5db504486c0ea7a8c5e025b5eb35a5fb74195af3"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-reality.checkRealityRows (cognitive 25): plan-reality.checkRealityRows has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 3, 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":"lib/plan-reality.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"20124c92b74a7f60cd9b4c3fc871a6ff253c2c0421323a46a309faad561fa748"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-gate.capItems (cognitive 25): autoplan-gate.capItems has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 2 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 13). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"638d85d6ea92e157ced99dead237a33a3f75855c7d9ab8c28e16950c3c7b677e"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-checkpoint.exclusive (cognitive 25): autoplan-checkpoint.exclusive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e499c7f17a3877b2f56d0883edae28ed5c1668e943eba9bbe04fd238c11fb74f"}},{"ruleId":"D2","level":"warning","message":{"text":"headless-artifacts.checkSchema (cognitive 25): headless-artifacts.checkSchema has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 2 (4 pts), ternaries 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b06f64c5aa25b37b163c9f7b872f33977a2333c18cecd63dd3c4ec7f74e901"}},{"ruleId":"D2","level":"warning","message":{"text":"head-policy.lanesOnlyHeadPolicy (cognitive 25): head-policy.lanesOnlyHeadPolicy has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 7, ternaries 5 (6 pts), error handling 2 (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/head-policy.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51949258b8d9d804a119994661043e2cfdc15f0e2f2b63ed95879cbb2ac45b6"}},{"ruleId":"D2","level":"warning","message":{"text":"context.touchedFiles (cognitive 25): context.touchedFiles has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 3 (6 pts), boolean chains 3, loops 2 (nesting depth added 12). 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":"lib/pregate/context.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7697a817548e5cabd16127e9e3e25445a053e27fd3ad458e89d52a5b9487c270"}},{"ruleId":"D2","level":"warning","message":{"text":"lanes.run (cognitive 25): lanes.run has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 12 (17 pts), if/else 4, boolean chains 2, loops 2 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 3 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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"44deb6cd80a2a9e633e977f6e7e512aa264c6c82d3f01182aaddf6b8a53d5cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"literals.run (cognitive 25): literals.run has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 4 (6 pts), loops 4 (6 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 8 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":"lib/pregate/checks/literals.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3b67b8b084e762da0c85c8dd071d4e4f24ac6c6131e9c428b2de112910e065"}},{"ruleId":"D2","level":"warning","message":{"text":"stable-release.newestStableRelease (cognitive 25): stable-release.newestStableRelease has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 6, if/else 5 (6 pts), error handling 1, loops 1 (nesting depth added 5). Of this number, 21 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":"lib/stable-release.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7128f99dfc869d3730cdcd0656ac9333c37150e64d27d9506239db01d055da3"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-docs.parseReceiptDocs (cognitive 25): ship-receipt-docs.parseReceiptDocs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-docs.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"83605428099244f5149de64c4a5a92899cfc6998cef7311c705db08109dcab14"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.ciAtHead (cognitive 25): ship-queue.ciAtHead has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (17 pts), boolean chains 4, if/else 4 (nesting depth added 7). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 230, 231, 223, \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":"lib/ship-queue.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6ad95ec8fbd43e0f0cc59712e657d845e7f4fc1e148fe9910228b86659aec8"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-wave.newWave (cognitive 25): ship-queue-wave.newWave has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 pts), boolean chains 3, 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ceed8b907ad74d7d96a99c45c265e1e84a2683ac6ff17f5c9fc2ef09eb1d48"}},{"ruleId":"D2","level":"warning","message":{"text":"question-log-hook.main (cognitive 25): question-log-hook.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1, loops 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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"df202dadd7fc58127a2d0071ede80496fcd433f63e9565a94669daf830ddd71a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handleTailnet (cognitive 25): index.handleTailnet has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 4 (8 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead61e5a35175d8afebba5cbfc15cb884bd74a25116f720960b1ff2017d54ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"contracts.assertion (cognitive 25): contracts.assertion has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, ternaries 6, loops 1 (2 pts) (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 12 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":"lib/cso/contracts.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa0af95277593700e3a63df7fa2adf8e82b129c0893736a4337b4e0c6abdba6"}},{"ruleId":"D2","level":"warning","message":{"text":"process.executable (cognitive 25): process.executable has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 2 (5 pts), loops 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f146521a9cde194fd1fc683b6fc91752107a43a6fe3e9cc17049dcbfa74a7df3"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-executor.validateScannerRequest (cognitive 25): scanner-executor.validateScannerRequest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 12, loops 3 (4 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. This shape REPEATS in the file: one other method here (scanner-executor.validateScannerRequest::inspect) 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7a9f8d0cd83cf88a1b0afec679e84d85e71486e310f7eadeaddb5a2bd7ae92"}},{"ruleId":"D2","level":"warning","message":{"text":"factory-scorecard.readGateRuns (cognitive 25): factory-scorecard.readGateRuns has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). Of this number, 18 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":"lib/factory-scorecard.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8910d75cd98c725e1192fe26bb154ddf7cbefc7f5fa805e027eaeb2a2095d03"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-supabase-provision.cmdWait (cognitive 25): gbrain-supabase-provision.cmdWait has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab4efd60fdc86217ad78a31aa90b347fc731821cfde1b43aac88ccd327d2cea"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-supabase-provision.cmdListOrphans (cognitive 25): gbrain-supabase-provision.cmdListOrphans has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 10). 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":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"042cc396945d60f691365729c06c1883e122f24a00adea6d41450d51ab19e8de"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-register.hookPlan (cognitive 25): harness-register.hookPlan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 6 (7 pts), boolean chains 6, error handling 1 (nesting depth added 4). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/harness-register.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6401711bf527b54fdf51487d3036db46f5b3463ffe2f3bee77862ddc20eda4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-reality-receipts.resolvePath (cognitive 25): plan-reality-receipts.resolvePath has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality-receipts.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207da5546eaccb53662b1b6d216d85982df72d563f067f956567f52804871e7"}},{"ruleId":"D2","level":"warning","message":{"text":"review-fetch.scanEvents (cognitive 25): review-fetch.scanEvents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (10 pts), boolean chains 4, ternaries 1 (nesting depth added 9). Of this number, 20 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":"lib/review-fetch.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb028e126a3384cce71f3f1816d5317763962adf0f081a683dee2ef8e5feb2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks-prior.addRows (cognitive 25): tasks-prior.addRows has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, ternaries 3, error handling 2 (nesting depth added 2). Most of this is not in the body itself: 8 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 93, 104). 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":"lib/tasks-prior.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ddd58018332c58807e4e4fb0da8a16470edae6ad31da68fedac214e844ab65"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-phase-publication.withResultWithdrawn (cognitive 24): autoplan-phase-publication.withResultWithdrawn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-phase-publication.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b18adcf035dd84343e11793badc8472fe58ab5131d3f800ed53236d428793"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-skills.parseFrontmatterFields (cognitive 24): browser-skills.parseFrontmatterFields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82948ae6aed3fc0665104f3a27f222310150f9927c875b1a5da07c782658109"}},{"ruleId":"D2","level":"warning","message":{"text":"cdp-inspector.undoModification (cognitive 24): cdp-inspector.undoModification has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 12 points are the body\u0027s own statements and 12 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":"browse/src/cdp-inspector.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9019ef1c40ae302ea61fe63e787c5336a05106a2c1bf2e696d34c1b0b1755"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent-control.spawnTerminalAgent (cognitive 24): terminal-agent-control.spawnTerminalAgent has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, error handling 4 (5 pts), ternaries 1 (nesting depth added 4). 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"415aa71a3d144c182fc454b8811f58d17f63d8ce287df9eb2e426e72aa567ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.proxyMismatchLines (cognitive 24): cli.proxyMismatchLines has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 6, if/else 6 (nesting depth added 5). Of this number, 20 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":"browse/src/cli.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ff71b3b20862c2c766f8cfdf25ad4ff0b90a535411b97cf4a5c8b5c3b9fdaa"}},{"ruleId":"D2","level":"warning","message":{"text":"read-commands.parseOutArgs (cognitive 24): read-commands.parseOutArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0870e08fdce52e328cfd0ae80e76308b787b8d5d4feb4550ddca03965371b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-gate.parseCiGateArgs (cognitive 24): ci-gate.parseCiGateArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1, ternaries 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec95452f5fa534bcb73b69d4b6fd7d2292e771bbf6cc4c5f0f94b0cf0ae4ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.tentativeMentions (cognitive 24): restamp.tentativeMentions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"256c518bab6944ee51c4ba186a16a4d343273ee405193cf507007d439b6b03f1"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-confirm.lineDiff (cognitive 24): autoplan-confirm.lineDiff has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 5 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-confirm.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0ccb28ea06d72b83107fa66c9107bce6efb04193058a52dbf0c3cc2ce6379"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-checkpoint.checkpointRun (cognitive 24): autoplan-checkpoint.checkpointRun has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 5 (6 pts), boolean chains 4, loops 3, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 148). 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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd3c004e53eec635d36a7c8ea97de6318fa9e65767ffe7aadfe363ff3c50a3"}},{"ruleId":"D2","level":"warning","message":{"text":"approval-record.buildRow (cognitive 24): approval-record.buildRow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, ternaries 3 (7 pts), loops 2 (nesting depth added 7). Of this number, 20 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":"lib/approval-record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ae88d1b8f793f14ff919d8c8884e894418a328e3da9b40a49547ffaa365c40"}},{"ruleId":"D2","level":"warning","message":{"text":"headless-artifacts.validateRun (cognitive 24): headless-artifacts.validateRun has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (4 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd022465ff1a9fd5404d9a4953af64fb6d3b1735db6261a0579432a16c7da18"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-join.jsonRecords (cognitive 24): sealed-join.jsonRecords has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58f2d2207d25aa98f279c5bbbf41e040b346773548cc4c7b29f43979923314b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt.planCarry (cognitive 24): ship-receipt.planCarry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, boolean chains 8, ternaries 4 (7 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":"lib/ship-receipt.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc82b54ee704fc47faf8510b4db0de3741e5ac2fa6c08f7cfcc9fc600bdef176"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-screen.screenVerdict (cognitive 24): ship-queue-screen.screenVerdict has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 5 (7 pts), boolean chains 6 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"crew/lib/ship-queue-screen.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cacc1b53accd359edda6227e91136d51179cdf3271a9a1e8f367a4505d3d61"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-wave.waveStatus (cognitive 24): ship-queue-wave.waveStatus has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 6 (7 pts), boolean chains 2, loops 2 (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1184df7fb309a33b49a7f028fad58eaa846b2e7687e9d736ca3f0f4dd57ed24"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-verdict.classifyGate (cognitive 24): ship-queue-train-verdict.classifyGate has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 7, boolean chains 5 (nesting depth added 1). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: 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":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"262354e709b0b04cb230c42432b039be24fbfa8ecf324701191eef65486e7c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-verdict.trainRebuild (cognitive 24): ship-queue-train-verdict.trainRebuild has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b4c886951834758c91313436c4e43a0f9d17a145a3c60df9385ed557190a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"content.basicBuildSelector (cognitive 24): content.basicBuildSelector has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, 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":"extension/content.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e703bd82593ea36dcb0006e0150b17dcdcfc56c06aa76cc68282264466d807f2"}},{"ruleId":"D2","level":"warning","message":{"text":"prose-lint.lintProse (cognitive 24): prose-lint.lintProse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 7, boolean chains 5, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 167, 192). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/prose-lint.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d3fc6463dd64ead91a4c7067b062447d7a2c0517b4d1a82f426fcbbcb006d"}},{"ruleId":"D2","level":"warning","message":{"text":"archive-check.parseIssueList (cognitive 24): archive-check.parseIssueList has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, ternaries 1 (2 pts), loops 1 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b33c2cbc15754fd2779bca27cd0812bd72fe871cc624c6eefafbdfdb438f9df"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readOwner (cognitive 24): state.readOwner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, error handling 3 (4 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":"lib/cso/state.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b615da2aee4049229553333ab358388c8d3a6ab61fc119b61d3db676d642a9"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.railsDatabaseConfiguration (cognitive 24): preparation.railsDatabaseConfiguration has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 2 (3 pts), error handling 1, ternaries 1 (nesting depth added 6). Of this number, 21 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":"lib/cso/preparation.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a32f7afe881b282de787a5dda706c996fe16b0142eb3ff874b0c04c32d7debd"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparationExecutor.prepareOffline (cognitive 24): PreparationExecutor.prepareOffline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 2 (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":"lib/cso/preparation-executor.ts"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd08b15e904772673691304ecc0f1e3f0ed101cdf9286bf33526d40a44cebe9"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-catalog.validateQualifiedScanner (cognitive 24): scanner-catalog.validateQualifiedScanner has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 10, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-catalog.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b04051f21f6f2e8ebbcd75aba5e96fcc088a70569d02009cc13228ead057ba"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.runPreregDiagnostics (cognitive 24): eval-plan.runPreregDiagnostics has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 6 (7 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 7). 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":"lib/eval-plan.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3466e750e7cb3edf08311ccf160028dc8238dfc724f5aa4db5bd80961b1169e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.cmdCheck (cognitive 24): ship-budget-cli.cmdCheck has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 4 (7 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 309, 312). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f29703e44eddc95ea5ce811af67dd398057307e504705123be58ae37d0a0ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"toc-pages.pdfDestinationPages (cognitive 24): toc-pages.pdfDestinationPages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4 (6 pts), ternaries 2, boolean chains 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/toc-pages.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca54372e4a9be229a9aba182fba3607a4931c36fd66e8ba4fa6bd9196af9294"}},{"ruleId":"D2","level":"warning","message":{"text":"GenAccessors.main (cognitive 24): GenAccessors.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 3 (4 pts), loops 3 (4 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":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d057b020370178e75142418b733411b547e89d12ede5d367bb9000703b3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy.compatErrors (cognitive 23): ship-policy.compatErrors has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (11 pts), loops 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":"lib/ship-policy.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"d795399bfd96335df0d973ec40498c83ba694628ab2adf20661beb113b654a06"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.isSourceExpression (cognitive 23): redact-patterns.isSourceExpression has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"356477dcd9b3f9b6712288be6f4ccc263e20dad413e9666e0013543e726278e1"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.consumption (cognitive 23): phase-publication-hook.consumption has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, 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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"994962692653107445c21cbe857a49a2bb4baee21da6009b99b478c8246aa096"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.parseArgs (cognitive 23): gstack-memory-ingest.parseArgs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0536636dd5b98c07e7a1a14d1553e440f09f58375e58bed1b95f8c1b61aa1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.importAndApply (cognitive 23): gstack-memory-ingest.importAndApply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, ternaries 1 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2759}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab67c93801c479d3b39f01f428a95c44414b649ee280958ffa97b4008ec76e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"url-validation.normalizeFileUrl (cognitive 23): url-validation.normalizeFileUrl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 5, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/url-validation.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1366220d88f9935317ff8b30e852627d1d9e40984e7f30b1557747ae11142259"}},{"ruleId":"D2","level":"warning","message":{"text":"xvfb.awaitXvfbReady (cognitive 23): xvfb.awaitXvfbReady has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 3 (7 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b0300e28ea799d5d159e0fa522278cb0617df614f5ce31f03485968117cdab"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-skill-commands.buildSpawnEnv (cognitive 23): browser-skill-commands.buildSpawnEnv has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (6 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":"browse/src/browser-skill-commands.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce27e94a2ca8f2a236731f22220dc393659cc30fce494f1a3490a2312afba9c"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent-control.agentStatus (cognitive 23): terminal-agent-control.agentStatus has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 3 (5 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6dffca5fdc16d844735436a62a35b52f687fa314f6b1a58d86fe6f9e3ef304"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-commands.buildPdfOptions (cognitive 23): meta-commands.buildPdfOptions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"583d9e0872bef973c817b0b2ab36bbb5603585d3f5c9759174c7cc0cd7b878c5"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.queueOrderCheck (cognitive 23): restamp.queueOrderCheck has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 4, if/else 3 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 5). 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":"lib/restamp.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2353cefcf837859ca3b24ce4bd56398adfb9bfdc03d4fa0ddb178ff2e0d93555"}},{"ruleId":"D2","level":"warning","message":{"text":"no-stop.parseDiff (cognitive 23): no-stop.parseDiff has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 20 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":"lib/no-stop.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac7ce52cc053533168c7145f6641d4b49d995eb6245f2365e96e0f724fa4b71"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-shadow.publish (cognitive 23): autoplan-shadow.publish has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5 (6 pts), boolean chains 4, error handling 3 (4 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 396, 421). 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":"lib/autoplan-shadow.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeca92b2b86ced543e3d7168fd8b70392ed99d3a05172b619bd20422e4c21ee"}},{"ruleId":"D2","level":"warning","message":{"text":"bin-context.markerSlug (cognitive 23): bin-context.markerSlug has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a242b0074eb91e9b073acf12fdfda9938327626179eef723e8e4427104d3745d"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt.computeCensus (cognitive 23): ship-receipt.computeCensus has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 3, 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":"lib/ship-receipt.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478c7e7314a53ab4e093ad7545a6573a0a7a9f57f41cd5d0950ea860d328d72"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land.resolveReleaseConflicts (cognitive 23): ship-queue-land.resolveReleaseConflicts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b27346f9152283ee3371c75496967d5585aa0ed4fd534411ce32b47a9321ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-stamp.stampChain (cognitive 23): ship-queue-train-stamp.stampChain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (6 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":"crew/lib/ship-queue-train-stamp.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb99e4f8454447299643cce9e25d891d3ec1b5c1b7dc927db0d99f8f5d7f3283"}},{"ruleId":"D2","level":"warning","message":{"text":"generate.generate (cognitive 23): generate.generate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (7 pts), boolean chains 3, error handling 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":"design/src/generate.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1990a8560141be209406aa2fd52069c56afecc97ae278861d224eaadd5ade659"}},{"ruleId":"D2","level":"warning","message":{"text":"sidepanel.tryConnect (cognitive 23): sidepanel.tryConnect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc76fe6143ecd9cb5e87e0307be3886fe06657c4599ec5f517b8e14677542ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"spawn-bin.runExternal (cognitive 23): spawn-bin.runExternal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), error handling 5 (6 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 166, 139, 162, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/spawn-bin.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e827e64808e0ca0d8ab11d4ab2809936d5406f8b5bf920684d8fa7b6c819b4"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-route.scorePrompt (cognitive 23): skill-route.scorePrompt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (7 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). 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":"lib/skill-route.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84881e3691547b84877d3c2b7a973babbf5d709b2c8d58dfcc8a89fccfa3a26"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-gates.runGateHook (cognitive 23): skill-gates.runGateHook has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, ternaries 2 (4 pts), error handling 3 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 3 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":"lib/skill-gates.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a573a1bf941f1fdefe933e542c7752e366ab7f4a8d8605833c48999fd1818f"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy.proxyToDevice (cognitive 23): proxy.proxyToDevice has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 71, 83, 100, \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":"ios-qa/daemon/src/proxy.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeca32eaf8c85d4ea8352c4720cc5a2f28408aaca731e51fb3ae5aac11f168b"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-shadow-reader.rowProblem (cognitive 23): autoplan-shadow-reader.rowProblem has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e875597b1ac40d82a8cd0bd1f1e17d2832cfe92948348d46d8423f23dabb551"}},{"ruleId":"D2","level":"warning","message":{"text":"model-policy.codexSignals (cognitive 23): model-policy.codexSignals has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ca72dee4aeeaf8c0b62f64bb66c6fbfb17fc92e94cef6f34652fb37ffc3279"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicArchiveCache.withLock (cognitive 23): PublicArchiveCache.withLock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecfff7026e27879c16d4b7fd1d2a17f50994375775541d8eddf25192dbcbecc"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.rejectSpecialFiles (cognitive 23): snapshot.rejectSpecialFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3, ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (walk, ignoredDirectory). 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":"lib/cso/snapshot.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1750b2331470b5dacedb9f788919cce6b62b4a163c997c8de12b32b4f16660c"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.dryRun (cognitive 23): eval-plan.dryRun has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 6, ternaries 4, loops 2 (3 pts), error handling 1 (nesting depth added 1). Of this number, 14 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":"lib/eval-plan.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4206463f8bc9b22620e916603742479eb4d2ef78c20c85ea2d7f12c8ef5656"}},{"ruleId":"D2","level":"warning","message":{"text":"factory-scorecard.readMergedPrs (cognitive 23): factory-scorecard.readMergedPrs has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 3 (7 pts), boolean chains 3, 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":"lib/factory-scorecard.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5bad24255ad2b71709f6976bbdc3fb8dde13aef821c4c07a6b969d28778e73"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.receiptRunIdSpans (cognitive 23): gstack-post.receiptRunIdSpans has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 11). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (span, rows). 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":"lib/gstack-post.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ab48e7363acf66aaafe71b9d0bdf1b43e26c49afb7d46f4b7dea2aa41e7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"review-sweep.quarantineStage (cognitive 23): review-sweep.quarantineStage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 5, error handling 1 (4 pts), loops 1 (nesting depth added 11). Of this number, 13 points are the body\u0027s own statements and 10 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":"lib/review-sweep.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f129f0a280a6722ec56c0e02f70560fc8f19c66853e978ab50009df3b475e460"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.leanStep (cognitive 22): review-depth.leanStep has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (8 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":"lib/review-depth.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d9f7c194e0b9fa8ba780a8851ffb2e16b0c023931cee7df6d34a97d54e8591"}},{"ruleId":"D2","level":"warning","message":{"text":"memory-ingest-landing.reconcile (cognitive 22): memory-ingest-landing.reconcile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). 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":"lib/memory-ingest-landing.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"518506c3feae1142c9581f1ddcbf1461c0482e8390f161fa09404e6eabb4158f"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-native-worker.startMember (cognitive 22): cookie-import-native-worker.startMember has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (8 pts), error handling 2 (4 pts), loops 1 (nesting depth added 10). None of this is in the body itself: all 22 points belong to 2 function literals inside it that branch (lines 166, 146). 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":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9a182d3f1e4e1e563d0cec052806c64208c9fae575def58ba8e19863e7070"}},{"ruleId":"D2","level":"warning","message":{"text":"read-commands.isSingleParenOrIifeExpression (cognitive 22): read-commands.isSingleParenOrIifeExpression has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a497fd7fe1a92d7c6caadf494d435dd2917a83a4795f4a6eda643e17615d3e3"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-state.readState (cognitive 22): autoplan-state.readState has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 3 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 12). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-state.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf43cd1c46b0079681a694c9c6f9bceef1a47590fdafa03756c85d149a29f72"}},{"ruleId":"D2","level":"warning","message":{"text":"bin-context.gitCommonDir (cognitive 22): bin-context.gitCommonDir has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (5 pts), ternaries 1 (3 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":"lib/bin-context.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4837ca35ada624e5ebe2c5a1ea2cc4f8ee819e8fa5dca0c545a984cb72bd012b"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.sealedErrors (cognitive 22): sealed-guard.sealedErrors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, error handling 2, loops 2 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb583e00cb2f72c1cda9f7f2f78cf429301adbfdd37226ff5f2964f09ed6a0"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.evaluateSealed (cognitive 22): sealed-guard.evaluateSealed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (6 pts), loops 3 (4 pts), boolean chains 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":"lib/sealed-guard.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a0e0c00806631b355b02da1a9a67e99d4f19cc54d6af7032e5a7c5af6ed3b"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.renderSealed (cognitive 22): sealed-guard.renderSealed has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 5 (7 pts), loops 7 (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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d17e15be7b570352267bed236ab3d03ec4ed0e4b030ca01c6576ea0dfe8ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"config.guardErrors (cognitive 22): config.guardErrors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, loops 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 149, 158). 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":"lib/pregate/config.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a1f96176dd415de09221d07ee0ff07012f49fe3d1e232a1dd73ebd54984bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.effectiveOptions (cognitive 22): import-graph.effectiveOptions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0761e0a6836e0951db60100b6860fa32afd885cb8711189a4cd228d226d8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.testsFor (cognitive 22): import-graph.testsFor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2080eb91393b0c4f250c094c9a2a92a6ef838b499b0cbb9f4e280e70aa47ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-exception.flakyRuns (cognitive 22): flaky-exception.flakyRuns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f22b21c3ea5648c41edf29d383a0a9ab412d3139add6589a5e2c28aff6b57f1"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-exception.reconcileJobs (cognitive 22): flaky-exception.reconcileJobs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc98750fea264c86f6a9afd5ed7b1e3799077a1b7a1a44b8506efe3c7d0b52f"}},{"ruleId":"D2","level":"warning","message":{"text":"review-collect.grepConsumers (cognitive 22): review-collect.grepConsumers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 4, ternaries 3 (4 pts) (nesting depth added 7). 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":"lib/review-collect.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8372824ec3eb8d634b000a317f571661867ba12a777060752dc311ea5d48aef"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.exceptionProblems (cognitive 22): ship-receipt-depth.exceptionProblems has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"573fb81071747c12b9ead2b2a5eca5ac241517fbcbc13365172f0c3d0055df4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher.emitConversation (cognitive 22): Watcher.emitConversation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, ternaries 2 (4 pts), loops 3 (nesting depth added 7). Of this number, 18 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":"lib/pr-wait.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c951eb2ca0b31bfa7d7e092e0aa0cfb4ad4305e99f0abb61ae168b59aec4898"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher.run (cognitive 22): Watcher.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 2 (4 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":"lib/pr-wait.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49b26ff8390760783f9aad1f9be88f33db5316c23d7e201b73e78c80278642b"}},{"ruleId":"D2","level":"warning","message":{"text":"release-gate.collectRound (cognitive 22): release-gate.collectRound has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (3 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":"crew/lib/release-gate.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"874bdf35a43bdafdae3c86fdd2d6adbea9822b5f5544cd422030870cd1295d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"gallery.generateGalleryHtml (cognitive 22): gallery.generateGalleryHtml has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (7 pts), error handling 3 (6 pts), if/else 4 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 6 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":"design/src/gallery.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaf737ac2acc965249e9d91578b3fb60ddabfa661d83b64a2df4396c68f67a5"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-contract.runsCheck (cognitive 22): skill-contract.runsCheck has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, 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":"lib/skill-contract.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c39abd956de18d2b5a30d6a15d528711995f06b87b78fe886c226819c26d48"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-contract.checkContract (cognitive 22): skill-contract.checkContract has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b78dffbf7efd88509f1870aa64d7e9b3bbc00cea49d76cf1b33fce9b4c8f5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ceo-review-gate.rankedRisksGap (cognitive 22): ceo-review-gate.rankedRisksGap 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":"lib/ceo-review-gate.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"474274be00aa231098347464f6792b2c20fa33df3a346d75a10358e36690b8da"}},{"ruleId":"D2","level":"warning","message":{"text":"checks.healthDimensions (cognitive 22): checks.healthDimensions has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, ternaries 5 (6 pts), error handling 1, if/else 1 (nesting depth added 1). Of this number, 20 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":"lib/checks.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e385da0bab4a8c241c13a62ba2dc8a05f5e3ce3a8dffc041950af7a5ec55ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.contextBillMain::exactFor (cognitive 22): context-bill.contextBillMain::exactFor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (5 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (context-bill.contextBillMain) 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":"lib/context-bill.ts"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc1abc4969c23ea2d4cd0d5592ee9f0f417f34f55583877691965f9ea697565"}},{"ruleId":"D2","level":"warning","message":{"text":"process.boundedMetadataFile (cognitive 22): process.boundedMetadataFile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 3 (4 pts), ternaries 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":"lib/cso/process.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"805cdb74249f91bb62de558e151eff8a54e97ba2808d41747a94dafe86662f47"}},{"ruleId":"D2","level":"warning","message":{"text":"process.runProcess (cognitive 22): process.runProcess has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 5, error handling 2. Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 650, 614, 599, \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":"lib/cso/process.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cda1f569a706fa3e82aa7176b5bca0e303a54b44b857ed4a67bb8f65373b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"state.ensureDirectory (cognitive 22): state.ensureDirectory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, 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":"lib/cso/state.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3252c82d7f78a4cab66efed4211b58b191721be5de3e823154d845f9ecb4c4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerPreparationSandboxRunner.acquire (cognitive 22): DockerPreparationSandboxRunner.acquire has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 4, loops 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"35540cb07ed49fe290b3c0b4b8694bf920c19f01b81130480c58c878f159d0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-executor.prepareDockerScannerApplication (cognitive 22): scanner-executor.prepareDockerScannerApplication has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 4 (9 pts), boolean chains 2, ternaries 1 (nesting depth added 9). 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4bc153ecc191f209135425a86b7cc662836e00b7c829b9977defda519c92e4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.recheckOriginalDirectory (cognitive 22): cli.recheckOriginalDirectory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 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":"lib/cso/cli.ts"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"a950babbc1a5a7298e91f8dcec2bfcc475cd6b1fd9aae5722268394ae92dfdd7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.preparedVerificationExecutor.observe (cognitive 22): cli.preparedVerificationExecutor.observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 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":"lib/cso/cli.ts"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6235981982145877f3580b3e3195e45d5a2732a2885ca12fe1d555d23d5a943b"}},{"ruleId":"D2","level":"warning","message":{"text":"review-fetch.splitCommands (cognitive 22): review-fetch.splitCommands has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44f76913e706911c070fd37a6709bfd176b69c24d8003ae319e2a8232dec0db"}},{"ruleId":"D2","level":"warning","message":{"text":"review-fetch.commandWords (cognitive 22): review-fetch.commandWords has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f60e3dd67ebf219c5647748b470cb7946c2c8fa54b8dc51ae80ec86a414a7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"review-targeted-delta.targetedDelta (cognitive 22): review-targeted-delta.targetedDelta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9, boolean chains 7, ternaries 4 (6 pts) (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/review-targeted-delta.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a731626ce5f38792801f33d6cf5bbeae181a1894690aaf4097bbaf4b81fc694"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.rebuildLedger (cognitive 22): ship-budget-cli.rebuildLedger has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 11 (12 pts), boolean chains 5, if/else 4, error handling 1 (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, 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":"lib/ship-budget-cli.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad3940d7e1468ecf0b1b014a76f8bf74d2d33891001bae5d91052f7a1782cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-engine.inStructuralToken (cognitive 21): redact-engine.inStructuralToken has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd3a964fa77f82752f8c3d0bf97589026d7f45a5c78e773ff1c10e2f1273263"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.verifyCloseEdits (cognitive 21): phase-publication-hook.verifyCloseEdits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 1 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbad8d9f4dd6871f17814ad850d94e001c3f23aedefb601a9fbe225323a30f25"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-skills.collectArgsList (cognitive 21): browser-skills.collectArgsList has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"112517c06c7454982672b5eab5c39a074f4ef1130c829f2706641fb2b2891872"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.tunnelRevoke (cognitive 21): cli.tunnelRevoke has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (5 pts), error handling 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"838a558daba196fedb3fb268257af9024a023cb9c6af590c72f10066699cb785"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-native-worker.superviseNativeCookieImport (cognitive 21): cookie-import-native-worker.superviseNativeCookieImport has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 4, ternaries 2 (4 pts), error handling 3, loops 3 (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":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a200d0e2ba37b3c47ef63580f10a3ca3298856df9551813962fc6c3d7f1ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"read-commands.findBalancedClose (cognitive 21): read-commands.findBalancedClose has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, 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":"browse/src/read-commands.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"787a98dc200710ac70c288083c280e8993cd3fb22c6d3516616aea637c977b85"}},{"ruleId":"D2","level":"warning","message":{"text":"ci-gate.parseChecks (cognitive 21): ci-gate.parseChecks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6382335072b48ee656025434950defecd6e9ab5af00b78518ae5b9b3626dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-bundle.compareIdentity (cognitive 21): evidence-bundle.compareIdentity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (7 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":"lib/evidence-bundle.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed2761fbb2a01b6724e8f810bb57fd420060f081ea66ecc8d52da4b8bf2a15b"}},{"ruleId":"D2","level":"warning","message":{"text":"no-stop.notEli5Only (cognitive 21): no-stop.notEli5Only has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, 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":"lib/no-stop.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c89e3cc15baf681dbbdeedc6a78382af3026c0edd228ae70f1a0c74d72d642f"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-run.openPhase (cognitive 21): autoplan-run.openPhase has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 6 (7 pts), boolean chains 3, loops 1 (nesting depth added 4). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3332e4a66f0766cd9b8ee976bd06ca7a713352f72e70720c4dc2ad608b26e28"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-join.delimitedRows (cognitive 21): sealed-join.delimitedRows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 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":"lib/sealed-join.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68562a5411a261f0aaf5f5ef6ae0dc1983ec0a406d85ce0a6ff28dcba3f0c74"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.publishedViaPulls (cognitive 21): sealed-guard.publishedViaPulls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b5b6a2c9be3c924cab78d57feb98d2deda5b448324317e367c764b74d8806"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.landedOnBase (cognitive 21): sealed-guard.landedOnBase has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 2, error handling 1, ternaries 1 (nesting depth added 3). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/sealed-guard.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2289134277ee0b38beee04b6b5afef898229820dfe7e35f6175620a397f830"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.resolveBun (cognitive 21): runtime.resolveBun has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, error handling 1 (2 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/runtime.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48b1306ae06d87c128623d158996c02861418a320e9f3da129274cd3a648dfa"}},{"ruleId":"D2","level":"warning","message":{"text":"docs-only.classifyEntries (cognitive 21): docs-only.classifyEntries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 5 (6 pts), boolean chains 4, loops 1 (nesting depth added 3). Of this number, 17 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs-only.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1073fb5dddfa697f385a32bd9b392547887f08c3ba8c4a8f280b6818f9e5191e"}},{"ruleId":"D2","level":"warning","message":{"text":"version-gate-train.regeneratedAtBase (cognitive 21): version-gate-train.regeneratedAtBase has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (5 pts), boolean chains 3, error handling 3, loops 2 (nesting depth added 5). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/version-gate-train.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f2cefd4dd7411e7416a85b1fbbde2756e858ed33fe42ee8353c3f458e07082"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-record.readStore (cognitive 21): plan-record.readStore has cognitive complexity 21 (threshold 15). Drivers by points: error handling 3 (9 pts), loops 3 (6 pts), if/else 2 (5 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0366ebb8f019b3521cdf55296280ac5fefa98ce84b9a2483ed54a24eea4f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"approval-classes.classErrors (cognitive 21): approval-classes.classErrors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8, 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":"lib/approval-classes.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"be076992b815b87ea20435acf91f4363daa7fd988412a4d0451991c960785d11"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt.parseReviewLoop (cognitive 21): ship-receipt.parseReviewLoop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, ternaries 2 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: 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":"lib/ship-receipt.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9df21ddddb5d5b9e44519ab8c1276082d786a46b9b0a55a79e10dc30805ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"review-collect.collectLive (cognitive 21): review-collect.collectLive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 3 (5 pts), error handling 3 (4 pts), loops 1 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 8 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":"lib/review-collect.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"831c7f976e39069941f6532588e8e6c3b5686d5e4e7e71d35d11889334f39151"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land.unstampLegacy (cognitive 21): ship-queue-land.unstampLegacy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, ternaries 2, loops 1 (nesting depth added 4). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"441d3d9f0f5108abee8349f0a206b72a34533c1eef4b935c4c7774f41fba93f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-verify.confirmMerged (cognitive 21): ship-queue-train-verify.confirmMerged has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 6, if/else 4 (5 pts) (nesting depth added 6). 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":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe59758af53e3e7262db7d98226fcf41e55d038d40c10f9bbd14cb43f5ca334f"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-land.trainLand (cognitive 21): ship-queue-train-land.trainLand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, ternaries 4 (6 pts), boolean chains 5 (nesting depth added 2). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"198ee4950af9f55a3c0e9f8eef05ae6e68efb91baf8f60d236c0986f0b01870b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-forget.trainForget (cognitive 21): ship-queue-train-forget.trainForget has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 4 (7 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":"crew/lib/ship-queue-train-forget.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e4135eb14c2972fbff4a3a8fe60ceade900f3ef38dd64275229f26ab68b680"}},{"ruleId":"D2","level":"warning","message":{"text":"tags.detectRelaxation (cognitive 21): tags.detectRelaxation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (6 pts), loops 3, boolean chains 1 (nesting depth added 8). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/tags.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0a4b52fd4a807b20fb9b0fff29a5471ef84f09b3016343713f82412339f8d1"}},{"ruleId":"D2","level":"warning","message":{"text":"inspector.buildSelector (cognitive 21): inspector.buildSelector has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 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":"extension/inspector.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8f779f44dbdaa2885fc6d0c3e96371d86923918398cef34d7965506e23a012"}},{"ruleId":"D2","level":"warning","message":{"text":"contracts.legacyJson (cognitive 21): contracts.legacyJson has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, 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":"lib/cso/contracts.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec83e5c94c7414079fa1b0bdc6920bdcf13e1d33275842d9e94aee89e5ec1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readLegacyOwner (cognitive 21): state.readLegacyOwner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 3 (4 pts), ternaries 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":"lib/cso/state.ts"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"089e52f04c3825b1d67b8dc26d994cfae7efb16d563a95e1b661af285880f877"}},{"ruleId":"D2","level":"warning","message":{"text":"state.acquireMigrationClaim (cognitive 21): state.acquireMigrationClaim has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 2 (5 pts), loops 1 (nesting depth added 13). 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":"lib/cso/state.ts"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"996521ff5e247f4cbb23155f7751a09754a3a60c0e806472e8632c3476f9a3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicArchiveCache.recoverInterruptedOperations (cognitive 21): PublicArchiveCache.recoverInterruptedOperations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 7 (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":"lib/cso/cache.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"5528bb7527f3b599fb0c8770d0d5e4132ab9309eebf4fe7e04ec6c392498a002"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.capture::assertEntriesStable (cognitive 21): snapshot.capture::assertEntriesStable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 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 shape REPEATS in the file: one other method here (snapshot.capture) 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":"lib/cso/snapshot.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cec4275bd7caad6fe8e0b2890abbec88aefee6507da3738a6194f51c6852e8"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.manifest (cognitive 21): preparation.manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 3, 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":"lib/cso/preparation.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e143f32a269b638213ea440d9a16d82f0ecf8815b98f09c6a83a5493495fdaa"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerPreparationSandboxRunner.publishArtifacts (cognitive 21): DockerPreparationSandboxRunner.publishArtifacts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, error handling 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faddd971fde398a0b81c34133201684488615e4c8b42243c9e7369c75462710"}},{"ruleId":"D2","level":"warning","message":{"text":"scanners.decodedDocument (cognitive 21): scanners.decodedDocument has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2cdbf3111803304a5420f1595063a99b7f691eb88d7bf2b095e646960e77d4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.planned (cognitive 21): cli.planned has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae890a3d65a86f35fc3bdd743bffbcf4be1691f666b0c95b2d14a42fc7b37612"}},{"ruleId":"D2","level":"warning","message":{"text":"factory-scorecard.readComments (cognitive 21): factory-scorecard.readComments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee42c78496ffef528ab1a62c195ef11dfdcd442feb53fb6ea0e86081a8d8caa"}},{"ruleId":"D2","level":"warning","message":{"text":"quarantine.reportLines (cognitive 21): quarantine.reportLines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 4 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 8). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e941489dc7e1c8e00b5ed5ce937deb11642f9836a4bb464613e0938825608d8"}},{"ruleId":"D2","level":"warning","message":{"text":"state-matrix.parseSpecialistOutput (cognitive 21): state-matrix.parseSpecialistOutput has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 14 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":"lib/state-matrix.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16705e11f70da31fcfe86c79ce327ed6b9d223599d282b43fe1ee8e92035894"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-parts.shipParts (cognitive 21): ship-parts.shipParts has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 4 (5 pts), error handling 2 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-parts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae68cf8b3b9d3b5e929670ce6e1cd0d278b6c5db2c30f45ad84fbaecd78768e"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-preflight.simulate (cognitive 21): ship-preflight.simulate has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5 (8 pts), boolean chains 3, loops 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9978c1f237629816cc2fd405f26f4d1054f9e2e393d156bbe3fb6a61aa947dab"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-prose.withoutApprovalsBlocks (cognitive 21): ship-receipt-prose.withoutApprovalsBlocks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 3, ternaries 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-prose.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6492cce57f50854da0bb60cb7284c21dd176e8d0f2fa654cd02f8ed34818411d"}},{"ruleId":"D2","level":"warning","message":{"text":"familyStop (cognitive 21): familyStop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 8). Of this number, 20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/capy-review-pass.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f9a113325fd2430d4c9eb61bf2fcc6efca65fc80f28cb97484c4733496494d"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.jsSpans (cognitive 20): redact-patterns.jsSpans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f5b2c2b4e91053187703813c4556e397fcfed3f2bcfedce9fa6c17f0b41a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.autoplanReadRange (cognitive 20): phase-publication-hook.autoplanReadRange has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (9 pts), loops 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd0f02b1dbaa5ecd907387277540d825ca54d0b01121d8cc9db478d53fcf09"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-browser.withCookieReadRetry (cognitive 20): cookie-import-browser.withCookieReadRetry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21165ece34d1f54969c25e2dd9ef2b787846b61d54083e4e41ccd269f360399"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent.maybeSpawnPty (cognitive 20): terminal-agent.maybeSpawnPty has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (5 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 16 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":"browse/src/terminal-agent.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e740f2893a81a1a2a721ff1ef71df148ca89b291c22756e9c80cdca12b023"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-check.checkChangelog (cognitive 20): changelog-check.checkChangelog has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 4 (6 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c00a3b13c561489f805f62cd6ac8c766ac3ca0dca3209878c8054cc9a4c892f"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-export.aggregateFindings (cognitive 20): autoplan-export.aggregateFindings has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (8 pts), loops 3 (5 pts), if/else 2 (4 pts), boolean chains 3 (nesting depth added 9). Of this number, 17 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":"lib/autoplan-export.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd0ce6d82461825973ba7a2f29bfed27560115597ad68ba896ece783fb5abbe"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-checkpoint.restoreCheckpoint (cognitive 20): autoplan-checkpoint.restoreCheckpoint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2, error handling 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 237, 241). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d45c6eed6659f6b60e91c79fc5242d37e2cec963790b3e48cfa0afe68f826c"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.cargoModel.membersOf (cognitive 20): rust.cargoModel.membersOf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 6). Of this number, 15 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":"lib/pregate/rust.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d014d1e4e35273b6e9469a13f7070f81b484e3ecc17cce9eabc6872a422efb5"}},{"ruleId":"D2","level":"warning","message":{"text":"doc-links.addedLines (cognitive 20): doc-links.addedLines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/doc-links.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9520aeae77cd408fc5afe6fc92432c56f1021d4fd8c83f402c03ed722df8edc0"}},{"ruleId":"D2","level":"warning","message":{"text":"lanes.describe (cognitive 20): lanes.describe has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 3, 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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e4eeb0e0c4d0c18ba8e4eb01b8cb1cd48fe20d0fc26783b8fae1fccabeecad"}},{"ruleId":"D2","level":"warning","message":{"text":"timing.addedTestLines (cognitive 20): timing.addedTestLines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5956702511963b5f5765933cbad42cf5170200f404a34a66c4d40ccd96c05b4"}},{"ruleId":"D2","level":"warning","message":{"text":"run-check.gateInputsChanged (cognitive 20): run-check.gateInputsChanged has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2, ternaries 2 (nesting depth added 3). Of this number, 16 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":"lib/pregate/run-check.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb5c83e896a4fa6cb17d2d15b0b2d469d5861822c8198a9c7fa2efa11fdc66e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.verifyPregate (cognitive 20): index.verifyPregate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, ternaries 5 (8 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc1fd1456235cf895f17b7cc18b10fb434ab113e136664b1a317941b680c7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"banned-terms.scanBannedTerms (cognitive 20): banned-terms.scanBannedTerms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), ternaries 1 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/banned-terms.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce70fc02b87567db777ab4b3169cf094e8ea4768f45045d6052035adbb00bfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"approval-classes.classHits (cognitive 20): approval-classes.classHits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 3, 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":"lib/approval-classes.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97ba0653696e8a555d11c84dd3574e03341a3fab6c3a6f5f1d913c0de7cb855"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt.heldBy (cognitive 20): ship-receipt.heldBy has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 5 (6 pts), boolean chains 5, loops 1 (nesting depth added 2). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/ship-receipt.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"29172a76c070112fe34647bec95dc72ef0a1672b782243ed065e67b93dea0c13"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.receiptDepthVerdict (cognitive 20): ship-receipt-depth.receiptDepthVerdict has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 4 (5 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec6b7fdccc7e5b57473b119f4de98d7741c26d016bd358080b3c81236d43741"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-ready.dispatchScreen (cognitive 20): ship-queue-train-ready.dispatchScreen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 6 (8 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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaced321aaae8293cee18de51d72c01a7c64a99337c09c5da24517b8c355eebf"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-init.trainInit (cognitive 20): ship-queue-train-init.trainInit has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 6, boolean chains 3, loops 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":"crew/lib/ship-queue-train-init.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a75ca7ac4879a41cf2b8a5a2827b4eb23321c22c672c7c29cfda999a75a30e3"}},{"ruleId":"D2","level":"warning","message":{"text":"review-dispatch-compare.newShip (cognitive 20): review-dispatch-compare.newShip has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 2 (4 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/review-dispatch-compare.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1057d0708fdda0ecdd3c38d67e9b5f7785db9321336bfb66dd6c2220e5df068"}},{"ruleId":"D2","level":"warning","message":{"text":"train-backstop.coveringRecord (cognitive 20): train-backstop.coveringRecord has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). Of this number, 16 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":"crew/scripts/train-backstop.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6cd96d31a2e9f4b07c1e33439da1912e00643514576fb78084ac822eac1b21"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.updateDesignMd (cognitive 20): memory.updateDesignMd has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/memory.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8ba5a23b2cca7b1379ab60c2634c0d030211e1fc5d1bf3139b84ce6532bb22"}},{"ruleId":"D2","level":"warning","message":{"text":"sidepanel.chrome.runtime.onMessage.addListener() (cognitive 20): sidepanel.chrome.runtime.onMessage.addListener() has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 4). 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, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a588476f2908900809d592f0266dbcfba41cfb917d547c390051f62531de1a"}},{"ruleId":"D2","level":"warning","message":{"text":"base-red.parseEvidence (cognitive 20): base-red.parseEvidence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/base-red.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"691f5677ae14407bca235dd5f5e78773d1a8a4fcab5effad3fd02a013d61babb"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-code-migration.copySkill (cognitive 20): claude-code-migration.copySkill has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d739c7291e7449d034668047a34d9ffac6bb126d9c102bce7d620ef47f5354d5"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.findSkillDirs::walk (cognitive 20): context-bill.findSkillDirs::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (3 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":"lib/context-bill.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a02ca57011f6c695559b4e13ce5faa1087d3787f0142e85605245fcbe97989"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.measureExactTokens (cognitive 20): context-bill.measureExactTokens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (4 pts), loops 3, error handling 2 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 7 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":"lib/context-bill.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a506d0c8bc1d683fc8036ce2efec21ca1915d4578663fa1deea00df81910c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.inspectPreparation (cognitive 20): preparation.inspectPreparation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 7, ternaries 1 (2 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":"lib/cso/preparation.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c0eca2bed54668ed3c54b78e7f46804a75559f0629d9fb452e44e666b3a9f9"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-executor.provePreparedProjection (cognitive 20): preparation-executor.provePreparedProjection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 3 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b5f5e0ecf40aaa74a61dcf57d95f6f35ed3e04493b3fc9168556be511a905"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseStart (cognitive 20): cli.parseStart has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 4, boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2e1df3e7f042248254002c3e3ea020471fd3e994cb87eb2e4df5457d228948"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.recoveryEvents::walk (cognitive 20): cli.recoveryEvents::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de82eae70c4264f67114426a48094a658997e66e7c3064bdf3d51e10ff11fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.recheck (cognitive 20): cli.recheck has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (9 pts), if/else 7, boolean chains 4 (nesting depth added 1). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 1935). 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":"lib/cso/cli.ts"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ea40c0549ce9e515b7cc43c430a36e1fd511739c1fa7747021a360473f94ce"}},{"ruleId":"D2","level":"warning","message":{"text":"model-policy-freshness-publication.publishFreshness::publish (cognitive 20): model-policy-freshness-publication.publishFreshness::publish has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-freshness-publication.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9e022f059edbf3fc03edffe48559d27d70b93eded81b7b7d1aa20460b64e7"}},{"ruleId":"D2","level":"warning","message":{"text":"office-hours-probe.resolveProbe (cognitive 20): office-hours-probe.resolveProbe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-probe.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3beafa048952d5f46d3b69734a6f6d412d9bb774bd49f02628e9f00eed4d11b0"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-shots.diffLines (cognitive 20): pr-shots.diffLines has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (8 pts), boolean chains 7, if/else 4 (5 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"357eb03462fee73083cf4529be5f759088d56c688682f3b91d871da1d588a320"}},{"ruleId":"D2","level":"warning","message":{"text":"quarantine.baseProblems (cognitive 20): quarantine.baseProblems has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8285df76298188b9d7fb8104b19a8d57c5bf8c3929f7682408f7d10aa3dff352"}},{"ruleId":"D2","level":"warning","message":{"text":"quarantine.readLedgers (cognitive 20): quarantine.readLedgers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 6 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":"lib/quarantine.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3beea9317c995fa3b8726ca634f4bc8393d8024d24a71c8224ee4b23e055172b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-handoff.cmdVerifyHandoff (cognitive 20): ship-handoff.cmdVerifyHandoff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 7, boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c196537030cc7884a4b55748e37f8e1b464b0f58faf9c39b9551db7346cacf3"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-handoff.cmdReconcile (cognitive 20): ship-handoff.cmdReconcile has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 6. None of this is in the body itself: all 20 points belong to 2 function literals inside it that branch (lines 258, 265). 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":"lib/ship-handoff.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3894bfb3bc60cff89d2ed6417a520c7a23b0dadf5d7434557dd2010e94222cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-prose.withoutExceptionLines (cognitive 20): ship-receipt-prose.withoutExceptionLines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (7 pts), ternaries 4 (nesting depth added 5). 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, 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":"lib/ship-receipt-prose.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d3d677d0fbd605d1b498cf4de76673e608e978908242d4ca668170395ac7ed"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.optionalWrappedType (cognitive 20): main.swift.optionalWrappedType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e423b6d8943c98bf285efa01cf5697e1e9df0fe18dc3ae2a222260bb8160bc20"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b91f4be904bb37822d57b2adb110d4ca0c4e3eed0afcdaae29c2dc0c046a897"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-journal-records.recordMeta (cognitive 19): claude-journal-records.recordMeta has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 7, if/else 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"89397f3f4c48c6b9e495bd1b0474cf553187c07053bed5d72ee9914aad2671d2"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.expressionTail (cognitive 19): redact-patterns.expressionTail has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, 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":"lib/redact-patterns.ts"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"701c665425d8a1036a3e22941fd9875825667fbeda98b377508fd48d2eed8ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"review-depth.nextStep (cognitive 19): review-depth.nextStep has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, ternaries 4 (7 pts), if/else 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2696ebadcf4e0f61bc7aa65062d23adbbbf997cc08911e40316f2bbda2b89251"}},{"ruleId":"D2","level":"warning","message":{"text":"git.untrackedAsAdded (cognitive 19): git.untrackedAsAdded has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e664d53755faeb0826a550aba4df2d66a22607b3b49e8750c0e7fc6aa7ef8b55"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.probe::checkSkillDir (cognitive 19): gstack-design-detect.probe::checkSkillDir has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 2 (3 pts), loops 1, 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. This shape REPEATS in the file: one other method here (gstack-design-detect.probe) 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":"bin/gstack-design-detect.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef13cd0e34882f4e26bee19e191360a0849604fc964f837b78cd75dcbb88274"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-repo-policy-client.repoPolicyTierBatch (cognitive 19): gbrain-repo-policy-client.repoPolicyTierBatch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 4 (5 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"88097b44a115bdbf4e413c201ce0269ee786b69c0764ae1e841d215dba005afa"}},{"ruleId":"D2","level":"warning","message":{"text":"memory-ingest-landing.classifyImport (cognitive 19): memory-ingest-landing.classifyImport has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, ternaries 3, boolean chains 1 (nesting depth added 4). 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":"lib/memory-ingest-landing.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb080c690fa7126c629d62487bc3f92122251efcb661bed7d4948a0a3c31ffc3"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.walkClaudeCodeProjects (cognitive 19): gstack-memory-ingest.walkClaudeCodeProjects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b090244c21126c97f59790b4d0e8794c5145cb97634d15a6933c989246d2e112"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.disambiguateSlugs (cognitive 19): gstack-memory-ingest.disambiguateSlugs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (5 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 7). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f192cc961e241cd87031a5dfcd1c5b6e78165a4225c3f3fee20768e0dc10ed"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-pins.satisfiesOne (cognitive 19): runtime-pins.satisfiesOne has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 4, if/else 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cd3385a62ba99e9f0bdc7f2da50a7ff737fb88f319ca0897b40a7bdd3d43f8"}},{"ruleId":"D2","level":"warning","message":{"text":"file-permissions.restrictDirectoryPermissions (cognitive 19): file-permissions.restrictDirectoryPermissions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 4 (7 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":"browse/src/file-permissions.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b627b0f3313be61b26a22131989df0c5c956bf42048bf963ed8843e9a9e355"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitize-echo.sanitizeEcho (cognitive 19): sanitize-echo.sanitizeEcho has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 17 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":"lib/sanitize-echo.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"911fd6764c2b706232afec0120736896cdc0f3a31faa301c25a658c7388ce1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-agent-control.acquireAgentStateLock (cognitive 19): terminal-agent-control.acquireAgentStateLock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad0273bc90b5423ec09dd1c0c5348b964a6980c215d75fff9be07b509b8539a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runHeadedSupervisor (cognitive 19): cli.runHeadedSupervisor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"807303e0ed70eaf87067ac71014f2aad6d5b3cd02c2465407090fc5809febacf"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-auth-verification.clearCookieTargetStorage (cognitive 19): cookie-auth-verification.clearCookieTargetStorage has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 2 (3 pts), error handling 2 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9883b60ce4499e587237a41f681e907cca339a438a42a0e242a5a772cc8d743d"}},{"ruleId":"D2","level":"warning","message":{"text":"session-tabs.runInSession (cognitive 19): session-tabs.runInSession has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, error handling 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":"browse/src/session-tabs.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2e0b49187daa2d9d2b991c350768cead2e96469cf22652566a5b052209653"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-input-cache.sourceDependencyClosure (cognitive 19): eval-input-cache.sourceDependencyClosure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (visit). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b5fcaf114770642b5c1f33e859d04e6d7e38d837cb4c3ec2c3449d8f05b0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-check.reheadChangelog (cognitive 19): changelog-check.reheadChangelog has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 3, loops 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3ccde70d1bc8e44f8a48085d4bfcbfcce84f27e405c57385fb0d820857efe2"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-fragments.parseFragment (cognitive 19): changelog-fragments.parseFragment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (nesting depth added 5). 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":"lib/changelog-fragments.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd69de1fb7dc85817325b19833e4c44bbab86aa5ba01f4e2685131ecda3ef8c"}},{"ruleId":"D2","level":"warning","message":{"text":"outside-consent.readStoredCodexReviews (cognitive 19): outside-consent.readStoredCodexReviews has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-consent.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d88fdefaae7940925dbbaf66716c68b223e04c43c9851425a49df42d0e4300"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-shadow.shadowSwitch (cognitive 19): autoplan-shadow.shadowSwitch has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 6, 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":"lib/autoplan-shadow.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae9e4323c000bbf22114172b65a32b2e52e879ecd033c3847504084590f2130"}},{"ruleId":"D2","level":"warning","message":{"text":"bin-context.findProjectMarker (cognitive 19): bin-context.findProjectMarker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (6 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":"lib/bin-context.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33d29c9ec2f3992c3c25e83781f601b1375fb9b6ba9408214b4ede82b6cafbd"}},{"ruleId":"D2","level":"warning","message":{"text":"supervise.groupCpuMs (cognitive 19): supervise.groupCpuMs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcbd84c609f0da498e35a7a80446cd841dae3635ab57e1be7ca8c2747087fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"strays.run (cognitive 19): strays.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"lib/pregate/checks/strays.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a01db6d0aca417478a8f070a501e1d35dea1d7269b4570c21eec1e1783c0249"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-record.parseNote (cognitive 19): ship-queue-train-record.parseNote has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8, 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":"crew/lib/ship-queue-train-record.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4888367cb43890a36f7416290b88571f014449117d68053785c19870b9d0b41"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.acceptedReceiptHeads (cognitive 19): ship-queue.acceptedReceiptHeads has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 4 (5 pts) (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee3aca366b95c25b120570bca0eedfc96919173c85a665618efba91b260ba18"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.reproduceGateAhead (cognitive 19): ship-queue.reproduceGateAhead has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d27b870fb6033516a0c914f7c4d8ca7297da0f34cc0a31ccf02dea540c7ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost-replay.formatReport (cognitive 19): gate-cost-replay.formatReport has cognitive complexity 19 (threshold 15). Drivers by points: loops 9 (10 pts), ternaries 3 (6 pts), if/else 3 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9569ee2abf5b83573c860af3dd90612c68350479806ae4d27ce3a2605e26bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cut.verifySecurity (cognitive 19): release-cut.verifySecurity has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 6). Of this number, 16 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":"crew/scripts/release-cut.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cfedc69dcce8c10faeebb75c45ff5d7c1c8834cf54c7b331d90f807cde990c"}},{"ruleId":"D2","level":"warning","message":{"text":"release-cut.cutRelease (cognitive 19): release-cut.cutRelease has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 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":"crew/scripts/release-cut.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"045f18e69e9fa7e629ae662880b5523f0a4c8eb4d009b4a921d7353cd1cc06c1"}},{"ruleId":"D2","level":"warning","message":{"text":"train-backstop.freeze (cognitive 19): train-backstop.freeze has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 4, boolean chains 3 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 8 belong to 2 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":"crew/scripts/train-backstop.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90f2e7be1099eb4b688773afb01c3541ca0277c77421e4aed6d6c56ddab434c"}},{"ruleId":"D2","level":"warning","message":{"text":"auq-error-fallback-hook.isErrorResponse (cognitive 19): auq-error-fallback-hook.isErrorResponse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). Of this number, 16 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":"hosts/claude/hooks/auq-error-fallback-hook.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0229a5bf40b5bd7d518fd795053fce412463f1a02b63c98db4b71d1299f9728c"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-stop-gate.handle (cognitive 19): autoplan-stop-gate.handle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (nesting depth added 1). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 103). 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":"hosts/claude/hooks/autoplan-stop-gate.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a255d1e2c68110f0fcede2658537dbc9b747509043436351929c1db47a6c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"memorable-user-prompt-hook.policyVeto (cognitive 19): memorable-user-prompt-hook.policyVeto has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a490e3cfa5c4753bd30d2d44fdab81f78535d9b3a068495c023e218fe23bfdf"}},{"ruleId":"D2","level":"warning","message":{"text":"gen-accessors.optionalWrappedType (cognitive 19): gen-accessors.optionalWrappedType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5447e0c70ceb39cb31b5f791d6ca8be30a7ffd172799dfe68f35db9461d54194"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.parseSkill (cognitive 19): context-bill.parseSkill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 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":"lib/context-bill.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bbe07946903f7cb6223ce69bdaa02701869e8bd72bbd470e15ddc83b5c31f1"}},{"ruleId":"D2","level":"warning","message":{"text":"context-bill.checkBudget (cognitive 19): context-bill.checkBudget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (7 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"2321b0bcf3e6ab341f1e827c07d18a003c1188ffdc54e40f8b57b2b235f542a3"}},{"ruleId":"D2","level":"warning","message":{"text":"state.repairBundleExpiry (cognitive 19): state.repairBundleExpiry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78ccdbf5aee0e6c28f7cb0cc3a39232ccb674d07aa6b2ea1606131316fa379"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-executor.stagedFileHashes (cognitive 19): preparation-executor.stagedFileHashes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, error handling 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b550b1ad581cc580fd2ac16dfd1f40121c642604b6f8b99798fb60278fae5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryEgressBroker.openTunnel (cognitive 19): RegistryEgressBroker.openTunnel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, error handling 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99fe2c95b5be3baea85e14e8764f38f477b09d121bd6a3d8fd9b75009edbcc7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.scanner (cognitive 19): cli.scanner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (5 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1763). 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":"lib/cso/cli.ts"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8655b8ba235409f9ce4a76c57a936b5ef31d9aaa2792f8dcd6f0faf3fc1db1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.withReplayBundle (cognitive 19): cli.withReplayBundle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 16 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":"lib/cso/cli.ts"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9b955e1caee3c3155f7504a0ff1012c10b08cc4909003f3e085774f230879c"}},{"ruleId":"D2","level":"warning","message":{"text":"design-build.parseInventory (cognitive 19): design-build.parseInventory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 6, ternaries 2, error handling 1, loops 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":"lib/design-build.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8944f91cfc9133296ad5d1046283f4ae0871106eb384d0a2b263459baf4768c8"}},{"ruleId":"D2","level":"warning","message":{"text":"design-build.parseInventory.states (cognitive 19): design-build.parseInventory.states has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f8cc9cc3bb921be493060c9120bfab64fb60c20bd478f13596193b1662f79d"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-deadline.checkedPath (cognitive 19): qa-deadline.checkedPath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, 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":"lib/qa-deadline.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04b1a29b8ea5ca09e2904f5851c876ce2819e37cc38dec3ec6bd922fbb071a9"}},{"ruleId":"D2","level":"warning","message":{"text":"qa-deadline.qaDeadlineMain (cognitive 19): qa-deadline.qaDeadlineMain has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 3 (6 pts), error handling 1 (nesting depth added 4). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 295). 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":"lib/qa-deadline.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e104c282d29aceecbed05779310262d5cc7dabf24f2cfdb396ad30d2a92ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-register.planPayload (cognitive 19): harness-register.planPayload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (6 pts), boolean chains 2, ternaries 2 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc39665b51576bda0665e82e5a99d399e2f1dcaf01eab455c378213788908119"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-register.finishHook (cognitive 19): harness-register.finishHook has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 6, if/else 5 (6 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"294f800a3d91eb3312014da2fde425408dc79e5c12b999eb03d8b95f1dd8e570"}},{"ruleId":"D2","level":"warning","message":{"text":"motion-encode.manifestError (cognitive 19): motion-encode.manifestError has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, 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":"lib/motion-encode.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8696fda358f73f91373c21d9a81182bb0af5ee205af09fbb43e016059d45ee"}},{"ruleId":"D2","level":"warning","message":{"text":"review-evidence.reviewFreshness (cognitive 19): review-evidence.reviewFreshness has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 3 (4 pts) (nesting depth added 1). 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: 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":"lib/review-evidence.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d8982654b28484b1839f57dbdb573f5da3bb98847133c9063de8be4441c168"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.cmdNote (cognitive 19): ship-budget-cli.cmdNote has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 6, if/else 4 (nesting depth added 1). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 398). 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":"lib/ship-budget-cli.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b919885d739d427204aaf34a9e0fbf5ed052ab7e87f46ffeaea3d47786469824"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-patterns.isPropertyRead (cognitive 18): redact-patterns.isPropertyRead has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, if/else 6, ternaries 3 (4 pts), loops 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":"lib/redact-patterns.ts"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97be05d06d7922e363db7be8d0ff1a1872b310709121b083e7fbfc56081216a"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-autoplan-snapshot.methodologyContent (cognitive 18): gstack-autoplan-snapshot.methodologyContent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee26fea97bb56fc83d0fa973c3f311bec5fe486eb222d5c07c8879803ff80205"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.closePacket (cognitive 18): phase-publication-hook.closePacket has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 7, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ee303ee94e7de6d6afcb9538b8fe72013df805172157c676230305c6c53a26"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-helpers.freshDetectEngineTier (cognitive 18): gstack-memory-helpers.freshDetectEngineTier has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 3 (5 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f583ea5e0b831748b1317c94bd8d1dbd22a6e47fec01f7d435395db84557c3b"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-brain-context-load.dispatchList (cognitive 18): gstack-brain-context-load.dispatchList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 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":"bin/gstack-brain-context-load.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"793f5f3e69429386b32a8ce5970ab7da33be593ec1f8b8b9ca71fa57beee1ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"egress-receipt.withLedgerLock (cognitive 18): egress-receipt.withLedgerLock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), error handling 3 (7 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":"lib/egress-receipt.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1887c48e2e6e9000524b017e37d6f04caa74bde028e38cff518af5e0b552c0b5"}},{"ruleId":"D2","level":"warning","message":{"text":"design-md.renderDesignMd (cognitive 18): design-md.renderDesignMd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"746a6b7f87996c1073921ba2d041016bdb5d843f20942226a8789206c9dd8e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-memory-ingest.snapshotTranscriptCheckout (cognitive 18): gstack-memory-ingest.snapshotTranscriptCheckout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, error handling 1, loops 1, ternaries 1 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6495226d52c608efcf026daf9de22cefa745784921a6fb7da91efe9c0bc568a"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowseClient.command (cognitive 18): BrowseClient.command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browse-client.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1ea3087d30854524a9266c39744fef9f1050491a1f2e2b0aee18f75789169f"}},{"ruleId":"D2","level":"warning","message":{"text":"xprotect-heal.launchWithXProtectHeal (cognitive 18): xprotect-heal.launchWithXProtectHeal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (6 pts), error handling 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xprotect-heal.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0180a3013d8e311ce5fba8a2658996de77310783c0a3e534d162bfb9865f417"}},{"ruleId":"D2","level":"warning","message":{"text":"device-emulation.userAgentMetadata (cognitive 18): device-emulation.userAgentMetadata has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10 (17 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":"browse/src/device-emulation.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e423807217dbd1cd0252c7f6cf3100670f2be18fb47a34096db50385fba8358"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.parseSnapshotArgs (cognitive 18): snapshot.parseSnapshotArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). 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":"browse/src/snapshot.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da4b5e9d3c4b6e4495024d57e9f9a8997faeec57befc5f01704f1dd4d4c577d"}},{"ruleId":"D2","level":"warning","message":{"text":"memory-command.formatSnapshotText (cognitive 18): memory-command.formatSnapshotText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/memory-command.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6ce82900c83a6fb29802c29fc7c782bb78a6b1164404172292b9f3b680b4a1"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowseClient.command (cognitive 18): BrowseClient.command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-skills/hackernews-frontpage/_lib/browse-client.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf7e01adb39c61cff17ccbdf35b2312cfbc1bf6cae9ce84213562ea39fb1808"}},{"ruleId":"D2","level":"warning","message":{"text":"recover-receipts.negativesFromRun (cognitive 18): recover-receipts.negativesFromRun has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (nesting depth added 7). Of this number, 13 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":"crew/scripts/recover-receipts.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c2da028a3e772a7b233c07b21a2d3a8c822125bc2cb45b837072241a7d190e"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-check.changelogDamage (cognitive 18): changelog-check.changelogDamage has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (7 pts), ternaries 1 (nesting depth added 9). 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, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea661e58ddbdf571bb7a7ac09d97dce4cb7fe372d24056b56283b38ff35e8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-bundle.buildBundle (cognitive 18): evidence-bundle.buildBundle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 3 (5 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":"lib/evidence-bundle.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f68a3ff90f209e5f8efc733e4c0c1fe0286d9baf5f911b696cb7fe48daddab2"}},{"ruleId":"D2","level":"warning","message":{"text":"restamp.parseUnifiedDiff (cognitive 18): restamp.parseUnifiedDiff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d661d917b0d78a543aab0eedeb59738d9d3b122123b2b0a646e08c4707a60f92"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-gate.challengeDefault (cognitive 18): autoplan-gate.challengeDefault has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 7, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e289a815385fbed24b9bc34a2bd40af435a2d038db87724e4d5cc98cd9a005"}},{"ruleId":"D2","level":"warning","message":{"text":"no-stop.checkNoStop (cognitive 18): no-stop.checkNoStop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (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":"lib/no-stop.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a771ca85205880a29f0073b8dc58f70a686c80d79c453e130cc37980640ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiRunner.run (cognitive 18): ApiRunner.run has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 2, 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":"lib/outside-voice-runner.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a4c5306d2d3281dfd25ab25814b6104141c9ad068ce7abc8e84ad8c5607b67"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-shadow.parsePage (cognitive 18): autoplan-shadow.parsePage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 3 (4 pts), loops 3 (4 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":"lib/autoplan-shadow.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f32594ea216b3b0ccd52c60829cf885ca8505aa75dfa5ef9a5972230177892"}},{"ruleId":"D2","level":"warning","message":{"text":"bin-context.markerIgnoredReason (cognitive 18): bin-context.markerIgnoredReason has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b228b4f8e164cb20eabc40f680225f6a1069ea61b503939dab3fd760ad6dd5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-join.fileRecords (cognitive 18): sealed-join.fileRecords has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (4 pts), boolean chains 3, ternaries 2 (3 pts), 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":"lib/sealed-join.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"965fdec5539ca8140c2109ebce47888b956b7456a8b9f4f777b58b923b348b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-join.changedFiles (cognitive 18): sealed-join.changedFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bff4267c76e43b1ed4b89431875ea7fe1e63ebcbde46b86369579d852ef2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-join.joinFindings (cognitive 18): sealed-join.joinFindings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f765c34de5c2dab4f78d0c6a0ccf38a8a795de468bdf4e6063b6f6390be3d4"}},{"ruleId":"D2","level":"warning","message":{"text":"workflows.outline (cognitive 18): workflows.outline has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (6 pts), boolean chains 4, if/else 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/workflows.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d561e9a1ac183181e3af2d2879628c8ea3b232f894fec313fa01fa7123883961"}},{"ruleId":"D2","level":"warning","message":{"text":"import-graph.dartDirectiveUris (cognitive 18): import-graph.dartDirectiveUris has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"321f148141063cd06e686b588357ea9ffb6079f86da1844a315e721c5353e459"}},{"ruleId":"D2","level":"warning","message":{"text":"docs-only.pathRefusal (cognitive 18): docs-only.pathRefusal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (6 pts), boolean chains 4, 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":"lib/docs-only.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f883ccf6888d6c9053012d45b303caf5e441aacf55cb7c087aac35d34af03bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"lanes.parseSummary (cognitive 18): lanes.parseSummary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81abd4720b54602b6912671ccbd6fe120ca948099a8d22795a3945900f89568"}},{"ruleId":"D2","level":"warning","message":{"text":"secrets.parsePostimages (cognitive 18): secrets.parsePostimages 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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c1d99b9ea005970700a503ab1919107379011fa201d1044e228e56b8297420"}},{"ruleId":"D2","level":"warning","message":{"text":"flaky-exception.flakyDecision (cognitive 18): flaky-exception.flakyDecision has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, ternaries 1 (2 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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22b96c7f4ef594c98e22d11b7f8e2ce9ffa0076e20dbbed38b94e1c6720511c"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt-depth.receiptReviewAtHead (cognitive 18): ship-receipt-depth.receiptReviewAtHead has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 6, if/else 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5702c9d333f9305e4197b9b371c926ad12cdae175481b4242432404b6a07b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-stamp.stampMismatch (cognitive 18): ship-queue-train-stamp.stampMismatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (7 pts), boolean chains 3 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-stamp.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce30951edf29d19fc9cebaca885a01d09b754c7e5488c1c2ca10cc59e5d6368"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.readWorkflowAttempt (cognitive 18): ship-queue-train-gate.readWorkflowAttempt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7bc3f26916ab68440cd4cfaf1e9d8b0542d1f3186f5b57f7e6c472d77846f"}},{"ruleId":"D2","level":"warning","message":{"text":"archive-check.checkThread (cognitive 18): archive-check.checkThread has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5741f325db58f981376b2f4f527fdf4d9ee14ab8b1b73ca9803f7a7b879816a5"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-public.validatePublic (cognitive 18): autoplan-public.validatePublic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-public.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfb5f6b3b5267cb3407cf9c23f4c72d19440f48da8937c2276ca209efe870cf"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-code-windows-job.initializeWindowsReviewJob (cognitive 18): claude-code-windows-job.initializeWindowsReviewJob has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-windows-job.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1758ec90b5a677150671bce49e45ecf0e06962845eedd1eb4b08cfd6631e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicArchiveCache.promote (cognitive 18): PublicArchiveCache.promote has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 4 (5 pts), boolean chains 2 (nesting depth added 3). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 389). 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":"lib/cso/cache.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0620f7c3e4e4cb1f9621b6ebf190c2731d4b3a1a3e55feb450c1e42ce45759f2"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot.boundPath (cognitive 18): snapshot.boundPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, error handling 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":"lib/cso/snapshot.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f29d8dce5d175664a5fa346a523b4961cc393b6cc237fdb34b901fd1241bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.forwarder (cognitive 18): preparation-container.forwarder has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 4). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (copyMetadata). 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":"lib/cso/preparation-container.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"81766270cbcb8e4086ee1c9a6ae670e81582dbafafd6bd6c73c6f95f049a3f34"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.seed (cognitive 18): preparation-container.seed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b691d323331217677864e98c2b3015c2674e85f1d34c6aa8c80944db7c0a23de"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-docker.validateAcquisitionOutput (cognitive 18): preparation-docker.validateAcquisitionOutput has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"99124fcf7acaedfe8914c8f8bf735a0f55b7212a765b6414433724e39bfeb39a"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.preparePatchedSource (cognitive 18): verification.preparePatchedSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"lib/cso/verification.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b8b3bd39dfe69db22eb1e1d23439a5ab74e52d2a061d91bd67d4043d5a542"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.parsePreregDiagnostics (cognitive 18): eval-plan.parsePreregDiagnostics 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":"lib/eval-plan.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ecaffc7fdee88f62f7fb6cc16b6760372fd7f96b2668d8428e03cdb1cfd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-plan.parseCallRow (cognitive 18): eval-plan.parseCallRow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60d6e0b2b3e3931dbb9589ebd148fa3fb3334a7df0f334a0ab07ab1997c5647"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-supabase-provision.cmdCreate (cognitive 18): gbrain-supabase-provision.cmdCreate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c967398f43407139beffe85e4394033fef886340f5a658c74745d2d1501b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"greptile-early.detect (cognitive 18): greptile-early.detect has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 7 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/greptile-early.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfb027a2c7980e3d9bdf1c60275fa3fd2f22c957ba93f502a6fe0a03efb8aab"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.send (cognitive 18): gstack-post.send has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc5769413fbb877f824dfeb76d6222046004e84a260f7fd3634c75214213b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-start-hook.inspectHook (cognitive 18): harness-start-hook.inspectHook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd18c27dfd20a8c09d11ceda9fb47914046864bf7eaa73637f5975bb0dedae5"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-register.withBlock (cognitive 18): harness-register.withBlock has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 3 (4 pts), boolean chains 3 (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":"lib/harness-register.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a37848e3e6e7105dff9f556693accc68cbee1594d3513301cb894cead8c6de5"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state-clean.parseCleanArgs (cognitive 18): repo-state-clean.parseCleanArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1b48c50af317b27396808a5c59c592a4da8289839a57a4bab3d9ae9e9bd0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"review-ledger.parseReply (cognitive 18): review-ledger.parseReply has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 3 (4 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"977b75da4b4868771efc7e983cbca328a7974d9a6947405ce7d78138e6b218fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-patch.zeroHunks (cognitive 18): ship-patch.zeroHunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 3 (5 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":"lib/ship-patch.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"320ffc1cb19ebaa3f23b21498e182ef9a3e9f0aa15cbbd367eedd7b0c589ebc2"}},{"ruleId":"D2","level":"warning","message":{"text":"runaway.emptyWakes (cognitive 18): runaway.emptyWakes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb9e80e2a32ab3001fc08835b328cbef6c9dc3985f210ab7217bb32c2660125"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget-cli.cmdCalls (cognitive 18): ship-budget-cli.cmdCalls has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 4, if/else 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":"lib/ship-budget-cli.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb0d656c60365f1166fc031b004aeec5596ef13da683431c30d27350ca99665"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-journal-records.compactionCycle (cognitive 17): claude-journal-records.compactionCycle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 8). 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":"lib/claude-journal-records.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"27df52b9d4f807bf76111d6c06ddded9af683fb5da742503cdd722a17b47eaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy-mechanical.mechanicalErrors (cognitive 17): ship-policy-mechanical.mechanicalErrors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 2. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 25, 35, 41, \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":"lib/ship-policy-mechanical.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df34e6f871ecd58d063eb671af65888a832c323f85cc75c96522c5838f377a"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy.workflowsGateErrors (cognitive 17): ship-policy.workflowsGateErrors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 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":"lib/ship-policy.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"583603e17f2935edb64a2ab935591eae54f408bc99f465b9bdb14749cf32702b"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy.baseRedErrors (cognitive 17): ship-policy.baseRedErrors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 2). Of this number, 9 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":"lib/ship-policy.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b28208ad14c0ac6e5ed1d0c4ba0d2dc2a6ddba7ef457da9d53cce4523a985c1"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-autoplan-snapshot.sectionHeadings (cognitive 17): gstack-autoplan-snapshot.sectionHeadings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9664bbcb7b28ca33c726bab9fda219f6ead19c18ff07cd5f77207b3b51904464"}},{"ruleId":"D2","level":"warning","message":{"text":"phase-publication-hook.linkedWorktrees (cognitive 17): phase-publication-hook.linkedWorktrees has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, error handling 2, loops 1, ternaries 1 (nesting depth added 4). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab95eb47566b945a6568e966bca571c65290b1ab2df2e803a5c9a02c766f40b6"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-design-detect.writeTop (cognitive 17): gstack-design-detect.writeTop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ccd51197334b3791ef435a834c42038e5513d5a72813e88f94c656ddf1c9f3"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-global-discover.resolveAndDeduplicate (cognitive 17): gstack-global-discover.resolveAndDeduplicate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (4 pts), error handling 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-global-discover.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc8a35340e18588de68074099c49598970687ba01e8b891b2ed7ed8735fc33"}},{"ruleId":"D2","level":"warning","message":{"text":"aside-render.resolveBrowseBin (cognitive 17): aside-render.resolveBrowseBin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (5 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":"lib/aside-render.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3363bdc9255295315ccecbd8ba9d2306f74abdeae1af2877e25ea49d14a91ff"}},{"ruleId":"D2","level":"warning","message":{"text":"url-validation.classifyAddress (cognitive 17): url-validation.classifyAddress has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/url-validation.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b25bc28cebba995a02d532323ec4be23bad6126d6680114d7b4bae27bd23d"}},{"ruleId":"D2","level":"warning","message":{"text":"xprotect-heal.runBoundedChromiumReinstall (cognitive 17): xprotect-heal.runBoundedChromiumReinstall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 5). None of this is in the body itself: all 17 points belong to 4 function literals inside it that branch (lines 269, 287, 251, \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":"browse/src/xprotect-heal.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0bbeb0447c075a97e78269ca6027b1101e3df4b6927ab707f764a4ddce7fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-operation.getCookieProfiles (cognitive 17): cookie-import-operation.getCookieProfiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (5 pts), boolean chains 4, error handling 1 (3 pts), ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (check, a function literal at line 64). 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":"browse/src/cookie-import-operation.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7b6b0720b538a356d080a62591b40aca34fc77c70c8c361683c13f695e8a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-input-cache.buildEvalInputIdentity (cognitive 17): eval-input-cache.buildEvalInputIdentity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bc37d20ab0a8107c8ad6b5f389262e4ec5e3f796e9559300f56c7a214770d9"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-check.mergeChangelogsWithNotes (cognitive 17): changelog-check.mergeChangelogsWithNotes has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 5, if/else 5, ternaries 4 (5 pts), loops 2 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3641ad2940bb9adcd7ccfc45ce225f45d9f852b798045b9f7b888ac9b65744ed"}},{"ruleId":"D2","level":"warning","message":{"text":"approval-record.locate (cognitive 17): approval-record.locate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac5697bc1647eb7f331bd3f8edaac5cfbc9052621f698554f85bfd882641d0"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.spoolGit (cognitive 17): sealed-guard.spoolGit has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 2, if/else 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":"lib/sealed-guard.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3067bee409c8665a5bfe91ccd2c78e5d69abc74cc4a5d8953374852e460da4f"}},{"ruleId":"D2","level":"warning","message":{"text":"install-verdict.verdictFileProblem (cognitive 17): install-verdict.verdictFileProblem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/install-verdict.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9c79a03b223c4933dda40240dc26f03c9da30e76fc7acc3f18046f05d87f52"}},{"ruleId":"D2","level":"warning","message":{"text":"starter.starterPolicy (cognitive 17): starter.starterPolicy has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 5, if/else 2 (3 pts), loops 2 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/starter.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28f973f3b7c3f3c9a6ef85b462acea90064fb05f0e9b673124ffae92ecab72b"}},{"ruleId":"D2","level":"warning","message":{"text":"lanes.runRemote (cognitive 17): lanes.runRemote has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e6cb7544c47bfd40d8eeda00933ed22ff569d894534f52dc922382f93233ff"}},{"ruleId":"D2","level":"warning","message":{"text":"allowlist.applyAllowlist (cognitive 17): allowlist.applyAllowlist has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, ternaries 2 (5 pts), loops 1 (nesting depth added 6). Of this number, 12 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/allowlist.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4be588dd3bfe53c95faac4e8ea2c815a7236906144aae12bfe1f16d876272b9"}},{"ruleId":"D2","level":"warning","message":{"text":"release-stamp.openRelease (cognitive 17): release-stamp.openRelease has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (4 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/release-stamp.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4140ddef62fb079e01d883ef53241e780dc9c3db84141f25e255ad9a3a654c"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-receipt.classifyFiles (cognitive 17): tree-receipt.classifyFiles has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d74b5c9e6203b8803314baca7a8c5bfeb115e034427b9c1113fe7b8b3b2e55"}},{"ruleId":"D2","level":"warning","message":{"text":"banned-terms.addedLines (cognitive 17): banned-terms.addedLines 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":"lib/banned-terms.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00bdbd3577a0e7b9115f0406e62bb917d9ac68d289816c9abd7993bdb04c824"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-dispositions.openShipRunsOn (cognitive 17): gate-dispositions.openShipRunsOn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). 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":"lib/gate-dispositions.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0210748d97fc328209cb0438412989336849121a1c208200ceaa5514575325a"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-dispositions.withGateLock (cognitive 17): gate-dispositions.withGateLock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (5 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":"lib/gate-dispositions.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff70e95fed15fc526a5524e5ee8a096c75fe8894e732c8a869bda3fca765638"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue.stampPreflight (cognitive 17): ship-queue.stampPreflight has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 2). 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: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"lib/ship-queue.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e151960331a280c700a9ecf1cc1165475e99dce276b9b084d2433e88e1de6536"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-wait-github.runGh (cognitive 17): pr-wait-github.runGh has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (8 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait-github.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d65349b46eac65a7352d96f414257ef9044b4c4983bb4e243cf565a3a4aab67"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-land.repair (cognitive 17): ship-queue-land.repair has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d709f0cd5b901e44ab014525fee297bc276198f2a1f22eca1519aa1cec1dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.baseRedAdmission (cognitive 17): ship-queue-train-gate.baseRedAdmission has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6215b5922d0d8d2a20dabe0df168e54c2edaef611f7e7099e4260505f16a4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.runCommands (cognitive 17): ship-queue-train-gate.runCommands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"984141e2d6f00a537fa480a4e2dd7474e37e1af313a45722b8fb9b4bcac60f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"train-gate.trainPrefixes (cognitive 17): train-gate.trainPrefixes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 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":"crew/scripts/train-gate.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c859de2ed001fb167d71c823b394113b651bf71c1de1bed401f3fcc202e959"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-ready.verifyScreen (cognitive 17): ship-queue-train-ready.verifyScreen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, ternaries 3 (5 pts), boolean chains 3, error handling 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b86c1a0cb32ea7f59d7bb14354321d97a28ff2be98d98995fc6af048bfc0f"}},{"ruleId":"D2","level":"warning","message":{"text":"classify.globToRegExp (cognitive 17): classify.globToRegExp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/classify.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4859d83b2fd92e439e73a8f3cf88fa5d7f0bf99c300811b496e303dbb6c3b4e2"}},{"ruleId":"D2","level":"warning","message":{"text":"review-dispatch-compare.legacyShip (cognitive 17): review-dispatch-compare.legacyShip has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (6 pts), loops 4 (5 pts), boolean chains 4, if/else 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":"crew/scripts/review-dispatch-compare.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63394805273dd49ee2e93739bb259835fe574ad73d95f7fd61ee8c1a0813268"}},{"ruleId":"D2","level":"warning","message":{"text":"image-args.resolveImagePaths (cognitive 17): image-args.resolveImagePaths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/image-args.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6280832e01d501a12f4caf8f1b452a32dcb1fecb2d8820140333ba1f3269ef"}},{"ruleId":"D2","level":"warning","message":{"text":"prose-lint.lintFiles (cognitive 17): prose-lint.lintFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/prose-lint.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6868637f321d87b7a1ab4c5dd64b12f5a4de6e1aaa3bf891646336351875ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"base-red.classifyBaseRed (cognitive 17): base-red.classifyBaseRed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 4, ternaries 3 (4 pts) (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/base-red.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d921984a29ac9b00e7f72208d049101c052ea091af74ec750e6cdc03e1e9f69b"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readPrivateJson (cognitive 17): state.readPrivateJson has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, error handling 3 (4 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"622cfcab08b7cb79e435e2f2e1cd0eafea3490431145674001dcc76c1097c34c"}},{"ruleId":"D2","level":"warning","message":{"text":"state.cleanupRun (cognitive 17): state.cleanupRun has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), boolean chains 3, 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":"lib/cso/state.ts"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d686245ca3bc3f4500b5b5068f398d66d03486df0b4e95d65d7837644147407"}},{"ruleId":"D2","level":"warning","message":{"text":"history.token (cognitive 17): history.token has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/history.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a963c9ce2aa66c0a4329ff477112707b1d4b333baf69961ecfa06420644cb9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation.dependencySpecs (cognitive 17): preparation.dependencySpecs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c7b82168d54e0027ca7c2ab419bfe17fb0bb79e0008f5b14707d7ea15c4b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.bindRecheckEvidence.evidence (cognitive 17): cli.bindRecheckEvidence.evidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, error handling 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":"lib/cso/cli.ts"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"07468522347a8742dab41c2687c52d3c90714d1656f8b4e77b75698ba4e5c30a"}},{"ruleId":"D2","level":"warning","message":{"text":"verifier.judgeSecurity (cognitive 17): verifier.judgeSecurity has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (13 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":"lib/cso/verifier.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6982ee7fdcf3ebec85ab70a1a3c6007ba50a291cbb533763cf306eb48636b7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.targetNumber (cognitive 17): gstack-post.targetNumber has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 4, boolean chains 3, 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":"lib/gstack-post.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c9340184e35b3ce8eaf9a41b4b1593c5980602114395a92f2db85ad2c7e27"}},{"ruleId":"D2","level":"warning","message":{"text":"office-hours-review.officeHoursDesignChanges (cognitive 17): office-hours-review.officeHoursDesignChanges has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (4 pts), loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe3eb7545c86e1c9bdd1c086b66dabf1940808851a5690969311c1b2de87ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-shots.buildPage (cognitive 17): pr-shots.buildPage has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 12, boolean chains 3, if/else 2. 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, 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":"lib/pr-shots.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0632172d39160a7c9a0cbfe6122c31204d7a426ac99e2ac142ac3f8eff188c"}},{"ruleId":"D2","level":"warning","message":{"text":"regate.renderRegate (cognitive 17): regate.renderRegate has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (13 pts), loops 2 (3 pts), if/else 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":"lib/pregate/regate.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd21d6e35bff6c9764596b0d3630dbb960a164246e0ccbc7409ee37c12f76a5"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state-clean.applyClean (cognitive 17): repo-state-clean.applyClean has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae97330c81012e795ad97f6afb849316f170c9ba04e4c13920b9494321fba3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state-clean.run (cognitive 17): repo-state-clean.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (3 pts), 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":"lib/repo-state-clean.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"639a4dab0496cc65d94d4866b1dfc997ce8d8ea6394a097caa82faa9a87fc383"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-bill.buildSkillBill (cognitive 17): skill-bill.buildSkillBill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-bill.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ed53f12e988ce0b71b1b8f12e4d3d1bc61481bbb51beb8370a1bef6c72e504"}},{"ruleId":"D2","level":"warning","message":{"text":"image-size.jpegDims (cognitive 17): image-size.jpegDims 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/image-size.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce567ca1fb53c74634c82394d9283a2f01d9a93dadc034d4141030eabe9e4a95"}},{"ruleId":"D2","level":"warning","message":{"text":"init (cognitive 17): init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, error handling 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 8 function items inside it that branch (applyFontSize, a function literal at line 941, a function literal at line 959, \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":"extension/sidepanel-terminal.js"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"066f63f8c47af7135789ca4a84559c894bae8a609ead56f5a09180d5ebf91f45"}},{"ruleId":"D2","level":"warning","message":{"text":"version-source.resolveVersionSource (cognitive 16): version-source.resolveVersionSource has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (5 pts), error handling 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/version-source.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44018708bac5eebf5048fcc9c1ce0bf35154e759fadba2d782900c34cc042cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-policy.docsErrors (cognitive 16): ship-policy.docsErrors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). 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":"lib/ship-policy.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdc655e3364f21b59361a448e688bee8ce9e137563edf3eade245b1daa27c24"}},{"ruleId":"D2","level":"warning","message":{"text":"redact-engine.normalizeOriginal (cognitive 16): redact-engine.normalizeOriginal has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4412c7e3769e82ff899dc32474bbb0d6f6aa3fc4c9c03d58b0bf98e7c4ea6f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"design-md.emitYamlBlock (cognitive 16): design-md.emitYamlBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0b48e61edcda05d6b9025909f49596c4a2f9ed59edcc8cfa6d0275ddfe4587"}},{"ruleId":"D2","level":"warning","message":{"text":"gbrain-sources.ensureSourceRegistered (cognitive 16): gbrain-sources.ensureSourceRegistered has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 180). 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":"lib/gbrain-sources.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"62803c6106fe9fabe66da3ffcc914d315b07c63b6fb61beeedc43ecc811484eb"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-global-discover.parseArgs (cognitive 16): gstack-global-discover.parseArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-global-discover.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4200712b8d40a819f1178449dc49f42e202e697f86b3d520661645557c095b2"}},{"ruleId":"D2","level":"warning","message":{"text":"aside-render.openBrowseTab (cognitive 16): aside-render.openBrowseTab has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (3 pts), boolean chains 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":"lib/aside-render.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fdd9eb0d2787f69e6abb5ac5972396aed04bcac8f12fe524f95eac2eed6573"}},{"ruleId":"D2","level":"warning","message":{"text":"config.ensureStateDir (cognitive 16): config.ensureStateDir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 4 (5 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":"browse/src/config.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b4a47a2ef0af9b22c4a2514f2de77f57eb539f25179a822af0e4a12251ceb4"}},{"ruleId":"D2","level":"warning","message":{"text":"socks-bridge.startSocksBridge.server::onData (cognitive 16): socks-bridge.startSocksBridge.server::onData has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ea4a23c31a385f21a83d8021833bfee1a937eab0b59919d6096a4102fc05f"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy-config.resolveProxy (cognitive 16): proxy-config.resolveProxy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d693d00108e78164709ed6c35c0e5c13bda5eae29cd21a0ee5fa1c8e6b353ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowserManager.recreateContext (cognitive 16): BrowserManager.recreateContext has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 2 (3 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"145027bf928a0c384383b15380be91f5420964ed84d1b907007bfefe7c586c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie-import-browser.openDbFromCopy (cognitive 16): cookie-import-browser.openDbFromCopy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac32be79b1272dd34931673d0721649ca90ce2ef6885a5d629aa66d2cd895231"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-list.renderGate (cognitive 16): gate-list.renderGate has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 6, loops 2, boolean chains 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 139). 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":"lib/gate-list.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3d0710406355055ec62203c2deeafc75ba75048496da721966bfc53e15ac8d"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-budget.applyCapChoices (cognitive 16): autoplan-budget.applyCapChoices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-budget.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c8d0894557519acbae0377b1d318d19a6a3c6392f752f604013dba346815b0"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-gate.planReopen (cognitive 16): autoplan-gate.planReopen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"585094e74e975b5c90cceee45449e94590f785cc34c49a33c1c3fe57b4bf5fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"outside-review-result.withoutCode (cognitive 16): outside-review-result.withoutCode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 203, 210). 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":"lib/outside-review-result.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b6850fb683fb8a2b3d6e9ddc1526ff5950a1a11becfef5c80d7759c3f6cb46"}},{"ruleId":"D2","level":"warning","message":{"text":"headless-artifacts.checkGateSettled (cognitive 16): headless-artifacts.checkGateSettled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"693752ad0ccc904f70e3b3def8a66e8d203b850d6d618f334ea778c7ab3f153f"}},{"ruleId":"D2","level":"warning","message":{"text":"sealed-guard.pathFindings (cognitive 16): sealed-guard.pathFindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, ternaries 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":"lib/sealed-guard.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abbcc0de28ab1a400b8a92a1ec9a48e51897862ecf4f87179c8a79ff118a826"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.cargoModel (cognitive 16): rust.cargoModel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (4 pts), loops 3, error handling 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ab85becede96c4204499a8a68e4c1d20e93a2ac1b08c968b621a22f9af5cad"}},{"ruleId":"D2","level":"warning","message":{"text":"rust.hasCfgTest (cognitive 16): rust.hasCfgTest 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). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"16781c1a971ef8e49c6af9858a8b566450df707a52a59d61b4db30bfe99b36cf"}},{"ruleId":"D2","level":"warning","message":{"text":"lane-selection.laneFileSet (cognitive 16): lane-selection.laneFileSet has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3909fef0d24d77518288fca57eea9bf8573120007652897effbad0e5f6c99404"}},{"ruleId":"D2","level":"warning","message":{"text":"regen.run (cognitive 16): regen.run has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 6, boolean chains 2 (nesting depth added 2). 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":"lib/pregate/checks/regen.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d160a3cdbd8ba05a90c279466fba462d328f43274d21c3bdab59e2d306945"}},{"ruleId":"D2","level":"warning","message":{"text":"secrets.parseAddedLineNumbers (cognitive 16): secrets.parseAddedLineNumbers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/secrets.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"932ea78d568765ab4fc1a0685bf9feee5ac9a140718f642613f3392d3d57a59f"}},{"ruleId":"D2","level":"warning","message":{"text":"issue-links.relatedPrs (cognitive 16): issue-links.relatedPrs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 7). 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":"lib/issue-links.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779edfb93e461d816545a98a15a6646da16373f1d8cf1b448822e7fe5803b19"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-receipt.receiptSummaryLine (cognitive 16): ship-receipt.receiptSummaryLine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, 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":"lib/ship-receipt.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c647533d8ec9a57d8d782dda0772732ecae51ba65c5f646f5344e259fc5a82"}},{"ruleId":"D2","level":"warning","message":{"text":"review-collect.shebangCandidates (cognitive 16): review-collect.shebangCandidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee628eda4577da41b615afe31c674ea0687fbced8576d99615fdfea6c344752"}},{"ruleId":"D2","level":"warning","message":{"text":"review-exclude.pathReason (cognitive 16): review-exclude.pathReason has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 4, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12e5617c9f02c0e4cea77312bfbd9182a8838fc073e4c363a771b2b22b1243"}},{"ruleId":"D2","level":"warning","message":{"text":"review-platform.platformReviewAt (cognitive 16): review-platform.platformReviewAt has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 5, if/else 3, 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":"lib/review-platform.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ff7cbd33633a649298fed0a86cdf5e67fbaac0f3ac1776a469539d769cff6c"}},{"ruleId":"D2","level":"warning","message":{"text":"pr-wait.resolveTarget (cognitive 16): pr-wait.resolveTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 2 (6 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d111fefe34867424fa8fa278c707b6efc4254a5494e15a290beed12105b8588"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-queue-train-gate.classifyWorkflowRun (cognitive 16): ship-queue-train-gate.classifyWorkflowRun has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3a1223802a98690cb296358dafbf71d4c58a9228bade9dff5375b216984c1"}},{"ruleId":"D2","level":"warning","message":{"text":"train-gate.plannedCases (cognitive 16): train-gate.plannedCases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb1c1e6c35f89b6af3bfbc867ec9f5c20c421e75cb817475580cef0b2d9fb46"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-recheck.planRecheck (cognitive 16): ship-recheck.planRecheck has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-recheck.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa5565ad3e3e67d42c74ac7238fdd7056a574e62b7ab68e8e6ca5a16f29eb31"}},{"ruleId":"D2","level":"warning","message":{"text":"gate-cost-replay.listRunsByDay (cognitive 16): gate-cost-replay.listRunsByDay has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7288826a6d631774438733f8620443d63bcb2c0294e022654b425b68e364aef3"}},{"ruleId":"D2","level":"warning","message":{"text":"measure-journal-read.main (cognitive 16): measure-journal-read.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 3 (5 pts), boolean chains 3, ternaries 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/measure-journal-read.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a2e2680ddf10b2f4a56c49f1d868b4cd9c2d930a75dc3131ba4f06a3901da2"}},{"ruleId":"D2","level":"warning","message":{"text":"train-backstop.rewriteFreeze (cognitive 16): train-backstop.rewriteFreeze has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd89f65f514de4b4579e6796a50486d234e0432aafc41f2127d92a7a87e539d"}},{"ruleId":"D2","level":"warning","message":{"text":"persist.persistImage (cognitive 16): persist.persistImage has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/persist.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0047426fdaf01fea3c38b383f879af29e8cfb53d1d3bb825b31d9f642b9408"}},{"ruleId":"D2","level":"warning","message":{"text":"inspector.onClick (cognitive 16): inspector.onClick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59e4f1f114f86b20925ffcebd1c8cc0fc9132777efbfee0a1f4f22e2ced4c35"}},{"ruleId":"D2","level":"warning","message":{"text":"sidepanel.renderRule (cognitive 16): sidepanel.renderRule has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48f446b260f37aef4bfe69e11898f587e66f1b19296af9c0e9c6ba63769c013"}},{"ruleId":"D2","level":"warning","message":{"text":"hook-log.logHookError (cognitive 16): hook-log.logHookError has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/hook-log.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"77646db78e730377643cefe17cd604d8b8e110c0c6ae193a610c292cad49db67"}},{"ruleId":"D2","level":"warning","message":{"text":"ceo-review-gate.handle (cognitive 16): ceo-review-gate.handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 3, error handling 1. Of this number, 10 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/ceo-review-gate.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"328af159c7ea10c315e579c3dffe339f1edd341e411388e48aceb3b7cc2cb802"}},{"ruleId":"D2","level":"warning","message":{"text":"devicectl.parseLaunchEnv (cognitive 16): devicectl.parseLaunchEnv has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (4 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":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"289f63d1987b1abf8c38fdd8b1e2e2c81f3f4ee9f3bc67989628e29510d61c32"}},{"ruleId":"D2","level":"warning","message":{"text":"tunnel-bootstrap.recoverTunnel (cognitive 16): tunnel-bootstrap.recoverTunnel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 3, ternaries 2 (3 pts), error handling 2 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. 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":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c33e2938b5ed4759f1fb4753e50c100395f3e9a73eff4bd2b2b3f127a7bc5d8"}},{"ruleId":"D2","level":"warning","message":{"text":"autoplan-owner-words.pass (cognitive 16): autoplan-owner-words.pass has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 pts) (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7af5cca0a1a3648d47b41bd6bd76b43d54a0e3f77e4dd998a3eacf75522a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"state.hasPendingWatchdogCleanup::walk (cognitive 16): state.hasPendingWatchdogCleanup::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 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":"lib/cso/state.ts"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e672547f8ebb65a4c40ebeb9d2c893e3e62cf28797260db14d46b065d336e73"}},{"ruleId":"D2","level":"warning","message":{"text":"admission.reclaimSlot (cognitive 16): admission.reclaimSlot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6fcde8ebeaeb7820f20ff4c70f3c1b1ced5c6c4463861d2c439da47828081e"}},{"ruleId":"D2","level":"warning","message":{"text":"admission.release (cognitive 16): admission.release 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). 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":"lib/cso/admission.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1725f1bc81caa938fe4ea844dd771c944600ce1647d1967b80545b33ee84fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"bounded-file.readBoundedStable (cognitive 16): bounded-file.readBoundedStable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, error handling 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":"lib/cso/bounded-file.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f29e624a9dbaeaf38291db129a8b89f96bae51a0610778e939ce8d6859e931"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicArchiveCache.copyAndHash (cognitive 16): PublicArchiveCache.copyAndHash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83ec5cb65ed37c3e842a49ab8dd9f81b8e5a73bd4edce39a59cf013c506d74f"}},{"ruleId":"D2","level":"warning","message":{"text":"history.historyForPath (cognitive 16): history.historyForPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 4). 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":"lib/cso/history.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20a1ec73549ef303b09c7454f6b0e8db23f0d9804fd9ceacc569dfd2e9bea72"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-catalog.assertRuntimeCompatible (cognitive 16): runtime-catalog.assertRuntimeCompatible has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/runtime-catalog.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"911e856eaa7e786c7506c63b932dfadc9bbb6eae1a2dcfd646e162cba908253e"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-container.main (cognitive 16): preparation-container.main 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":"lib/cso/preparation-container.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc47720acc5c19281f807206126259fcc6dcb1046eb9e72d96d31074fe40c06"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-docker.copyPreparedBlob (cognitive 16): preparation-docker.copyPreparedBlob has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"170a694186c5ca963b9e2cfda41187651b98a5e18d950fe2692af4c2f15b48dd"}},{"ruleId":"D2","level":"warning","message":{"text":"preparation-docker.supervisePreparedCall.dispose (cognitive 16): preparation-docker.supervisePreparedCall.dispose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6b515bfa7ca934a9a6c4f941bc3a1c3bb36bf193010e785c3b9e7dfd366e26"}},{"ruleId":"D2","level":"warning","message":{"text":"scanners.sarifBaseDir (cognitive 16): scanners.sarifBaseDir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc4059b4a0666282a6b78d402b0730fe308d575c0f5b9f42019e8fcfb299ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner-executor.validateScannerRequest::inspect (cognitive 16): scanner-executor.validateScannerRequest::inspect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (scanner-executor.validateScannerRequest) 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11b163cd6926c7fb9132381ed363b26c8e8b36ad8e0d5097b81b9d0a1ca77f4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.validateBoundRecheckClaim.evidence (cognitive 16): cli.validateBoundRecheckClaim.evidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6758c951eaef45b9a7536621e2ccdc713c291b3aaf201c3207989f0c36baf6"}},{"ruleId":"D2","level":"warning","message":{"text":"dx-error-capture.dxErrorCaptureMain (cognitive 16): dx-error-capture.dxErrorCaptureMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 2, error handling 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, 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":"lib/dx-error-capture.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"09111c4206775916b216be056ad6e135016e81d34c939260f2afbf9fcfca6c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"junit.readCase (cognitive 16): junit.readCase has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/junit.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f170b55ce43826765b9f71c333a9f57341032881a57636c11164750173928ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-decision.validateDecide (cognitive 16): gstack-decision.validateDecide has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-decision.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a51b1a0e03ee4b94b9b18afd87bbba511d48b6868fcee83466ea9851b46444"}},{"ruleId":"D2","level":"warning","message":{"text":"gstack-post.receiptDigitTokens (cognitive 16): gstack-post.receiptDigitTokens has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 1 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f059d9f3741c494f013bb2789111fd370bfb06ef84db00d2f640bdb3add195"}},{"ruleId":"D2","level":"warning","message":{"text":"office-hours-review.renderOfficeHoursReview (cognitive 16): office-hours-review.renderOfficeHoursReview has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5, 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":"lib/office-hours-review.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"878a07788d44264447db813e017bd7862e5545992d082153950895c1fbcc4948"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state-clean.candidates (cognitive 16): repo-state-clean.candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"efae79abc5e121e244393dacbf3f5079cb78fd21bb5ecef52e458d17662a18ea"}},{"ruleId":"D2","level":"warning","message":{"text":"review-bots.record (cognitive 16): review-bots.record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 3 (4 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: 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":"lib/review-bots.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ad2432c35745c56350b85e2fbe2b1411bf14a8189df54aacdc133bc0f5e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-bin-common.laneLine (cognitive 16): ship-bin-common.laneLine has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-bin-common.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ce8bcfd26983740387cfc3bc2cacffa7e91808e1c58d21c6ce93c6f8ac446c"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-budget.admitReviewStart (cognitive 16): ship-budget.admitReviewStart has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 5 (nesting depth added 3). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 576). 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":"lib/ship-budget.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d048178df0d534747b3a51e5c714d2c03d0d7ffd88ec65a85c6270cd907b7aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ship-preflight.tests (cognitive 16): ship-preflight.tests has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), loops 3 (5 pts), if/else 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":"lib/ship-preflight.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a1bcc47a8aa054f99a55a58c00ca2dce682395d44177f37655d43d09e096d4"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 16): cli.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/cli.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5629bd9e74d114006bbfe08858a5ee225b15c9f45e56593f2a25438acd78a8"}},{"ruleId":"D2","level":"warning","message":{"text":"modelOf (cognitive 16): modelOf has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, ternaries 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":"lib/capy-review-pass.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75dfa73a4cc275cce970cd2f25f89e52325b09c0acc3b4d03f5d5a7913ac8b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: write-commands.handleWriteCommand: FunctionTooLong \u2014 handleWriteCommand runs 873 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 773 over it, 8.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32ddd58594a18ff6a57c330b6eb36de60616f2144349e883ed91cb6d6a983b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: meta-commands.handleMetaCommand: FunctionTooLong \u2014 handleMetaCommand runs 521 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 421 over it, 5.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":"browse/src/meta-commands.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb77a16f61c0849ebf4298c264768016774b5157989d791f4bae6af03e6b774"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/cli.ts: FileTooLong \u2014 2508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2008 over it, 5.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":"lib/cso/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"252f2fe9cdf614d7ad4f87d299a71283410201539639fa07b01ea9a88ec027ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/state.ts: FileTooLong \u2014 2164 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1664 over it, 4.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b00b7879fba4551fb9f314826589a0e644d3e9e6460f1c473d7132bc3c03be3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/verification.ts: FileTooLong \u2014 1869 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1369 over it, 3.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":"lib/cso/verification.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f747d2c93458850ae86836e7d030e467cdfafda82cc6c6c00abe75730b7f8432"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: read-commands.handleReadCommand: FunctionTooLong \u2014 handleReadCommand runs 330 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 230 over it, 3.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":"browse/src/read-commands.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"57703be682b4ffde2c7d7e69863025ac61d96d038eab41913d368e9b0a36e24f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verification.verifyRepair: FunctionTooLong \u2014 verifyRepair runs 310 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 210 over it, 3.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a982dca3b0d7c1ca6f2848da7c305844c9dc0d0278fe007103e4b30083e26a4a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BrowserManager: TooManyMethods \u2014 89 methods. The bar is 30 methods; this is 59 over it, 2.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0befbbcdfb6f6354a0b667ef3ab3dd23babd9e7ecd758a2fac5a99a98e4276cb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TabScope: ClassTooLong \u2014 1142 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 742 over it, 2.86\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2d70e036d9ef7647dee00bb32f8191111a569cb90b4edb12e0e65227d47f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/preparation-docker.ts: FileTooLong \u2014 1421 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 921 over it, 2.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b00236800ccd492bf3a5af4070285352286fe113fa87d9902e0e4ab8070574"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.main: FunctionTooLong \u2014 main runs 262 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"411f5fdabc5243d3e454becb39bbeaa8bdf8e90840ebbfe4baebd554c80c6b8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/preparation-executor.ts: FileTooLong \u2014 1285 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 785 over it, 2.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":"lib/cso/preparation-executor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11da716fbabf308bc11be8f2a4b2a46ed1e992f798451ca60956a12de10a0460"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scanners.scannerPlans: FunctionTooLong \u2014 scannerPlans runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.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":"lib/cso/scanners.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6e7eae4fb8814efb757a69061e1a744adcd6c283db5088fc7378746977f0c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/browser-manager.ts: FileTooLong \u2014 1273 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: TabScope (338-2549). The bar is 500 significant lines; this is 773 over it, 2.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba76a1d92d9c17985e8eae996c72eeb3c871601cf1a6baedfe27c4791d18ec4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.ts: FileTooLong \u2014 1267 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 767 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a93ea73c29fbf67f371647de700a959971524b275475de6973247df3d79522"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verification.certify: FunctionTooLong \u2014 certify 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":"lib/cso/verification.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a4c159f47b0056b054c3e3190e2d55e327f08d04b59fa13340ff6141e41794"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DockerGroup.createContainer: MethodTooLong \u2014 createContainer runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa2b245b399cf8f20d2ae134d18e79bb0d088cf40ddea5490bb38f643f9124"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verification.validateRepairBundle: FunctionTooLong \u2014 validateRepairBundle runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bc3d0fd01399068b69b547c1039eb8cd71b1cf3d6a20c8835352df51ef567f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.ts: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 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":"browse/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d160a5991013978b68ff3f0c74d6b38e05b69a8255022890ff4edd6f0e8393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/preparation.ts: FileTooLong \u2014 1018 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 518 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca88448c2ce887b57e0c64cd7b08531ef40c8efb210bb80d956d43024ab80c56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparationExecutor.acquire: MethodTooLong \u2014 acquire 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabed6b259b9a54f7ace01ad445e4db4bd1032bcfaeaf4cb3d20f1250abe7df6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/snapshot.ts: FileTooLong \u2014 981 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 481 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2a7a469cd12bbe6d8a58cf73617d94db05eb6686c41477153ec4505a092b16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: server.buildFetchHandler: FunctionTooLong \u2014 buildFetchHandler runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada8dcf2a763a79ab712fbfd035d26051dcff70d21547f7318bf68b288370982"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/write-commands.ts: FileTooLong \u2014 971 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: handleWriteCommand (136-1434). The bar is 500 significant lines; this is 471 over it, 1.94\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bec48347429fdfa84a7896ad460365f87612452200a67322a7c180c6db91109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/preparation-container.ts: FileTooLong \u2014 946 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 446 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd4d2fd47ca5ec186cab12322257d91bbff6280d1f2cb9a20df5f329bbbcf13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: server.start: FunctionTooLong \u2014 start runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"763fa7a438d5b33888d9d6d049d858cb56cabe9d0e36d8d55f32ea115b3c98c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: terminal-agent.buildServer: FunctionTooLong \u2014 buildServer runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1169ab3ce27c48c18b3ff2dd6dcd405d0bd91aa89549ac06220c2193bb115e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/docker.ts: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: DockerGroup (458-1134). The bar is 500 significant lines; this is 434 over it, 1.87\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":"lib/cso/docker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a2c44a3a16a001112b25a3a6a316f867ee7a19711ca17f9a4cfc66e97b7f13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension/sidepanel.js: FileTooLong \u2014 914 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 414 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc4c6edeb37c4901508bab6408b719f921a84b3e53badf79c6e0375e5b4817"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/contracts.ts: FileTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 409 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38747fc484667ac152f546eadcd8465a46232ff4a03c9950bc19365a136e5bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verification.canonicalStartPlan: FunctionTooLong \u2014 canonicalStartPlan runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5707ce0d8f640eb9a1256fb0f7620eb5ae171ee7202ac03ead024f503263964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/redact-patterns.ts: FileTooLong \u2014 897 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 397 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9c2909ec4368c827eefc69e26a9b9e2088ff829677542c0887711c7dede4b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/context-bill.ts: FileTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 391 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":"lib/context-bill.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda07c06398a0c0421a8c4084250e7c110050a5e87bd751f3829eddf5cd09851"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.verify: FunctionTooLong \u2014 verify 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":"lib/cso/cli.ts"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d556baa3f6c77268167c776c1fcdb1f4c2966cd78f625ad646f4eb4a3cb4e40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.replay: FunctionTooLong \u2014 replay 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":"lib/cso/cli.ts"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c63ce6fb75df1848a2e5c90092e65103577812b1898db9aa6e685f127f1528"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: image-provisioning.provisionCatalogImages: FunctionTooLong \u2014 provisionCatalogImages 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":"lib/cso/image-provisioning.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d469e233ebb4236e58dd22b7b004b34f48ae0aface202ad24d254395e2b5c3e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/scanners.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":"lib/cso/scanners.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5a72f92504115f3e29dc219ad4d94074b8d22a5eaf9baaea8cc7ece10f0126"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DockerPreparationSandboxRunner.prepareOffline: MethodTooLong \u2014 prepareOffline runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e10cdf55fecb9d862f37abfade5ecc71d9673c00774cbe425c8b34bfc8cc59d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/cache.ts: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: PublicArchiveCache (346-1020). The bar is 500 significant lines; this is 311 over it, 1.62\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":"lib/cso/cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56710a84cc5c9549c09f6e3285ba8359238f42af2e39692fe17fdfcdeccf843"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime-catalog.validateRuntimeCatalog: FunctionTooLong \u2014 validateRuntimeCatalog 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":"lib/cso/runtime-catalog.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee9bf518165131de77f04a136b78ac5c7b98895fffcbc4ded4dcd59864ec2c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scanner-executor.createDockerScannerRunner: FunctionTooLong \u2014 createDockerScannerRunner runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d96772d5fad39b0e8ff6136421423fb25a9c2e7b9771fea45bc342d278046d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cookie-picker-routes.handleCookiePickerRoute: FunctionTooLong \u2014 handleCookiePickerRoute 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":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76970d3f98cdfb4b9ac01ef5263d0ceb7787a09cd61f514c55fbf739dfb9c3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DockerPreparationSandboxRunner.acquire: MethodTooLong \u2014 acquire runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdffc18ab0a954040f989731a94d00845469970884cab6b3a11249cc6082fd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/scanner-executor.ts: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e21457b422f4667f617843d68ad705bd70eb06a588266ea2e61ce9597e8725"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrowserManager.launchHeaded: MethodTooLong \u2014 launchHeaded runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f350d180cde41942337088475728313e9aa65bb48408b5290bbc09afcfd080f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.scanRunLeases: FunctionTooLong \u2014 scanRunLeases runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7877d8a434857a4a6c027ae2766f554ed4145c3fef7ce0a99d3b7510e1f92e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/meta-commands.ts: FileTooLong \u2014 739 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: handleMetaCommand (323-1177). The bar is 500 significant lines; this is 239 over it, 1.48\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4e2c18875c828cb8359dbc45f461cc7cc129ad315af2d49880f3e65369e136"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.doctor: FunctionTooLong \u2014 doctor 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":"lib/cso/cli.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"116081182500dfc35b486e7c3a1f67b7a48b3eee942b33d0211805abf062d13d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verification.canonicalTestPlan: FunctionTooLong \u2014 canonicalTestPlan runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca31132b31418d7a72c279f3931acdc6bb8b391e6ac46b4f68adb3d03cf423b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gallery.generateGalleryHtml: FunctionTooLong \u2014 generateGalleryHtml runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/gallery.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9768d92046c149e8b2c4096255f041598041f226293a6d5a71eeeb4e803c875b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.preparedVerificationExecutor: FunctionTooLong \u2014 preparedVerificationExecutor runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc6439b100ed1da88b57e86b2ffd7b232690edf36a2ed04187a8c03052225a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 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":"design/src/cli.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23cb3f4aadfacc21f64b07b991aad6796b1decf944adf72c3a634dcf5feed1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.Deno.serve(): FunctionTooLong \u2014 Deno.serve() 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":"supabase/functions/community-pulse/index.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b57d365e7bcd46dd7997662f721ccf97611bec197a6d90cf8fc197a46940cd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DockerGroup: ClassTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 166 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b144654a977a6123bffa26bc428f7c992504de1b4b33bd760359ed3f6a68ec74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparationExecutor.prepareOffline: MethodTooLong \u2014 prepareOffline runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"464b1b4c4a7335f1ee7fdb2f66fa3a0f4c4065263a823c1985d52638d96c9399"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-docker.superviseRegistrySocket: FunctionTooLong \u2014 superviseRegistrySocket runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a321d3a91286c44175289b7269f631bad82de84023680ad6774159beb77b3e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PublicArchiveCache: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 149 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1abd5a7f450c08230a8b77343b6529953a46fddad96e94fac61681831041458"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/ship-release.ts: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 172 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8150d1ba2c8dc55e00b523f82c95180c5e24eee8e5baab46256deb6201395274"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ship-queue-land-direct.landDirect: FunctionTooLong \u2014 landDirect 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"117cec836a3bd4cfd4161e9e52d88fecdfddca273ac7193f539e7049b651d39a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-docker.materializePreparedExport: FunctionTooLong \u2014 materializePreparedExport runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3909f64efdf41745cb68e744740ff8a85899e4671629fdfb01d8a7a0e047cd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-executor.treeManifest: FunctionTooLong \u2014 treeManifest runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ab4d261740df7b4712262268fade8cbac0505e7179f891938363f2f3146f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/witness.ts: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f08306abb44b155f9fd77c7c5e9e65f8344d260ec27af73046ee855d7225cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.start: FunctionTooLong \u2014 start runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c59f781ae8ef3eb830432e6571410a90ee8c272a11c91f7e030b0abd9f20965"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scanners.parseResults: FunctionTooLong \u2014 parseResults runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d046bd13a1658e94c41e38feac15c60ba009d5171999fb42ecf76f7a9480abe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gen-accessors.ts: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54657bf79180e64eb6dd63d8e871928b5557ca801044545070514a0075840d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DockerPreparationSandboxRunner: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 98 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb53dd0c9c7cb3f92c5d97c4a140ab6efb7315418c478657f9b84f3a75fa8d1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/terminal-agent.ts: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f00abc873997d3ac632deaad10b802c38e7cbb770eb80a0d0feb6282fbf01d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.preparedVerificationExecutor.observe: FunctionTooLong \u2014 preparedVerificationExecutor.observe 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":"lib/cso/cli.ts"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e107be0201152a0bbb087d77d727cc8b4a870e0357b64f05ca3081ed21fb37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: orchestrator.generate: FunctionTooLong \u2014 generate 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":"make-pdf/src/orchestrator.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083fea7d5a962ec14d10c4b80f0c4860cd4b1b5abcbefd0ff3284de9138fd73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cookie-import-browser.ts: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b150ed61a9ab1dc7dce8b5c20da8f019e568dde0306ea9655ebcbf6c78d3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.handlePairAgent: FunctionTooLong \u2014 handlePairAgent runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"304dc4f95e674dbae1caca594fc09db5f0ca1040db80e3499316044d14e525b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: review-brief.unquote: FunctionTooLong \u2014 unquote runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-brief.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1af37bd4b81bdfa6722b07c0d5a89e8e7640ca5c876040bb66b3e21e8f5013"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.retention: FunctionTooLong \u2014 retention 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":"lib/cso/state.ts"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62622cbfb8d97ed5a3ba37250044d807c1bf536194bc98dc64b6697d68f7ccc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: witness.testExecutionSummary: FunctionTooLong \u2014 testExecutionSummary 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":"lib/cso/witness.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"307fd5c4bbefb092abff3873f78c8b1303fe64558cfda01c4f7a949e9ceef82b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sidepanel-terminal.forceRestart: FunctionTooLong \u2014 forceRestart 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":"extension/sidepanel-terminal.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d2a65eb4ca392d48ea01696b10063c004434261dfe931132f80fd04ca3e4d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-executor.validateClosure: FunctionTooLong \u2014 validateClosure 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0201875d54c3276d6e0fd6a62274dc6dae388732555390f88a24287669ee6eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/restamp.ts: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab6905d3ab6666f6a14b908d803ea45154a401bf8e1488d8e035d96dbbe8ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gate-reuse.findReusableGate: FunctionTooLong \u2014 findReusableGate runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1b63f9bdefc8e44038219a15b41e83d0c6312ed85bf7fd89e234f7b597268d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.recoveryJson: FunctionTooLong \u2014 recoveryJson runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fb7d807eeacda2ac055277219ee5b107723584c641f8b82f4df54384995661"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-container.manifest: FunctionTooLong \u2014 manifest runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e509fa313a041ee0e3d6f63f8aeb0bb67f13b24083f1f4db027fdb188245d7af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: verification.directPackageTest: FunctionTooLong \u2014 directPackageTest runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4d3f740ca6d02089e583f434f5c4b9ed62298c48185e95af245c0e853c54f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cso/process.ts: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d860f642d129cd49f0839f3e607c49e724ad7e3a910da7aaa10ce2a247a925e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrowserManager.promoteToHeaded: MethodTooLong \u2014 promoteToHeaded 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":"browse/src/browser-manager.ts"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6ec86c0ce11b7fe62f7a71e81f17b3fbd8222be7d4d5adc1ecd116781402c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension/sidepanel-terminal.js: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1409dde022c21dd62bb7bebdc64d01be8d0960efde7ecda0daedcfb740f1d0b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-container.createPreparedExport: FunctionTooLong \u2014 createPreparedExport 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":"lib/cso/preparation-container.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5f5630334b44b6a89a3cd3dc637655bd98f7f7f3deb3eeeff74bfc498e8405"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/design-catalog.ts: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1f7bcdc2a94135a1dfae498e290c39d4ca26b07e0e2f7cceeaf9899d305ce5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: claude-public-transcript.readPlanCountTranscript: FunctionTooLong \u2014 readPlanCountTranscript runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-public-transcript.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebac77bc992b92eeb96d0e026a10b93c0077486a91494258941cb07c8b6b7c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/eval-plan.ts: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b92bff7c6a68dc0cef5ae7677a124c644d9b6caeefc93e84538c41b969e9b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/harness-register.ts: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87023fe2efb18d33fd930107d114a1b719ce855343c876e868b15de900ad94c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stealth.buildStealthScript: FunctionTooLong \u2014 buildStealthScript runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/stealth.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8739f2aac6b801d8ce8338df0185fb671b79d81f8911975f3c7a3ae627af3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tunnel-bootstrap.bootstrapTunnel: FunctionTooLong \u2014 bootstrapTunnel runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0ea671ca0ab52a3d8fc5eb0efe0e72aac5fc464e9a2502b8f2979e68b9be2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scanners.parseSarif: FunctionTooLong \u2014 parseSarif runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"3734326a0d3c5fd6af416f230ff8f6f61d766f9150aed31ae8b712ed9284d1f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/ship-policy.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":"lib/ship-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"464ae4df83a3f17991e607646cb1358059a880bc832109abbeacaced202ca890"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: preparation-container.extractNpmArchive: FunctionTooLong \u2014 extractNpmArchive 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":"lib/cso/preparation-container.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bf2733c36b719c6064dcddcb72a6d5e996df6478b2c3b64fe92bed36896f6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/model-policy.ts: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073897cdec0a3f1274ffb6eec0a660a68f89e2c18c1675b78111839d5226202"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: serve.serve: FunctionTooLong \u2014 serve runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"573f8834e04679383b0e245d910b34604ac29dd33f102b5a238d61cea4ee4e4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: claude-code-migration.migrateClaudeCodeSkills: FunctionTooLong \u2014 migrateClaudeCodeSkills runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eada9fa400e77a9c447927dcaf049bfdd814068c2bfa2d0bc4a0db9cf730ce7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: socks-bridge.startSocksBridge: FunctionTooLong \u2014 startSocksBridge runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"31acc569f57fd2271f0ea2e6bd955d23239a9c0e308edfe388ac60fca2f21311"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/ship-queue-train.ts: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"470703d33475841f780e358da022a850653b39fc1152611a8e63e40d77015500"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: claude-code.runClaudeCode: FunctionTooLong \u2014 runClaudeCode runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca3e873009fefdbbbd1fb415cd987dd340d4a30910a084bb46124c811379443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagram-prepass.ts: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58f73e6b5910be961063f6d5e2a49a03cfb46c43165866307116e24ac47d456"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BrowserManager (LCOM4 4): BrowserManager\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"589025c071e8b324549b4cec26e4a21efabe05891b0aff03e57f01c5599ea199"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: needs Aside: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-design.test.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e259531975e610a11df06b4cfb04adbca22de64ab52337996401c89c3297b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-routing-e2e.test.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2181c578572b4f1137e50d8fa367f85329eb685dc6872072a3f154d427d7bc40"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: no local \u0060claude\u0060 binary on PATH \u2014 cannot pin for harness parity: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/overlay-case.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b10a370acd7fd387378b4529ad340dce53d48306f4b74430e210e145e8eb5b1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: skipped: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/shard-equivalence/skip.fixture.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a189dde1172cdaa0f2e5a366394216cd26219432c286325993ad19a5de8de66"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: every expected interactive skill still ships the AUQ format block: 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":"test/auq-format-always-loaded.test.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b771d9ffdd6e352b7dfc84e0ab6fd5565277064e8480f620f5e17f9d02da367c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${skill}: full AUQ format spec present in always-loaded SKILL.md: 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":"test/auq-format-always-loaded.test.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab757b4819064291ed644887fdd246ef066831e0c0c2f85db5d9c132456b200"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${skill}: per-skill AUQ rules survive in skeleton\u002Bsections union: 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":"test/auq-format-always-loaded.test.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2452fededfda3c257e06c1702cb899b947e242b66cb995332e645422ec9800ce"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: cleanup: 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":"test/compare-pr-version.test.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd163c14e6097df00713b1490cfd333d8da884f9ee972a320419ca92e18e628"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: tolerates the directory already existing: 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":"test/fs-utils.test.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3686de69255b02cbb0a9e935717c21cf6958e5dc6ee141df111a50cfc656433"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: templates with parameterized resolvers pass unresolved check: 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":"test/gen-skill-docs.test.ts"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b08fc5742e584622d1c5e10af2c832711c628b52078ee3b6dbb0da779053f7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no generated SKILL.md contains find with -delete flag: 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":"test/gen-skill-docs.test.ts"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9741e1a263de0ad89011684e2204fc7e892f0d8f6935a26da98037deac233a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: every DEFAULTS key is read by code or listed as prose-only: 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":"test/gstack-config-defaults.test.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd7ba9e471f2144df6e63387f29ee218485caaf0fa15a43d0d9d3edeff6b5da"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: seal validates the saved verdict and prints the receipt that check requires: 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":"test/office-hours-review.test.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7558eaf33d541dd1fd86ad67016efb42276423d2f80be899a88038bfee790f6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no resolver or template hand-writes the failure bullets: 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":"test/outside-voice-failure-policy.test.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b142eca2cdafba66346614edcfa9bd013327883924624a25586a1ff28f7178"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: capturedFromCommit is on the allowlist (rejects ad-hoc regeneration): 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":"test/parity-baseline-integrity.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e039b694000be332181f8290b2b309d853df2430364e6207dfd29c30d9548d69"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: content hash is stable (catches any byte-level edit): 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":"test/parity-baseline-integrity.test.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc6c5ec4818e7b791cc60edb85d26382b8219f295ff761ef64a00b81474dc7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: all PARITY_INVARIANTS pass: 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":"test/parity-suite.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fdaf9a3ee47ef449fb1c5de25755241aea2e929f0c0e5c9b80029ab75deb11"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): 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":"test/plan-tune-cathedral.test.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c872b2eedbc248cfd23b05619c9ee2187a4e9543a0404497a9562720799b7706"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does NOT check out the PR head ref (no fork-code execution): 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":"test/pr-title-sync-workflow-safety.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a8c3c344e8eeb10c2e7e01dab90826ce8da40ba6409ea01ea7f706ef48f33f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does NOT interpolate ${{ github.event.pull_request.* }} inside a run: block: 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":"test/pr-title-sync-workflow-safety.test.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7781dbdab5957d40e9dfdaf500c99b3d4d0770c263de8690f431fc2fe1a175"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: global, system, and environment-injected hooksPath cannot reject the push: 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":"test/redact-prepush-rebase-force-push.test.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e01d9be199bffdc54f0bdfeff761bc4d92a9849db1e2dd1a02b2ad6e2739de"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: an inherited global hooksPath cannot reject the fixture push: 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":"test/redact-prepush-scan-range.test.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b214d6edd54044ece266057bd0a70e7300f8f7387dc3aa17f9198dda1bfefcb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: an inherited system hooksPath cannot reject the fixture push: 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":"test/redact-prepush-scan-range.test.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d992e16eedfaf621747ad35e0cb0c4b7af6b4b09936e4fedd37cc3b54e06f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: GIT_CONFIG_COUNT cannot inject a rejecting hooksPath: 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":"test/redact-prepush-scan-range.test.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708dbc846b475af38de4ee2a9d332ebc8c8e18b2b9ff85e07f5ad9a6d2e436d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: GIT_CONFIG_PARAMETERS cannot inject a rejecting hooksPath: 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":"test/redact-prepush-scan-range.test.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17aadb84c75021b999f8bd991a775339301aa0b8693762332b5d8c779f7440f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: an inherited init.templateDir cannot install a rejecting hook: 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":"test/redact-prepush-scan-range.test.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae08dd24df978e02667e84efd96ad70de60cd0cda132a67c67649bb31dd31905"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: a hooksPath in the default global files under HOME or XDG_CONFIG_HOME cannot reject the fixture push: 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":"test/redact-prepush-scan-range.test.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eab89d9ada076ebb5745a690412185f82ba4693d02eef2cd66f1829f43c246"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: all 5 planning skills produce output under ~600 chars (~150 tokens): 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":"test/resolvers-gbrain-save-results.test.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"463f555bec1829be165fc236cd6a4ea84a6c34313ab13bbeafa0f7779067a666"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: structural scanner: every generated dispatch imperative carries the flag: 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":"test/run-in-background-guidance.test.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"79409bdc8065c42062d0d4d6e3e8fbf3f84bf80baf9d8b96ea0faa0f84ff6aee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: the inverted \u0022do NOT use run_in_background\u0022 phrasing never comes back: 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":"test/run-in-background-guidance.test.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6878631d61a73f5c17b136bbb7ccd1efca80bb23755851bfd7ad3d832045158"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${rule.id}: rule located in ${rule.source}: 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":"test/safety-rule-registry.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5445c859b10663272d853d865f21b7b5b103b18070c4967335914750bafe36"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${rule.id}: eval ${rule.evalId} is registered: 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":"test/safety-rule-registry.test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b4d8ae2f5134d9fee141226dc3277ebfe6e8b8e9c43492783e7a31c97e3dba"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no production file spawns a gstack bin by path or a bare bash, outside the known sites: 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":"test/script-invocation-tripwire.test.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"78564a29c4bf43d06b1a9d523b1cd3627669fb950b8f6eb336a67d19d11e0fc4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no drift outside the shrink-only allowlist: 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":"test/skill-bin-drift.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a21e199fc8c302c5c653bf88bb1525a87425a33538ee542141b3ee9a4d99b4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: every allowlist entry still reproduces, so the list only shrinks: 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":"test/skill-bin-drift.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b3acb7289b3993735ad5818534a9e0d2f58ca7dbadff8d96c90fc1d0695aa0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no e2e test exceeds 2\u00D7 prior tool calls or turns: 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":"test/skill-budget-regression.test.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5a16ddbaf941e9bd7076949f064acd742c4c8c175ed36a0f6b40175b596894"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no llm-judge test exceeds 2\u00D7 prior tool calls or turns: 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":"test/skill-budget-regression.test.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"09109bba980868720086208380803514430e8f0eb978735995d27b3594363faa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: e2e run cost \u2264 EVALS_BUDGET_HARD_CAP_GATE: 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":"test/skill-budget-regression.test.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"278975edd32c6e8cf6055b103a6713a9abc76b05a50cdcf198e640a0467449c3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: llm-judge run cost \u2264 EVALS_BUDGET_HARD_CAP_PERIODIC: 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":"test/skill-budget-regression.test.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6487bfc997014354aa6e5fa82ac695215e1cca10444b799bcdad5c14e11e179"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no duplicate skill names within gstack: 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":"test/skill-collision-sentinel.test.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f764a3957d91392abfffa1e99d09ee73d0234782222e35dc6e99d88388ca9e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no skill name collides with a ${host} built-in (or has written justification): 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":"test/skill-collision-sentinel.test.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb35b384256f54bfcc6e5f8566260d3787d30258f076adcf5881e162f982a2b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: KNOWN_COLLISIONS_TOLERATED entries are all still active collisions: 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":"test/skill-collision-sentinel.test.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ce8d39b5c1c9a31b74e8760fa199f4ee1e8d8b8a6a7875fcea3a92690e4e30"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no unresolved {{TEMPLATE}} placeholders leaked into output: 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":"test/skill-coverage-floor.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d115bc9c032168f4255e743863eafedfc12060749a9f11c84063555bfac6bd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: carved /plan-ceo-review AUQ format \u002B substance stable across ${N_RUNS} runs: 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":"test/skill-e2e-auq-consistency.test.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31215b94a8c07f6d57d94a19c72f1c0834f9e870923d216962da22ba4e139d8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${m.skill}: first AUQ is a compliant decision brief (7/7 format, substance \u003E=4): 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":"test/skill-e2e-auq-matrix.test.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d288db90992deb8a3bb1473b0033c01457ea7afdf792d82e22fa8cd83c0ab0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: carved plan-ceo-review AUQ is not worse than verbose on the same prompt: 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":"test/skill-e2e-auq-verbose-vs-carved-ab.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c48c87f710024bcd2ceed025d096cd295cca3d0d62804a07f8164ae6262425"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: office-hours-auto-mode: 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":"test/skill-e2e-office-hours-auto-mode.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3266908951752536fcb69d5fbc4d3e83c5f259af824bcca48e59f164781b1948"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: seeded forcing finding causes the agent to fire at least one AskUserQuestion: 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":"test/skill-e2e-plan-ceo-finding-floor.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f83acf8a2dc730238e9e9c062ffc80f002b1d0b4d9275b132c26c43031adc3f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: mode \u0022${c.mode}\u0022 routes to its distinctive posture: 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":"test/skill-e2e-plan-ceo-mode-routing.test.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a321a0f1ce6b193f3d8ededc43f956a6b5112ad8a00de7d4df80d084b2b29f3f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: first terminal outcome is asked (Step 0 fires before any plan write): 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":"test/skill-e2e-plan-ceo-plan-mode.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9767468a0211fc7ff929fc44ed7af334543df4b00ab9628ef2f15ba056caef"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: 5-option scope decision emits \u003E= ${FLOOR} review-phase AskUserQuestions (no dropping): 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":"test/skill-e2e-plan-ceo-split-overflow.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f968f28cfa734097a6c8093980ac0a4adbbbab5fd3a1ed9fc5ba28d8543eaf3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: seeded forcing finding causes the agent to fire at least one AskUserQuestion: 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":"test/skill-e2e-plan-design-finding-floor.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"da47c6b34716d474e1e853410ae0d0ae1abeff2022660ace0306583086d3db1a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reviews the supplied UI plan through an acknowledged Design finding: 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":"test/skill-e2e-plan-design-with-ui.test.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d3474b8102d120a6521e178ea68b30a0085373e9d40b7a5bcb7a3469d722bc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: seeded forcing finding causes the agent to fire at least one AskUserQuestion: 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":"test/skill-e2e-plan-devex-finding-floor.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba374dd3395903b9ca8e130bda7d1d939f0daeede6cbeda863ce4e76b394f34"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: AskUserQuestion surfaces when --disallowedTools AskUserQuestion is set: 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":"test/skill-e2e-plan-devex-plan-mode.test.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a19ec851053716f44f11dd94e3613a9b5191b3cbdc6e3537949c46e6e79f76"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: 4-finding plan emits \u003E= ${FLOOR} review-phase AskUserQuestions (no batching): 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":"test/skill-e2e-plan-eng-multi-finding-batching.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4827b21e89929a45eab43c9d4b3552cab4bb41c668075a0daae6e85e81527a5b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ship-frozen-scope-convergence: 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":"test/skill-e2e-ship-frozen-scope.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"05182e7280817271423456c5f4a25be104b099f268e4e7f20e47e0da79e5691c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ship-unmanaged-hook-consent: 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":"test/skill-e2e-ship-hook-consent.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea46554e7ed1945a7123542be4b8f7c20fe9414a1711b39328422270238084b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ship-local-hook-preservation: 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":"test/skill-e2e-ship-hook-consent.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5562a6e6516c434d5ecdc7a2570f410b73abbf690678ae2871b879e94c087abe"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ship-managed-hook-refresh: 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":"test/skill-e2e-ship-hook-refresh.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da21e0577d32a37c170009d0f2ea51e630965312374b213130ad21705ec48e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ship-skipped-queued-finding: 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":"test/skill-e2e-ship-skip.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"344fcddc32162f21f1d64067f9f22377edaf0228d7f6c629ccb4fecb5f2eafa5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no skill exceeds v1.81.0.0 baseline size \u00D7 ratio: 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":"test/skill-size-budget.test.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f76bf73e460eb77c8ac29fa9b7b8e1f70052f0533eb62ac738626d4a3e7178"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: total corpus byte count does not regress past baseline \u00D7 ratio: 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":"test/skill-size-budget.test.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ed0f307a40874ba080ef0c57c60812782a8bf8eec24632de3d7cb92a31c151"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no skill shrinks past 80% of v1.69.1.0 baseline (catches accidental body strip): 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":"test/skill-size-budget.test.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4dbfffb16eeb1831a1e399cfb598a89a6a3a6dd31a7530f7c1084d096efaba"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: catalog token estimate stays compressed (v1.45 target \u2264 7000): 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":"test/skill-size-budget.test.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"19be0c0459c062b200d9e396735193640f4df7628848e1bb824213b45e25d54d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${tmplFile} has no hardcoded \u0027main\u0027 in git commands: 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":"test/skill-validation.test.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b047fa17708bd299814efbfeb8ee366ad5920dfc624fde6caaa040ee1a0d8d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ship/SKILL.md.tmpl contains no unexpected fractional step numbers: 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":"test/skill-validation.test.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"94914f9c211e19850c1a69804bf28bbab2db4bd6cf2ced15cfb4206a591884de"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: git tracks no Mach-O or ELF binaries: 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":"test/skill-validation.test.ts"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"745cc56b124ace59f98e32137007ce09edc5d1669b5a6bdc521460157a177216"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: preamble source does not write JSONL unconditionally: 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":"test/telemetry.test.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"282d36d061a2eabeb9fb39b8078883d23fb1ab3b3e2dd3400f702a4524e80e6b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: E2E_TIERS covers exactly the same tests as E2E_TOUCHFILES: 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":"test/touchfiles.test.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1020a62b35a328faf2e8c53e59ffd9bc75bfc10b612b295b2704051d132aae38"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: E2E_TIERS only contains valid tier values: 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":"test/touchfiles.test.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1b50ecaad6af6562a32e6f85bcd7a8700c64c2099543867e6263c60bac46d5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: every LLM-judge test has a TOUCHFILES entry: 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":"test/touchfiles.test.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7453d6185dcc75f08a0a0292bd1c496853a5ee7ed0cb37626fe2d5b9e5d9a305"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: every non-glob dependency path exists: 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":"test/touchfiles.test.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33e033a86d25ea6ab165e5e1a828f264a2a7a060b18d1adad485b80be994897"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: every glob dependency anchors to a directory that exists: 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":"test/touchfiles.test.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62174af6a07b44bfbc7df8fa4f64cf4536d755be3714d5566fe74b3cb4719c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: the curated Windows-safe subset holds its floor of ${WINDOWS_CURATED_FLOOR} files: 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":"test/windows-native-workflows.test.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed616951d77b5b66c38ba5304f06d17c02c670e9508c81b8cb6d406bffb26ad"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: actual native capture admission lifecycle: 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":"test/helpers/auq-parallel-worker.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051560efe0999278385549a7bae4fab3dd9f39670d6a91c6b4edfb51a4378e2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: addTest accumulates entries: 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":"test/helpers/eval-store.test.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81e9a153c59d8d985aa8f737c8796e6d09d86994ef2979dc3d707e58a1b4849"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): never registered: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/shard-equivalence/module-load-error.fixture.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"700afe776f34204318057b371ca5b4b7673d840bfeba9884c59446b2fc36a23f"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): first: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/shard-equivalence/unhandled-between-tests.fixture.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56e7cf2b2e2e49fabcc9b9c33c8aa1d5d57855f8785f0c3bb2fec5f795f981d"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): second: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/shard-equivalence/unhandled-between-tests.fixture.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdc66be4a6a6ad2536ad0f818aa9e5534297d2d9da39245efc1ed95418cbcff"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: blocks past the wall deadline: 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":"test/fixtures/shard-equivalence/wall-timeout.fixture.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43a5b3ebb486cf5fd25c8aa3e8189615446d5db67f1d5dcb459155a313ba63"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: prerequisites check: 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":"make-pdf/test/e2e/combined-gate.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ff2b4e05609f842d9408935e119eb4ea1218bfca509ea15b1106750d4ba2b2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: diagram gate prerequisites are present: 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":"make-pdf/test/e2e/diagram-gate.test.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74a086ba83f704d8ca373a32894ccfee904178dd274260e2710262c2b1f0f3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: emoji gate prerequisites are present: 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":"make-pdf/test/e2e/emoji-gate.test.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1162f24b347e8a444937e842af0edf6b2e43d8f7f4c75aa15d745bdcfc658e4b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: format gate prerequisites are present: 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":"make-pdf/test/e2e/format-gate.test.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccb98c12680559b27ac49408a823c2b42cdb9c5492672b919dca53ea30e8669"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: landscape gate prerequisites are present: 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":"make-pdf/test/e2e/landscape-gate.test.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a08f989593c320f9b719c6c9d1852ea3bd49377a21bb954d9ba574ae3dc99d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: toc gate prerequisites are present: 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":"make-pdf/test/e2e/toc-gate.test.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d541c6d9d07063038251279d7a4d3fdced40a93079a7e15b34859ca4ce8a5d4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: typechecks beside an internal @Observable app state using a comment marker: 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":"ios-qa/scripts/gen-accessors.test.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b897d9c8b2740d018cd3411f428e50ab384cc13eb543f6baff6e30d67704786"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: strict JSON typing and cross-model validate-before-apply restore run correctly: 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":"ios-qa/scripts/gen-accessors.test.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d5a15657590d2ea7ffc3d95a8154ecdb7a66a0af3c31daa17c3f5aeabbf953"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: stop() is idempotent: 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":"ios-qa/daemon/test/tunnel-bootstrap.test.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0a5587cb139c0ad5e23df7451a7cf83d2b36fdbb2c18630b6c389a5d041719"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): form: goto \u2192 snapshot \u2192 fill @ref \u2192 click @ref: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/commands.test.ts"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a1774d4c00077cdaa15684df7816705f92663ba9bb49ead84860ed5d885c40"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: absent or dead pid is a quiet no-op: 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":"browse/test/headless-gpu-and-reap.test.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7021135c2380616ae8ddee638eff7fd6cf31ed06206c75d27e6fbddec6962b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no pathname comparison outside the table matcher and the tunnel filter: 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":"browse/test/server-route-dispatch-ratchet.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf26c2ee1fa433577242f787c2fd73c1a4cd99a1bf45f92dda5de039af07c7a9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: close() tears down listener and in-flight clients: 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":"browse/test/socks-bridge.test.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe567b5e272b7e2ac99d4a0a995ac1b17dc685ccb0e0962055ec76a430904d9"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a call in flight when the process died is charged its reservation on the next run, which dispatches a fresh attempt: This test starts work it did not wait for (\u0060proc\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(50)\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":"test/autoplan-run-api.test.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d468d9189a68edca45c06ecfae1fd6bb881c31809cbed7b8f0903d771be2883c"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a cap changed during the call admits the retry against the new cap and is not written back over: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(150)\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":"test/autoplan-shadow.test.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4317fb656d4f6b343752f9f22024c9ba7f7d884ca27ae3c052a9781855f5643"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a Stop that fires before the CLI flushes the turn waits for the final message instead of judging a stale transcript: This test starts work it did not wait for (\u0060proc\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(300)\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":"test/autoplan-stop-gate.test.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5557a1da2c07a5146098451f41d26ca9f735e6ecb7f011911a31bd73240a1d"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a Stop that fires before the CLI flushes the turn waits for the final message: a review written outside the repo is released, not held: This test starts work it did not wait for (\u0060proc\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(300)\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":"test/ceo-review-gate.test.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1d3c205ba7b9d4d776db223f4004a4aac126be94b36d4727efa24b7f7e4d89"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a Stop that fires before the CLI flushes the load itself still judges the run once the final message lands: This test starts work it did not wait for (\u0060proc\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(300)\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":"test/ceo-review-gate.test.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b44f786a776433f64fadc634de51304fc53dc178091b0a30a589165fc9fb3"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: SIGTERM to the shim while the vendor is running: the vendor group dies with it, exit 0, logged: This test starts work it did not wait for (\u0060child\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(30)\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":"test/memorable-user-prompt-hook.test.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4abb86435ac91001da7e99a911f3676a338bca3600ea7471ccc24a434025f4"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: cancel() terminates the child and reports cancelled: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(400)\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":"test/outside-runner-contract.test.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f8b17b3397d1fdfcb12900d9777cbfb1431581d4f94555a24e04432f1c622c"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: the bin dies on SIGTERM at once (no JS handler swallows it) and the next watcher takes over its lock: This test starts work it did not wait for (\u0060child\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(100)\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":"test/pr-wait.test.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"df06e505fa70874b7d2fc1c21d67202aaaff8f10b10724f1563031812cecd434"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a Stop that fires before the CLI flushes the turn waits for the final message: a run that reran its check is met, not blocked: This test starts work it did not wait for (\u0060proc\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(300)\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":"test/skill-contract-stop-hook.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6145d2f5d953d7b5059f426782927ad9d405fa3cdd7d528fbbf96b887ae7804a"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a Stop that fires before the CLI flushes the load itself still checks the run once the final message lands: This test starts work it did not wait for (\u0060proc\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(300)\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":"test/skill-contract-stop-hook.test.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c798ecbe2850c3b6c4d0ab220faddc3604b68fbc703b8d869f4d1423e5eeb16"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: global lock blocks all tab locks; tab locks block global lock: This test starts work it did not wait for (\u0060tab1\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\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":"browse/test/cdp-mutex.test.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bd6e5bb5adac13f3ff577a31475b09a6e3bb2820b7313caa35a5ef89f3038b"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: held owner readiness follows its marker or terminal reply, not an earlier checkpoint: This test starts work it did not wait for (\u0060waiting\u0060, still running when the sleep starts) and then orders itself against it with \u0060Bun.sleep(50)\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":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e291bc19ede27693f77bf50491a79a38517fbfbd9c5acf4e7b861cb5224ab799"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-ledger.ts: lib/review-ledger.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 177 in review-ledger.parseLabelled at line 195. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-ledger.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":"lib/review-ledger.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4023f84cd1870907824125e6485d3b8cf6eb345498d49139e3d1dda21f67bd66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/write-commands.ts: browse/src/write-commands.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 386 in write-commands.handleWriteCommand at line 136. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/write-commands.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":"browse/src/write-commands.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"28da6e31c73298da4e9eabea79d2457c95dca0bba0615d189e5788f937702360"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-release.ts: lib/ship-release.ts changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in ship-release.fixChecked at line 293. 18 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-release.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec56a1a5ca1f4f794e1d4aaa40c4fd3e99d75d0c5b6cd226a75ccafeb5c648b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-policy.ts: lib/ship-policy.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in ship-policy.validatePolicy at line 454. 7 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-policy.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":"lib/ship-policy.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be554f481fa630041300b3bd888b1811bf839ecfd369d5d6e64f6478ec29ede"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test-pr-profile.ts: scripts/test-pr-profile.ts changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in test-pr-profile.selectPrProfile at line 401. 10 of those changes were fix/bug commits, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/test-pr-profile.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf39ff81fb2197561eac9fe957aa45cfa419d8c67840eaff66cc22709a7ac25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-receipt-depth.ts: lib/ship-receipt-depth.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in ship-receipt-depth.writeExcludeBinds at line 346. 11 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-receipt-depth.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":"lib/ship-receipt-depth.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e8dcd08ec535ab3d675921ff855295ac0631348f0e0531746bc85eec1f9d39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gen-skill-docs.ts: scripts/gen-skill-docs.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in gen-skill-docs.runGeneration at line 982. 9 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/gen-skill-docs.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95c4d08f3cc4e3eb2b87c83274ceec9ff5f275c62564b7cae9e06e3ffdccd66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test-paid-shards.ts: scripts/test-paid-shards.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in test-paid-shards.main at line 855. 6 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/test-paid-shards.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ea68c41d9fd95385cdc4a2b63ea5187686e8cc57bf71dc61f9dafa56ca0f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-scope.ts: lib/review-scope.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in review-scope.summarizeReviewLoop at line 399. 8 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-scope.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":"lib/review-scope.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6891230dcdf5b6434cc2026857586a5ad8dc21aa6712ff54f832c93ec5f9fbc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test-free-shards.ts: scripts/test-free-shards.ts changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in test-free-shards.main at line 2029. 9 of those changes were fix/bug commits, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/test-free-shards.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11d232fe4530ff2250f93cf3b470ec190c059e6cfe52eb95518568e1002bf40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-depth.ts: lib/review-depth.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in review-depth.planReview at line 572. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-depth.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":"lib/review-depth.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"601add82b8e75297e5b458f14519b49eb3fe9564402c4c1e8beb18a4f3a118aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/cli.ts: browse/src/cli.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in cli.main at line 1820. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/cli.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":"browse/src/cli.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b508604282aa7ee8dec97d83848ef02f3736b1f1d6a5de4ad4c5036b0456fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/index.ts: lib/pregate/index.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in index.clearByRuns at line 402. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/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":"lib/pregate/index.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5c8e25c84c3cb7f0443db7bde5851033e733ba9a71161c12e645255394248e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/lib/paid-report.ts: scripts/lib/paid-report.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 138 in paid-report.runPaidReport at line 566. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/lib/paid-report.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"99db465c7b1002bfc58732a4f54e365e92220e1dcd1c2c845c9f800dbf5f81b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/meta-commands.ts: browse/src/meta-commands.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 192 in meta-commands.handleMetaCommand at line 323. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/meta-commands.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":"browse/src/meta-commands.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dec287d5b9a8fa108651f9c20b365c523feaa5c69a4ad5a8de20672b33f6700"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/server.ts: browse/src/server.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in server.handleCommandInternalImpl at line 975. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/server.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":"browse/src/server.ts"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1483798456cfdd7c9e6ce58d4239d91f0810bcef1ba93a733b0f8bf78444783a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/checks/lanes.ts: lib/pregate/checks/lanes.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in lanes.runSelected at line 538. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/checks/lanes.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":"lib/pregate/checks/lanes.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e43c5d513734f28025304a4dd9cdb8ecebb80b63e8b59d6c12f6593f91b518b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/config.ts: lib/pregate/config.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in config.validateConfig at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9790729be0e622be4ba88f07ae50092be7ca40e9c957fd758744589e113957cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-queue-land.ts: lib/ship-queue-land.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in ship-queue-land.land at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-queue-land.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":"lib/ship-queue-land.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c683a46a0f8689f69759cb30f4613e0a21e156d76c595df64e30307ef02a436"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-queue-land-direct.ts: lib/ship-queue-land-direct.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in ship-queue-land-direct.landDirect at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-queue-land-direct.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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1dc0eba9b05f82eb2057f290a517b42558cd9297fb6394598b2d75fc44bc2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-queue.ts: lib/ship-queue.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in ship-queue.ready at line 296. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-queue.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":"lib/ship-queue.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf80f7f79f353c220e70c934909981ee7d6b7a23f52a5f3d09773173076f82e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-receipt.ts: lib/ship-receipt.ts changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ship-receipt.parseReviewLoop at line 479. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-receipt.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":"lib/ship-receipt.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf01ddefd0f079d1aab317c70fb021ff3289c496f21a9d91ae3b42aa94ac85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-gate.ts: lib/autoplan-gate.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in autoplan-gate.answerGate at line 403. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-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":"lib/autoplan-gate.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e249b7044421dd699d736147c2437e18589e33a6e78b4115c6791f1014297e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/cso-eval.ts: scripts/cso-eval.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in cso-eval.validateResult at line 644. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/cso-eval.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e9ea03aa4b386f78e45e69f2aea02eea23e65268af5af3ca81e5d3651b20cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/harness-register.ts: lib/harness-register.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in harness-register.register at line 583. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/harness-register.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":"lib/harness-register.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acbdb3e68a11a9219fd084554c3ef0ca2494061676b7ab75fe06caff386c4d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/restamp.ts: lib/restamp.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in restamp.restamp at line 671. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/restamp.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":"lib/restamp.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b5c696b65fb8220b4011ed6247aa6b029643dfc6b53303a2cdda2348ca4daf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/lane-selection.ts: lib/pregate/lane-selection.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in lane-selection.selectLanes at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/lane-selection.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":"lib/pregate/lane-selection.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15730d3bfee504e4c5325e669329c6fddac0869cfbae448d3d283ccdb4c25ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/terminal-agent.ts: browse/src/terminal-agent.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in terminal-agent.buildServer 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/terminal-agent.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ce337a0d0cb1e17834f514c1280e8e27da50824c8eded02684944b4a15026"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/run-evidence.ts: lib/run-evidence.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in run-evidence.verifyRun at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/run-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":"lib/run-evidence.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e6b25fb5f91d99ce0a9857ded28f3e371debcf0f727de8aa6df761a8dc4ea6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/docker.ts: lib/cso/docker.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in DockerGroup.createContainer at line 627. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/docker.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":"lib/cso/docker.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfe6e315ddd45c6397af6a3b3b1034fcd229840ced89b4e958004b324c095fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train.ts: crew/lib/ship-queue-train.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ship-queue-train.newTrain at line 400. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train.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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea2a7343d9bdcffa7349101f63f1a9e879f6814cef5f3fbf1663828177bc147"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-preflight.ts: lib/ship-preflight.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ship-preflight.preflight at line 250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-preflight.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":"lib/ship-preflight.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1450a20b1e2ad7879e265d89a8d740aa29450a783ac190d0e68ca82fc26646da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/snapshot.ts: browse/src/snapshot.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 156 in snapshot.handleSnapshot at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/snapshot.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":"browse/src/snapshot.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c109f76d8a3ce23b6a8516c49c587ddd9b2cf72224568d390400fbd2d75222"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/scripts/release-cut.ts: crew/scripts/release-cut.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in release-cut.planRelease at line 452. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/scripts/release-cut.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":"crew/scripts/release-cut.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"797f2017160ac5f1159c1cc045ad60254bad9dd90f85879f96fd15e1487dd93b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/lib/paid-plan.ts: scripts/lib/paid-plan.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 154 in paid-plan.parseRunManifest at line 486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/lib/paid-plan.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8395bd790961278df24d2f9d0704b75cb2030b5f44f6bd4772fb605433322765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-evidence.ts: lib/review-evidence.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in review-evidence.bindReview at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-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":"lib/review-evidence.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6acedb4c71dac91ce61911e59df315a33bcaaa636076963b8c9294ee99302c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-ready.ts: crew/lib/ship-queue-train-ready.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in ship-queue-train-ready.trainReady at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-ready.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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3297772b2f823375f9bb9abf0a2f4466164970821f72c146db4e0efc2c767724"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-pass.ts: lib/review-pass.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in review-pass.buildManifest at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-pass.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":"lib/review-pass.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7496c059d6e8ee2b9622408bcfc7ad3eb48db1b77350d1263a7c5813ca96288d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bin/gstack-gbrain-sync.ts: bin/gstack-gbrain-sync.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in gstack-gbrain-sync.runCodeImport at line 1154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- bin/gstack-gbrain-sync.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":"bin/gstack-gbrain-sync.ts"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d566666683969920743d84e9d64284e9d7eec30f058ebc47e198cb7497fd3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/tree-receipt.ts: lib/tree-receipt.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in tree-receipt.buildReceipt at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/tree-receipt.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":"lib/tree-receipt.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"192183bec10e7d12fe6394f52f8c48adf3c83bd1d6e4ce70f9671da176d8b962"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/state.ts: lib/cso/state.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in state.scanRunLeases at line 1570. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/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":"lib/cso/state.ts"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a8de0f0753540f4f8d11700469f987012d4156b39f24b2a23070985195afc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/outside-review-result.ts: lib/outside-review-result.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in outside-review-result.classifyOutsideReview at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/outside-review-result.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":"lib/outside-review-result.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"70604faa78a75f5850522505334738446d0df3acaa7306d4123033b33fb5ce21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/gstack-post.ts: lib/gstack-post.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in gstack-post.mergeSplit at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/gstack-post.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":"lib/gstack-post.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed070fed94d5c5857e986cab9f6d287b2d7bfbc7490c6ccdec27d1a099c99b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bin/gstack-memory-ingest.ts: bin/gstack-memory-ingest.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in gstack-memory-ingest.ingestPassScoped at line 2106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- bin/gstack-memory-ingest.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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4788dce11e9b56bf5755513e1a7890137b740c08041b6060746173f9244b867b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/browser-manager.ts: browse/src/browser-manager.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in BrowserManager.promoteToHeaded at line 2162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/browser-manager.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":"browse/src/browser-manager.ts"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"381a4e16afa8f296c139703ea357a1f16b5d033edaffd68c2ea050108aeb9c0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-run.ts: lib/autoplan-run.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in autoplan-run.nextStep at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-run.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":"lib/autoplan-run.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a270fee5a7b521102dfe1e838dac5bdd045f2b1a51b78bd0086177cf21b5f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/snapshot.ts: lib/cso/snapshot.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in snapshot.capture at line 633. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/snapshot.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":"lib/cso/snapshot.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b3f10655cb6e41a301f4b1a7523cd64aa01a1bf7c748de20f30e543f17838e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bin/gstack-autoplan-snapshot.ts: bin/gstack-autoplan-snapshot.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in gstack-autoplan-snapshot.initializePlan at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- bin/gstack-autoplan-snapshot.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":"bin/gstack-autoplan-snapshot.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"845a92523a2ff00d05379ca066fa9ddcd6e1ec421d63f41693406af964904d6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-record.ts: crew/lib/ship-queue-train-record.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ship-queue-train-record.parseNote at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-record.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":"crew/lib/ship-queue-train-record.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d258f50f87d0cc9e412d02dd9bf2570ca6467587daa9ecb03108da1cc8195f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-brief.ts: lib/review-brief.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in review-brief.renderRole at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-brief.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":"lib/review-brief.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed9353c484d1bf3c19734179c82648b3459de3fc7078038bb3c088e80c5d8aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/approval-record.ts: lib/approval-record.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in approval-record.importAutoplan at line 323. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/approval-record.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":"lib/approval-record.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f87558c30335e6fe87566d105699a7cd78d476a728e80281c8ce3c0ec8b4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-revise.ts: lib/autoplan-revise.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in autoplan-revise.reviseRun at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-revise.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":"lib/autoplan-revise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6e6ece7a4aaf49e3712c1af3dae42e593f5c9c467aedfed0b3decbf1c4ad0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-budget-cli.ts: lib/ship-budget-cli.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in ship-budget-cli.cmdStart at line 240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-budget-cli.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":"lib/ship-budget-cli.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"32851eee523463b6b3a76e0d9d68b8504ef1cec6aab7fbb1e121e1fe5254df8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/cso-eval-producer.ts: scripts/cso-eval-producer.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in cso-eval-producer.runProducerCell at line 553. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/cso-eval-producer.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b1dee4cfd7e0444d6da300d78fb5041c76e91c259bbe3b214b4a430e7f988c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/version-gate-train.ts: crew/lib/version-gate-train.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in version-gate-train.classify at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/version-gate-train.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":"crew/lib/version-gate-train.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b24d9255375dc9a3c8a24cf458fc7baef0163a53276f60fe812c257e33c9123"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: autoplan/bin/phase-publication-hook.ts: autoplan/bin/phase-publication-hook.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in phase-publication-hook.phaseDecision at line 568. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- autoplan/bin/phase-publication-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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9e98188119d897e33da987b3b1bfa7813b4830b6633ec5e2436c34b583b053"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/cli.ts: lib/cso/cli.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in cli.submit at line 1391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/cli.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":"lib/cso/cli.ts"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4c67a31f84178f3cf6cbdb8828a7af97dc8e8f4491c6e986a6c21a5294a919"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/redact-patterns.ts: lib/redact-patterns.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in redact-patterns.isSourceExpression at line 1067. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/redact-patterns.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":"lib/redact-patterns.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac29d0e10237917aff9ee3134bd84669b5d3c592ab538539950d353ee206f0cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/gate-list.ts: lib/gate-list.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in gate-list.parseReply at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/gate-list.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":"lib/gate-list.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4f9e71cc41f5b35f289f75c37d680610a5d4b11695ec0b905b07d118f3517c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ci-carry.ts: lib/ci-carry.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ci-carry.findCarry at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ci-carry.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":"lib/ci-carry.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"24119b133ce5bdd4451c8e821da829907a4b639c617b99cd1762a7e4ce6d0f2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-collect.ts: lib/review-collect.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in review-collect.scanConsumers at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-collect.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":"lib/review-collect.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d11a64b6f5a4238fe7e94fc4bbaea4bf28eca2fc705034416b35a1b26100dd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/verification.ts: lib/cso/verification.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in verification.verifyRepair at line 1836. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/verification.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":"lib/cso/verification.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbde996fc2873acbab58387e5f87bbadc04357cf9ebd56346b30165345f945d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/checks/secrets.ts: lib/pregate/checks/secrets.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in secrets.run at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/checks/secrets.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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af25bcc5639dffd81c523f3a7379254a638073d938ff32d64ecf11eab992def"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-verify.ts: crew/lib/ship-queue-train-verify.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ship-queue-train-verify.verifyTrain at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-verify.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":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"423bb34bfafe9efbcbe0d2819e3e8f4400d4fc6a591582a71f349a22727de8a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/context.ts: lib/pregate/context.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in context.buildContext at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/context.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":"lib/pregate/context.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c4571e52c0731b2afe0d35b2bfe7e587418a4151249da4c7af24050939d897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-risk.ts: lib/review-risk.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in review-risk.matchRisk at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-risk.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":"lib/review-risk.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec7a8f214a5014194b2dc01e5733476e12072d9d9caabfe290950d592386aeb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test-health-report.ts: scripts/test-health-report.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in test-health-report.collectHealth at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/test-health-report.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-health-report.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69cd9e0bb4cfd47437a4a0368803a0f9c3d68d1cdf3b3917d6a1d156bb5bca0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/claude-code-migration.ts: lib/claude-code-migration.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in claude-code-migration.migrateClaudeCodeSkills at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/claude-code-migration.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":"lib/claude-code-migration.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2511abbb612da18a211a23de811c2ac88d1741e2a4bec81e88e542bdbf378c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-exclude.ts: lib/review-exclude.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in review-exclude.binaryContent at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-exclude.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":"lib/review-exclude.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd31f3939fe323714b6194897e8129a799278a500f0c4edf6df3c43740d07e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-cli.ts: crew/lib/ship-queue-train-cli.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ship-queue-train-cli.trainMain at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-cli.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":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6bc065e59ba18d836bfbbc18f78158b29c405527e410bd14e2617f45c38caa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/contracts.ts: lib/cso/contracts.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in contracts.validateVerificationRequest at line 724. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/contracts.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":"lib/cso/contracts.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5dc10cc7927adfd63cafc731678acf3a7ea2cd7b656fbb18359790211723b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/gbrain-local-status.ts: lib/gbrain-local-status.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in gbrain-local-status.freshClassify at line 455. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/gbrain-local-status.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":"lib/gbrain-local-status.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed8b88b71021b3ede16bc1c80e88558465706a1960a81651ef4bb6348170b0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/redact-engine.ts: lib/redact-engine.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in redact-engine.scanInternal at line 361. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/redact-engine.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565638a89ab0f4b7df5e8c7cba20c79f5d266bc4bf2393a1585c8ba2c093698"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/claude-public-transcript.ts: lib/claude-public-transcript.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in claude-public-transcript.readPlanCountTranscript at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/claude-public-transcript.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":"lib/claude-public-transcript.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fe541d07dbdd993073933fef7db5ab0b8c7f11bc4b4ed6287e4f98c739ddb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hosts/claude/hooks/question-preference-hook.ts: hosts/claude/hooks/question-preference-hook.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in question-preference-hook.main at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- hosts/claude/hooks/question-preference-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":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"23be1682a5539f2d5f88e32619442b4de29fd8d4fe01e34c6faf4329966f09bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/captain-brief.ts: lib/captain-brief.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in captain-brief.renderCaptainBrief at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/captain-brief.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":"lib/captain-brief.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f2a8e4ed9e28799530371e59a9417bdd98896b6c2ccf360e05d98a3bcad682"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/process.ts: lib/cso/process.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in process.safeMetadata at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/process.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":"lib/cso/process.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3367f0b4c183ffe84c51c608fd9f9a8a9877571c375653b5e00eca72cf4a40a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/qa-evidence.ts: lib/qa-evidence.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in qa-evidence.capture at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/qa-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":"lib/qa-evidence.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c8ec423aa03b6c9ecd8126aa49ed4a7f543d4469f2d460d18a1cf0c81b4d90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/checks/literals.ts: lib/pregate/checks/literals.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in literals.consumersOf at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/checks/literals.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":"lib/pregate/checks/literals.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ed1acff2b0d6e1d066fedfdfa47a8b8e2abf258b52767eceb09fdc32cfb6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/bin-context.ts: lib/bin-context.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in bin-context.slugFromEnvironment at line 406. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/bin-context.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":"lib/bin-context.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f417be5ae84de2fcf4ed7cadeebf8fff2887cd4507bd07bbc9048125d56768a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/resolvers/outside-voice.ts: scripts/resolvers/outside-voice.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in outside-voice.outsideVoicePreflight at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/outside-voice.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/outside-voice.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5232748ab007ddbb152bfabf9bbacb7c820c1c18e0e6d2c68cd77e54ae51ff75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/import-graph.ts: lib/pregate/import-graph.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in import-graph.referencesIn at line 412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/import-graph.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":"lib/pregate/import-graph.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccac755a7f240b6184cc949f45442ed2d31a80bef55f68b0bb942455ce4bc67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/preparation.ts: lib/cso/preparation.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in preparation.inspectPython at line 531. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/preparation.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":"lib/cso/preparation.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c590c125b8623687e1c581e6ad9c5b1da2d4d919ad098ed7a155267aa47f29f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-prompts.ts: lib/autoplan-prompts.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in autoplan-prompts.detectScope at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-prompts.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":"lib/autoplan-prompts.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f016d32de21cf8449f87f58b3dec11dbc02d26cd3ef9ec727790f37867eb8535"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/changelog-check.ts: lib/changelog-check.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in changelog-check.carryWith at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/changelog-check.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":"lib/changelog-check.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b53112f055f35663eed3986e534f4966eb8d226a242aa72ca2fb2249fbde44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/model-policy-cli.ts: lib/model-policy-cli.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in model-policy-cli.modelsMain at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/model-policy-cli.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":"lib/model-policy-cli.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e665de8d2d7bab4dce736936f64eddcc0dcc81338260dae454a41f26003518"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/eval-plan.ts: lib/eval-plan.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in eval-plan.dryRun at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/eval-plan.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":"lib/eval-plan.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c9fc785620e2f0218398bdb25a79990b372f974d06dfe93c5d9317b4cd273b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/eval-flake-rank.ts: scripts/eval-flake-rank.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in eval-flake-rank.analyzePassRates at line 443. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/eval-flake-rank.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4372eece6a7340fbb1f9ef08ecd8a2a507f3d263a5aecb820df94ae98a506"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/aside-render.ts: lib/aside-render.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in aside-render.renderWithBrowse at line 614. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/aside-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":"lib/aside-render.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5735b69e1fc096baf0d0ba07a7539ed0ddd1b8cab805d4210219497b55b45b5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: design/src/cli.ts: design/src/cli.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in cli.main at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- design/src/cli.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":"design/src/cli.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8b27361b506d84533793614631fc3bf7a6af6f854d7ff1c158a2c81a5ef045"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-land.ts: crew/lib/ship-queue-train-land.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ship-queue-train-land.landUpdate at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-land.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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e801575bd375babfea114b41997b464f27989cba3e1d971955361c482909d488"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-budget.ts: lib/ship-budget.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ship-budget.measureSettled at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-budget.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":"lib/ship-budget.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb55b98ae1f4568b578788aeb62a812dfe1d691a24a9a9c270bd99368d5993db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/supervise.ts: lib/pregate/supervise.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in supervise.supervise at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/supervise.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":"lib/pregate/supervise.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552383071079e707280d95f849777a0acafb189de2efd456a8d1f1bcec72926"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-reconcile.ts: lib/autoplan-reconcile.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in autoplan-reconcile.reconcile at line 250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-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":"lib/autoplan-reconcile.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fac24639ba61d4582fb6d23d3013600ee4977795b9e0c1269f8b6c02077f2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/runtime-catalog.ts: lib/cso/runtime-catalog.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in runtime-catalog.validateRuntimeCatalog at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/runtime-catalog.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":"lib/cso/runtime-catalog.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a69aea5726f6823bf5f8a379cffb123d8ac64185d215805cc1aac1c2af8aa8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/scripts/gate-reuse.ts: crew/scripts/gate-reuse.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in gate-reuse.findReusableGate at line 350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/scripts/gate-reuse.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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"114d4be745b9f0b8cc121cdf2e440c9339f21e59bf912375df7e4b0a75eb6e6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/host-config.ts: scripts/host-config.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in host-config.validateHostConfig at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/host-config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/host-config.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6853fe6c29b6cf0887adb27a81a79cd65bad43a156ad174d67675bc1007f47b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/skill-contract.ts: lib/skill-contract.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in skill-contract.parseTranscript 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/skill-contract.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":"lib/skill-contract.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faaf7516d196a4532496eba957c18680f90acfe74a6ea351d9a8e61e807a1c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/sealed-guard.ts: lib/sealed-guard.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in sealed-guard.sealedErrors at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/sealed-guard.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":"lib/sealed-guard.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a841cc253fd1d959e51e2035bd6234f865f3c3ca02d9fff294c9d305a46c39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/runaway.ts: lib/runaway.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in runaway.runawayMain at line 247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/runaway.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":"lib/runaway.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae14cf95e7cf3ab5f8a25a7b680ec9105daaa1777079c9eadb64b5b3c08d4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bin/gstack-design-detect.ts: bin/gstack-design-detect.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gstack-design-detect.resolveTargets at line 799. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- bin/gstack-design-detect.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":"bin/gstack-design-detect.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"990010b1545033184a9debb90597cc139ed12b606fed34de527d40e76fedd534"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-export.ts: lib/autoplan-export.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in autoplan-export.runLog at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-export.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":"lib/autoplan-export.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d259d3c9cc3e671c9ceaf2c3a19f7cc49e7ecc23522f805317c68d442a41aa06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: design/src/variants.ts: design/src/variants.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in variants.requestVariantImage at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- design/src/variants.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":"design/src/variants.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c9e62bb3364630e050ba8ee4b7e29c8b89d831ceb3d5b7182b5c68ec13d719"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/terminal-agent-control.ts: browse/src/terminal-agent-control.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in terminal-agent-control.agentStatus at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/terminal-agent-control.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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"5281085244b6fdd598cd3b8801a30ba782a9bd4e7209a75f07662b893095f3bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/qa-deadline.ts: lib/qa-deadline.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in qa-deadline.runQaDeadlineCommand at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/qa-deadline.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":"lib/qa-deadline.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cb52a6581bb2967fa83ab412f8c118bc56b36888714b73ca2f0063cbef85ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-carry.ts: lib/autoplan-carry.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in autoplan-carry.assess at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-carry.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":"lib/autoplan-carry.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98f75bf1e1d7816145efe42b5a63888d84a35517a03cb227fc1082006df32d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/scanners.ts: lib/cso/scanners.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in scanners.parseSarif at line 670. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/scanners.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":"lib/cso/scanners.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"877ae781e8f07b77d9ec3598a09eeaef6e7082edb02cdca668dbbd8e766eb033"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/scanner-executor.ts: lib/cso/scanner-executor.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in scanner-executor.createDockerScannerRunner at line 704. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/scanner-executor.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":"lib/cso/scanner-executor.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"63783dd3cabe4e568e86976ef57cc588002ff0d1946be6ae1dc50dd5acf0ea57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-verdict.ts: crew/lib/ship-queue-train-verdict.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ship-queue-train-verdict.trainBisect at line 247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-verdict.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":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84c85eb20644945b013c1a7bf50801926df791ac84ca0659ee3aac5dcc6dea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/gate-diff/git.ts: lib/gate-diff/git.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in git.resolveBase at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/gate-diff/git.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":"lib/gate-diff/git.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8f2e070435504ec23824e6786b1ff46c157f5c362d9895ab05e59ec8167371"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hosts/claude/hooks/skill-contract-stop-hook.ts: hosts/claude/hooks/skill-contract-stop-hook.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in skill-contract-stop-hook.main at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- hosts/claude/hooks/skill-contract-stop-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":"hosts/claude/hooks/skill-contract-stop-hook.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a5dc66a5343ac232c78acee1ccd99b5835f075302022b860d90d16947cabe0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/install-verdict.ts: lib/install-verdict.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in install-verdict.verdictFileProblem at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/install-verdict.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":"lib/install-verdict.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"088cbaeecf95d375d37a2af0d4fa1963e8d5659486ab2fb15f53326890e1b98e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/claude-journal-records.ts: lib/claude-journal-records.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in claude-journal-records.ownedCausalOrder at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/claude-journal-records.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":"lib/claude-journal-records.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d190c9d0264d7eeaa681df937af49d4f35adace5ba9f3cc941a1f6673b0854"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/regen.ts: lib/regen.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in regen.runRegen at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/regen.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":"lib/regen.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef33a4f75be62baf5ba95dbf85662407c3fa563740eb914d480b3e28f11a713"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/scripts/train-backstop.ts: crew/scripts/train-backstop.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in train-backstop.runBackstop at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/scripts/train-backstop.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":"crew/scripts/train-backstop.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba42267f73733b8c001f8af04f68c1b3cc8fdfd771e7ebf9903de32d3372519"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-wave.ts: crew/lib/ship-queue-wave.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ship-queue-wave.wavePlan at line 267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-wave.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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dcea80be335d325c5a4671c604dbaa9bba91cb90cb3db2bdbe386c38a70a9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/cookie-import-native.ts: browse/src/cookie-import-native.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in cookie-import-native.importNativeCookies at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/cookie-import-native.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":"browse/src/cookie-import-native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aeec97c0b4c64a38e644f07a8388020027f93649380883943e079767838d62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-docs-result.ts: lib/ship-docs-result.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in ship-docs-result.checkDocsResult at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-docs-result.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":"lib/ship-docs-result.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf05cdaa6830302775740ce67cd0c8d98c9929c61fe750d8b42b2ed5b3d4afe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/checks/guards.ts: lib/pregate/checks/guards.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in guards.run at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/checks/guards.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":"lib/pregate/checks/guards.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"330de63b68f664dae2d263f1513cfdab09ac37eb081cb3b2222b5db674407c6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pr-wait.ts: lib/pr-wait.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Watcher.poll at line 477. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pr-wait.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":"lib/pr-wait.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"14025d0c5dbb92ae1fd031031f3a2fb0945f0331d79832df9390939a7133b71a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/cookie-import-browser.ts: browse/src/cookie-import-browser.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in cookie-import-browser.listProfiles at line 170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/cookie-import-browser.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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1377ef1f5a467f51a4fd3f741aa6e7e70bc6ca4fce2429f76d76214785f6ad51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/checks.ts: lib/checks.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in checks.healthDimensions at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/checks.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":"lib/checks.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0848efd340d2b9f627ba4a66d163ed39bc18c5cab589e9066bee4da60c51d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hosts/claude/hooks/timeline-stop-hook.ts: hosts/claude/hooks/timeline-stop-hook.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in timeline-stop-hook.repairTimeline at line 260. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- hosts/claude/hooks/timeline-stop-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":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f42ee39ae4df430b5b8ac2a63bee7f208422da2cdd52a209cfa0fdbdf625ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios-qa/daemon/src/index.ts: ios-qa/daemon/src/index.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in index.handleLoopback at line 398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- ios-qa/daemon/src/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":"ios-qa/daemon/src/index.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd839ea2516a155f7e50cf8dfaa2e6b1dbc256d6f4ae26a55e2574f294aff6c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/office-hours-review.ts: lib/office-hours-review.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in office-hours-review.renderOfficeHoursReview at line 321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/office-hours-review.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":"lib/office-hours-review.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fa5b7608ed7d50805162904f506cc4b2f235235241998ad32e23789c765d46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gen-llms-txt.ts: scripts/gen-llms-txt.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gen-llms-txt.generateLlmsTxt at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/gen-llms-txt.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-llms-txt.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b5a17c99601fb9267198888544a1f233ce0690755feac07ba72e6144fe7925"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hosts/claude/hooks/question-log-hook.ts: hosts/claude/hooks/question-log-hook.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in question-log-hook.main at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- hosts/claude/hooks/question-log-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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ad8a408916eaaa532ddd06e817165b5c4a511e2b92d5f9eb5635e135ded47d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ship-handoff.ts: lib/ship-handoff.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ship-handoff.cmdVerifyHandoff at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-handoff.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":"lib/ship-handoff.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622a6db770176d55f62e2287d84eee35394274f4d5d761b8874dec90acb7c88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/skill-check.ts: scripts/skill-check.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in skill-check.validateGeneratedArtifact at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/skill-check.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-check.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"28caf37318ac80dd72eb71da82fad58454bb596655314f8dea9883da1948ad52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-dispatch-ci.ts: crew/lib/ship-queue-dispatch-ci.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ship-queue-dispatch-ci.dispatchCi at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-dispatch-ci.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":"crew/lib/ship-queue-dispatch-ci.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbc19af6851ccb4f885e7f076aa6950002f3ac1c7d6648a90120b1063427c3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: make-pdf/src/orchestrator.ts: make-pdf/src/orchestrator.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in orchestrator.generate at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- make-pdf/src/orchestrator.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":"make-pdf/src/orchestrator.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e021ea5846ead59b5857ce0055a3c79be645148d31416b955b23298451f6108"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/changelog-fragments.ts: lib/changelog-fragments.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in changelog-fragments.readFragments at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/changelog-fragments.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":"lib/changelog-fragments.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40da03f2ae5b90817bc323b38dc0f36802438f733a6539fd5ee85d06131dca1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/verifier.ts: lib/cso/verifier.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in verifier.main at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/verifier.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":"lib/cso/verifier.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f372c22fd63b195834aaec91a993d776e081adc041866fd98a625d704c7df4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-post-merge.ts: crew/lib/ship-queue-post-merge.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ship-queue-post-merge.verifyPostMerge at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-post-merge.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":"crew/lib/ship-queue-post-merge.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4d700bcf22c667507aaa93a06bbc79bb4bc7d5afcb24babde110133605b35b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/preparation-docker.ts: lib/cso/preparation-docker.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DockerPreparationSandboxRunner.prepareOffline at line 1498. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/preparation-docker.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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b29d370e53bc6c538b48fbe8bb3eb0bbc445fb3f5d2b5b5cab12a0c0fe153c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/e2e-shard-reuse.ts: scripts/e2e-shard-reuse.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in e2e-shard-reuse.mergeReceiptDirs at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/e2e-shard-reuse.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e8b8e2fb690ef1d37f62d5a121fd939b1b4c825791ce5806f27279797976fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: make-pdf/src/diagram-prepass.ts: make-pdf/src/diagram-prepass.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in diagram-prepass.inlineLocalImages at line 549. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- make-pdf/src/diagram-prepass.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":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e8e3f288eb2727e06f42e754d3d2646f834b9060defbad4096a2e96ed7fa14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/autoplan-lean.ts: lib/autoplan-lean.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in autoplan-lean.captureDraft at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/autoplan-lean.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":"lib/autoplan-lean.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d37b6e89bf6827d302b423e9ba6da48c89e6b677811d468c82eaf4c9230cf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/runtime.ts: lib/pregate/runtime.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in runtime.launchRuntime at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/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":"lib/pregate/runtime.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1ddd265f60eced3d56b835b412da5371a7060c64afceec074a1b3a180a4e0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/pregate/init-draft.ts: lib/pregate/init-draft.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in init-draft.draftConfig at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/pregate/init-draft.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":"lib/pregate/init-draft.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"04626cce24130db91f1713271f8207d7a7406dbafc2ee1f6945bd0ddd3bf46af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browse/src/proxy-config.ts: browse/src/proxy-config.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in proxy-config.parseProxyConfig at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/proxy-config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1b4bcfeb73837cc4050c754294422dca090d61a38163e9c74b3bbbf9466dc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/preparation-container.ts: lib/cso/preparation-container.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in preparation-container.seed at line 1026. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/preparation-container.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":"lib/cso/preparation-container.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"8917729cf160ec66747ce1850a10c547ddabb8cd41d1f77cf0a196c8fe31ca43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crew/lib/ship-queue-train-watch.ts: crew/lib/ship-queue-train-watch.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ship-queue-train-watch.watchGeneric at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- crew/lib/ship-queue-train-watch.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-watch.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8c42f38ee7ca304f05e55cdf912586dfb3b61d61a934cab4026c3702083f6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/preflight-agent-sdk.ts: scripts/preflight-agent-sdk.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in preflight-agent-sdk.main at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/preflight-agent-sdk.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/preflight-agent-sdk.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ed066586d0ecb8b808c159f19791052c313840140418714e3e944c3c50010c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ship-measure.ts: scripts/ship-measure.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ship-measure.formatReport at line 478. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/ship-measure.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c0d59036f1bc9be20013067f9ec9f90e58a132e18ba32410c098976f94e05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/review-targeted-delta.ts: lib/review-targeted-delta.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in review-targeted-delta.targetedDelta at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/review-targeted-delta.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":"lib/review-targeted-delta.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12eab5f6b45f3ae0b6263ba56112a494b69c86927a1d0d30b55e2c87e3e740c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/plan-reality.ts: lib/plan-reality.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in plan-reality.checkRealityRows at line 260. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/plan-reality.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":"lib/plan-reality.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14df8401bdbe9f6b05bdae9397aaae2d717d131628ed5bf42687a320cd3abab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hosts/claude/hooks/autoplan-stop-gate.ts: hosts/claude/hooks/autoplan-stop-gate.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in autoplan-stop-gate.handle at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- hosts/claude/hooks/autoplan-stop-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":"hosts/claude/hooks/autoplan-stop-gate.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d9d63f5f25be00446d5f6f4f16742ba5f5bcef688558912e79a513b64bb68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/outside-voice-api.ts: lib/outside-voice-api.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in outside-voice-api.callModel at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/outside-voice-api.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f7a8c7647ff7dbfc17d8b4e88e61a44e988f2cf79a6810c805e94e32deb95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/cso/preparation-executor.ts: lib/cso/preparation-executor.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in preparation-executor.provePreparedProjection at line 965. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/cso/preparation-executor.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":"lib/cso/preparation-executor.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41b1164b172c36c185eb46913d00de165a582d9b1ff3ecc4d3fcd657ed786a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/gbrain-sources.ts: lib/gbrain-sources.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gbrain-sources.ensureSourceRegistered at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/gbrain-sources.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":"lib/gbrain-sources.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a622bf273b3f1c96ed7c713ed86ee23bdaa9e2a95e3f58b303eda529439cfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/ship-bin-common.ts: lib/ship-bin-common.ts changed 15 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ship-bin-common.stampedFiles at line 128), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ship): record-ci reuses its own CI row at the same tree, run and selection (GST-1795) (#4127)\u201D; \u201Cfix: gstack\u0027s GitHub waits poll REST at most once a minute and wait out rate limits (GST-1713) (#4109)\u201D; \u201Cfix(ship): a cleared remote gate for HEAD\u0027s exact tree satisfies a lane whose inventory refuses that tree (GST-1688) (#4098)\u201D; \u201Cfix(ship): finish takes a landed stack parent as the reviewed base, fail-closed (GST-1399) (#4021)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/ship-bin-common.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":"lib/ship-bin-common.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd301719419abea0a7c104c2e6d27484342848bc992afc082928238b6d5dd89"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/qa.ts: scripts/resolvers/qa.ts changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is qa.generateQAExploratory at line 46), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.93.40.0 fix(ship): Step 9.2.1 QA reports go to a git-excluded run dir, not the product tree (GST-969) (#3898)\u201D; \u201Cv1.91.127.0 fix(evals): paid-gate reliability round 2: docsync candidate protocol, scope-block detection, qa fix-loop budgets, lettered consent (#3260)\u201D; \u201Cv1.91.117.0 fix: pregate bats lanes, WTREE_UNAVAILABLE, doctor rows, SKILL.md size guard, planMode hosts (fix wave PR 5) (#3236)\u201D; \u201Cv1.91.106.0 fix: the 2026-10-15 issue wave (#3209)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/qa.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/qa.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53dcb1de8243b9ec29e897a32e09f827dd7f230068248c51c659f7261c78a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/constants.ts: scripts/resolvers/constants.ts changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is constants.codexPreflight at line 158), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ship): make the five judge-flagged workflow spots match the code (GST-1346) (#4004)\u201D; \u201Cv1.91.34.0 fix: /autoplan on current Claude Code and long sessions, quieter pre-push and sync guards, gstack-post, gstack-doctor (#3069)\u201D; \u201Cv1.91.32.0 fix: Codex works from zsh, free text never enters shell commands, honest failures (#3057)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/constants.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/constants.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cc0b859fc8ac982665652537b22bfb1f48edfb586f74cd40c18b1f1e2b6d1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/capy-review-pass.js: lib/capy-review-pass.js changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is capy-review-pass.familyStop at line 121), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Creview-plan: a granted fix round after the targeted read plans one targeted-only reader (GST-1607) (#4064)\u201D; \u201Cfix(review): Step 11 on its own --out renders only the voices (GST-1368) (#4003)\u201D; \u201Cv1.93.39.0 fix(ship): stop a hung outside voice and record it unavailable as the host subagent (GST-1104) (#3895)\u201D; \u201Cv1.93.38.0 fix(review): one record per native finding at its stated severity; blocker count keys on Blocks; fix-check is never a pass (GST-1031) (#3894)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/capy-review-pass.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/capy-review-pass.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dcae81397604a547574eb24ad6b797c21b79fa1248bdf9244eaeb621aed622"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/gbrain.ts: scripts/resolvers/gbrain.ts changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is gbrain.generateBrainPreflight at line 135), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.34.0 fix: /autoplan on current Claude Code and long sessions, quieter pre-push and sync guards, gstack-post, gstack-doctor (#3069)\u201D; \u201Cv1.91.32.0 fix: Codex works from zsh, free text never enters shell commands, honest failures (#3057)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\u201D; \u201Cv1.91.13.0 fix: severe bug wave (autoplan guard, land-and-deploy CI gate, project identity, gbrain, review gates) (#3013)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/gbrain.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/gbrain.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2170faa84960ee143d90e7bf20dac37dab9333cedfb6323349109093c703de60"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: browse/src/commands.ts: browse/src/commands.ts changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is commands.levenshtein at line 241), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.66.0 fix: /autoplan without permission prompts after background reviewers, 34 contributor PRs from the backlog triage (#3087)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.12.0 v1.91.12.0: audit fix wave, ~11-minute paid eval lanes, eval reliability policy (#2999)\u201D; \u201Cv1.91.4.0 fix: Windows Opera cookie import wave (#2980, refs #2957) (#2987)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/commands.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":"browse/src/commands.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8271fad7c77f565e0c9b28a8fee1cb950a02e466725b2b7dbced52675361c2ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: hosts/define-host.ts: hosts/define-host.ts changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is define-host.defineHost at line 120), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.66.0 fix: /autoplan without permission prompts after background reviewers, 34 contributor PRs from the backlog triage (#3087)\u201D; \u201Cv1.91.65.0 fix(install): skills only for the agents you installed, every runtime-root file their skills read (#3080)\u201D; \u201Cv1.91.30.0 fix: honest eval failure reports, Bun floor with safe auto-update, make-pdf and /review on Codex (#3033)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- hosts/define-host.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":"hosts/define-host.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b54cc9a8430cb61c3552152f850ad267a5d64bab01d41e92a305464ce8d943"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: browse/src/config.ts: browse/src/config.ts changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is config.ensureStateDir at line 122), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.303.0 fix(browse): pr-shots no longer edits the tracked .gitignore mid-/ship (#3560) (#3562)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.13.0 fix: severe bug wave (autoplan guard, land-and-deploy CI gate, project identity, gbrain, review gates) (#3013)\u201D; \u201Cv1.68.0.0 fix: next tracker wave \u2014 16 verified fixes in, 90 stale PRs and 21 issues closed with receipts (#2632)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/config.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4fefd216ea6cbe04a76bbd7603eecf13a14e38f7018b2b3876fc730d9b2d9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/question-tuning.ts: scripts/resolvers/question-tuning.ts changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is question-tuning.binDir at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.34.0 fix: /autoplan on current Claude Code and long sessions, quieter pre-push and sync guards, gstack-post, gstack-doctor (#3069)\u201D; \u201Cv1.91.32.0 fix: Codex works from zsh, free text never enters shell commands, honest failures (#3057)\u201D; \u201Cv1.87.6.0 fix: make checks reliable and everyday validation faster (#2898)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/question-tuning.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/question-tuning.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05f634397b36c7d99954280342c3290511eb7532f0646604308c0ab25f7ba28"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/preamble/generate-preamble-bash.ts: scripts/resolvers/preamble/generate-preamble-bash.ts changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is generate-preamble-bash.generatePreambleBash at line 42), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.92.57.0 fix(hermes): plain skill-start fence that Tirith can resolve, so Hermes can start gstack skills (GST-882) (#3825)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/preamble/generate-preamble-bash.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/preamble/generate-preamble-bash.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2148b2d4702aba4846c92686e4ae5bbfdfc444a45b74ef7c1bb42a4c4150fcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test-setup.ts: test-setup.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is test-setup.markedAncestor at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: test fixtures stop tripping /ship\u0027s fetch sweep (GST-1695) (#4105)\u201D; \u201Cv1.93.13.0 fix(test): never hand an exported live-brain URL to gbrain in tests (#3466) (#3876)\u201D; \u201Cv1.91.243.0 fix(capy): source the launch environment from a 0600 file; no skill fence may print the environment (GSTA-104) (#3449)\u201D; \u201Cv1.91.101.0 fix: close the field wave\u0027s residual gaps (#3173)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- test-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":"test-setup.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"54320d3a7f126b4b8bcc98384f60cccaf7a405e33b8381014417300c96ee761e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/third-party-actions.ts: scripts/resolvers/third-party-actions.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is third-party-actions.asideProbe at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.127.0 fix(evals): paid-gate reliability round 2: docsync candidate protocol, scope-block detection, qa fix-loop budgets, lettered consent (#3260)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.2.0 fix: consolidate gstack reliability wave (#2959)\u201D; \u201Cv1.84.1.0 fix: default Codex and Claude to frontier models (#2835)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/third-party-actions.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/third-party-actions.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b2f0d1b387c1b0aba67f9161521014c47ae3598c310c58efb0375e78e2a797"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/gbrain-exec.ts: lib/gbrain-exec.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is gbrain-exec.buildGbrainEnv at line 126), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.106.0 fix: the 2026-10-15 issue wave (#3209)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.78.0.0 fix: the two-red-lanes wave \u2014 AUQ collapse rooted, OSV green from 105, 18 community PRs absorbed, upgrade path can\u0027t eat installs (#2752)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/gbrain-exec.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":"lib/gbrain-exec.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9bcb6ef220c73ec6e639ab12a34e54cc64e2c53f7a039fb05509bc21ed672b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/redact-doc.ts: scripts/resolvers/redact-doc.ts changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is redact-doc.generateRedactInvocationBlock at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.34.0 fix: /autoplan on current Claude Code and long sessions, quieter pre-push and sync guards, gstack-post, gstack-doctor (#3069)\u201D; \u201Cv1.91.32.0 fix: Codex works from zsh, free text never enters shell commands, honest failures (#3057)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.78.0.0 fix: the two-red-lanes wave \u2014 AUQ collapse rooted, OSV green from 105, 18 community PRs absorbed, upgrade path can\u0027t eat installs (#2752)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/redact-doc.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/redact-doc.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d2ad65631441a1635281989a341c7e199d7f3145a215c7ddd217a1d7a9632"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/plan-reality.ts: scripts/resolvers/plan-reality.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 8 (its worst body is plan-reality.phaseFor at line 29), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.247.0 fix(plan-eng-review): define the three references its judged text left dangling (GSTA-91) (#3421)\u201D; \u201Cv1.91.127.0 fix(evals): paid-gate reliability round 2: docsync candidate protocol, scope-block detection, qa fix-loop budgets, lettered consent (#3260)\u201D; \u201Cv1.91.107.0 fix: the GBRA-40 field list (one Bun for install and check, \u0060rec\u0060 gate approval, pregate never silent) (#3190)\u201D; \u201Cv1.91.82.0 fix(plan-reality): name the review input and the PLAN_REALITY line in the reality-rows prose (#3126)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/plan-reality.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/plan-reality.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e23e4727be152adc8f66b163c1aff1b8219bb8ed5d9da95b09286247f463e81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: browse/src/xvfb.ts: browse/src/xvfb.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 13 (its worst body is xvfb.awaitXvfbReady at line 217), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.2.0 fix: consolidate gstack reliability wave (#2959)\u201D; \u201Cv1.78.0.0 fix: the two-red-lanes wave \u2014 AUQ collapse rooted, OSV green from 105, 18 community PRs absorbed, upgrade path can\u0027t eat installs (#2752)\u201D; \u201Cv1.68.0.0 fix: next tracker wave \u2014 16 verified fixes in, 90 stale PRs and 21 issues closed with receipts (#2632)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/xvfb.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":"browse/src/xvfb.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92de304f41ffb5307519502c1a15cdc8a92ac06dca4a067f0ee13fcb8d2d033"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/psychographic-signals.ts: scripts/psychographic-signals.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 12 (its worst body is psychographic-signals.resolveOptionKey at line 284), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.92.69.0 fix: lock developer-profile writers so overlapping derives keep every session (#3437, #3435) (#3738)\u201D; \u201Cfix(plan-tune): map the clicked AskUserQuestion label to the registered option key at capture (#2623) (#3394)\u201D; \u201Cv1.91.12.0 v1.91.12.0: audit fix wave, ~11-minute paid eval lanes, eval reliability policy (#2999)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/psychographic-signals.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/psychographic-signals.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcf8afa0e00f30ec2e9bf8f0fcd1bfdb9de1829bdde45eb81b0dff74105519c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/owner-brief.ts: lib/owner-brief.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 9 (its worst body is owner-brief.plainSummary at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.93.36.0 autoplan: R65 defaults: no review for bug fixes, one lean reviewer with the draft code for features (#3897)\u201D; \u201Cv1.91.101.0 fix: close the field wave\u0027s residual gaps (#3173)\u201D; \u201Cfix(autoplan): decision ids stay unique across reopened gate revisions (#3160)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/owner-brief.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":"lib/owner-brief.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9380315e05e09686be917dfcafd6c01d86e16316ff4be541c6156f319bb373"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: design/src/evolve.ts: design/src/evolve.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 5 (its worst body is evolve.requestEvolvedImage at line 85), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.66.0 fix: /autoplan without permission prompts after background reviewers, 34 contributor PRs from the backlog triage (#3087)\u201D; \u201Cv1.91.17.0 fix: mvanhorn wave (checkpoint provenance, never-overwrite design images) (#3022)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- design/src/evolve.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":"design/src/evolve.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cca26e813df3e8591ea3c8fbd0dd7850e744f58442609d8926905c7bca906f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: design/src/generate.ts: design/src/generate.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is generate.generate at line 94), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.66.0 fix: /autoplan without permission prompts after background reviewers, 34 contributor PRs from the backlog triage (#3087)\u201D; \u201Cv1.91.17.0 fix: mvanhorn wave (checkpoint provenance, never-overwrite design images) (#3022)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- design/src/generate.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":"design/src/generate.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"836a1dc5a8cf7ff86d09a6f616406f99c022e5fc10b21f6d0c41f00ddd14c608"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: make-pdf/src/cli.ts: make-pdf/src/cli.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is cli.main at line 209), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.60.0 fix(windows): setup degrades instead of dying on a CSO failure, detects Smart App Control, Consolas terminal font (#3079)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- make-pdf/src/cli.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":"make-pdf/src/cli.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"580e106b3f17fd5105801b54e1df13ca2f96e0839ca23a29a7e33252f54a1742"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: browse/src/file-permissions.ts: browse/src/file-permissions.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 14 (its worst body is file-permissions.restrictDirectoryPermissions at line 166), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\u201D; \u201Cv1.91.12.0 v1.91.12.0: audit fix wave, ~11-minute paid eval lanes, eval reliability policy (#2999)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/file-permissions.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":"browse/src/file-permissions.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb90a5b1ae95a21ddd0cf793f3d6eba158b4c6860e9f97762d0d2dad2418f65f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/preamble/generate-context-recovery.ts: scripts/resolvers/preamble/generate-context-recovery.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 1 (its worst body is generate-context-recovery.generateContextRecovery at line 3), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\u201D; \u201Cv1.87.6.0 fix: make checks reliable and everyday validation faster (#2898)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/preamble/generate-context-recovery.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/preamble/generate-context-recovery.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d87a9a00db6d7c70101e24ac1eae6efe506d39382d9785b266e11018a49bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: design/src/iterate.ts: design/src/iterate.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is iterate.iterateOnGemini at line 155), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.66.0 fix: /autoplan without permission prompts after background reviewers, 34 contributor PRs from the backlog triage (#3087)\u201D; \u201Cv1.91.17.0 fix: mvanhorn wave (checkpoint provenance, never-overwrite design images) (#3022)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- design/src/iterate.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":"design/src/iterate.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"783cd9e6cf92e4356190994fb70ad2d9a4067783400f5c6cd73a909e8bdd5583"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/preamble/generate-voice-directive.ts: scripts/resolvers/preamble/generate-voice-directive.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is generate-voice-directive.generateVoiceDirective at line 4), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.309.0 fix(flaky): one rule each in the judged review and Eng prose; a cancelled judge names what it was waiting on (GSTA-139 S3) (#3544)\u201D; \u201Cv1.91.66.0 fix: /autoplan without permission prompts after background reviewers, 34 contributor PRs from the backlog triage (#3087)\u201D; \u201Cv1.87.6.0 fix: make checks reliable and everyday validation faster (#2898)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/preamble/generate-voice-directive.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/preamble/generate-voice-directive.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"534681a02d8af57759c91d755826f0e9283c4b170e0e08421ba33a51e40b0d08"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/test-value.ts: scripts/resolvers/test-value.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is test-value.generateTestValueBar at line 162), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.30.0 fix: honest eval failure reports, Bun floor with safe auto-update, make-pdf and /review on Codex (#3033)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.12.0 v1.91.12.0: audit fix wave, ~11-minute paid eval lanes, eval reliability policy (#2999)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/test-value.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/test-value.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f43cbd87f2585ab27f0bf5979c7b1c7c0182bc57cd3df8b7092448172f1614"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/preamble/generate-brain-sync-block.ts: scripts/resolvers/preamble/generate-brain-sync-block.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is generate-brain-sync-block.generateBrainSyncBlock at line 19), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.34.0 fix: /autoplan on current Claude Code and long sessions, quieter pre-push and sync guards, gstack-post, gstack-doctor (#3069)\u201D; \u201Cv1.68.0.0 fix: next tracker wave \u2014 16 verified fixes in, 90 stale PRs and 21 issues closed with receipts (#2632)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/preamble/generate-brain-sync-block.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/preamble/generate-brain-sync-block.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"09de17901d4327d9039d950f25618a26eaebc8999adc7663ed74011b7c2888c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/resolvers/make-pdf.ts: scripts/resolvers/make-pdf.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is make-pdf.generateMakePdfSetup at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.30.0 fix: honest eval failure reports, Bun floor with safe auto-update, make-pdf and /review on Codex (#3033)\u201D; \u201Cv1.91.19.0 fix: severe fix wave (truthful gates, no lost memory, every host finds gstack) (#3025)\u201D; \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- scripts/resolvers/make-pdf.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/make-pdf.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59121e20459261dea89c6275e6ce91160dadd4ac598be964bc8f7604d3fa8d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: browse/src/bun-polyfill.cjs: browse/src/bun-polyfill.cjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is (anonymous) at line 56), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.91.16.0 fix: safe installs and upgrades, skills start everywhere, truthful completion (parallel wave) (#3014)\u201D; \u201Cv1.67.1.0 fix: external-contributor security sweep \u2014 6 findings hardened, regression-pinned (#2605)\u201D; \u201Cv1.67.0.0 fix: the tracker wave \u2014 XProtect self-heal, complete installs, brain-sync integrity, 31 community PRs credited (#2604)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- browse/src/bun-polyfill.cjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/bun-polyfill.cjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a4743dfd3caee5d6be6a973089912a11d50d22ae71f1d1548262d90cf5779"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/stamp-only.ts: lib/stamp-only.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 13 (its worst body is stamp-only.stampOnlyWithin at line 99), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cv1.94.29.0 fix(stamp): leave third-party versions in stamp files alone; land restamps after a reset stamp (GST-1245) (#3968)\u201D; \u201Cv1.94.16.0 fix(stamp): declared placeholder restamps are stamps; carry records HEAD\u0027s version (GST-1026, GST-1030) (#3892)\u201D; \u201Cv1.93.42.0 fix(stamp): name branch lines by position; carry and finish accept a kept VERSION claim (GST-979, GST-980) (#3889)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 07:31:35 \u002B00:00\u0027 --until=\u00272026-11-14 07:31:35 \u002B00:00\u0027 --full-history --no-merges -- lib/stamp-only.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":"lib/stamp-only.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d64e233f5a5fb81985766ffb07e16bc9aa8bad28b9189f41f830298b9d0c71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // setup, TODO and navigation calls also never inflate the original floor3. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/eng-batching-native-replay.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b23cde1a3280f90f8d183c8d4c9f319009f7b8a9e6fab4ad69926b3633db37d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // these guards. Setup, TODO and those unproved links receive no credit. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/eng-batching-saved-ledger.test.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b0bec67a280ca030b40802012fb716e2665b820ced35718364ddd02b461cf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // unrelated TODO is still modifying \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/eng-published-navigation.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec317c423b3165775f7c400f3007e00daaf76a57e750cb9f8092dc90875a1ba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // filed TODO \u2014 this guard is the stopgap that makes the duplication safe. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gen-skill-docs.test.ts"},"region":{"startLine":4943}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed426aba73550012a62c600784e8c727220ba18be55aa717432f33777d305469"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3380): Windows gap. This case is skipped on win32 until the cargo stand-in runs under the lane\u0027s Git Bash there; https://github.com/garrytan/gstack/pull/3380"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/pregate-rust.test.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"925f90f9e15da22973a00360ed06e209ec40149ec26d73fafde35930fb562087"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3380): Windows gap. This case is skipped on win32 until the cargo stand-in runs under the lane\u0027s Git Bash there; https://github.com/garrytan/gstack/pull/3380"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/pregate-rust.test.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5604318e81ebff02a89c2779d9b28badbf60d9587c40afcdae6ef1c320b380"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: codex CLI built-ins (login, logout, exec, review, etc. \u2014 but we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-collision-sentinel.test.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"41319644841647b1b7982bdeeffa30019aa339fd410a39102dea8912d1de8aee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // The later answered observability TODO retains the existing phase policy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/claude-pty-runner.boundaries.unit.test.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fc8c6df0f4441e531f05f246b2b0f6f03e31aaddd124c07fe7cd3671c2288d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // and both substantive TODO decisions must remain in review coverage. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/claude-pty-runner.boundaries.unit.test.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10c9d1e767bd831556d232c1d96c3440978dbbf0e5f888f834519fd3a5131b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Historical TODO prose and stale approval menus cannot finish a seeded \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/classify.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb56934b68c53950cb73a5b0ac188d090c3ecb8b09dbe9d7c6169e2f931406e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // summary \u2014 see the last-summary-anchoring TODO in the audit). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-engine.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"241dac9f563bd9d49908f079af79039e22f43a2a9fef6a923fde3d8f31e51f02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rotation): ledger rotation. Chain-genesis sketch: when the ledger \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/egress-receipt.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bed666bc01ca96c31c551005fc8b840f4dfacfe3e163f28e87b9b7dbb9ec760"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack that nudged the lazy-binary-spawn. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/sidepanel-restart-dispose.test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce49ca840efb6cca9394a103881695ecf81708b525dcf4525638a514f517cefa"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/designs/CONDUCTOR_SESSION_API.md\u0060 declares no status, while 5 of the 7 other records in \u0060docs/designs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/designs/CONDUCTOR_SESSION_API.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6461c2c01caa10e532cbe8fee188522e108fdb4f26b770652dee2e86ce88e65"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/designs/GCOMPACTION.md\u0060 declares no status, while 5 of the 7 other records in \u0060docs/designs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/designs/GCOMPACTION.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0195dd762b4b363197063ddbb9ab6768868df8ed1de13dde0379f28d610fba35"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/designs/v2_PLAN.md\u0060 declares no status, while 5 of the 7 other records in \u0060docs/designs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/designs/v2_PLAN.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e25f8502a58a9f5a583681ad69fb3e031c58a27498dc28d8267214a375748f3"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060getCookiePickerHTML\u0060 spells \u0060HTML\u0060 where 19 names in the project spell it \u0060Html\u0060: 19 of 20 names in project gstack spell the token \u0060Html\u0060 (19 of 20; unit: names in project gstack containing \u0060Html\u0060). Peers: TabSession.loadedHtml (browse/src/tab-session.ts:69); TabSession.loadedHtmlWaitUntil (browse/src/tab-session.ts:70); TabSession.getLoadedHtml (browse/src/tab-session.ts:246); TabSession.clearLoadedHtml (browse/src/tab-session.ts:252); script.parseStoriesFromHtml (browser-skills/hackernews-frontpage/script.ts:53). Rename to \u0060getCookiePickerHtml\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-ui.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85807cef1b8cfc279453f6183ade8658b9084d2589a3edfbb3eb0165b3630ea"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060costUSD\u0060 spells \u0060USD\u0060 where 71 names in the project spell it \u0060Usd\u0060: 71 of 72 names in project gstack spell the token \u0060Usd\u0060 (71 of 72; unit: names in project gstack containing \u0060Usd\u0060). Peers: EvalTestRecord.costUsd (crew/lib/gate-cost.ts:55); ModelTokenClasses.pricedUsd (crew/lib/gate-cost.ts:129); ModelTokenClasses.recordedUsd (crew/lib/gate-cost.ts:130); GateCostBreakdown.recordedUsd (crew/lib/gate-cost.ts:135); GateSummary.recordedUsd (crew/lib/gate-cost.ts:178). Rename to \u0060costUsd\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f7763d507d7b9026fc27ae2c288138e2c9bc8e1bcbe4c2310e59ac2678ef2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get matched styles\u0022 repeats the code it sits on: 3 of its 3 words (get, matched, styles) are already in \u0060const matchedData = await session.send(\u0027CSS.getMatchedStylesForNode\u0027, { nodeId });\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":"browse/src/cdp-inspector.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"09630e6a90bc19f5177f20234c13410ec779b1019a0ef89e7b5cbdb17461aeb4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get computed styles\u0022 repeats the code it sits on: 3 of its 3 words (get, computed, styles) are already in \u0060const computedData = await session.send(\u0027CSS.getComputedStyleForNode\u0027, { nodeId });\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":"browse/src/cdp-inspector.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92dd1a94cf8055998c63816d77c9ff3c50b6a6dd0597e1cd413a4c58ec34c91"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get inline styles\u0022 repeats the code it sits on: 3 of its 3 words (get, inline, styles) are already in \u0060const inlineData = await session.send(\u0027CSS.getInlineStylesForNode\u0027, { nodeId });\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":"browse/src/cdp-inspector.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede86ab5eafa1cfc40fffbcb348d309944b5bb3294495d0472b6dbfe037ff517"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run content filters\u0022 repeats the code it sits on: 3 of its 3 words (run, content, filters) are already in \u0060const filterResult: ContentFilterResult = runContentFilters(\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":"browse/src/server.ts"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8404a02e9a4c2862a8c4fcf665c99f8be39b2047c4afad7e1c13293e10373f87"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create the session token\u0022 repeats the code it sits on: 3 of its 3 words (create, session, token) are already in \u0060const session = createToken({\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":"browse/src/token-registry.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bda1dda615ceb06936e7743bb2e9d5b987561a453ac01b64648f0988f512232"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify it\u0027s in the PAGE_CONTENT_COMMANDS set\u0022 repeats the code it sits on: 4 of its 5 words (page, content, commands, set) are already in \u0060const setBlock = COMMANDS_SRC.slice(\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":"browse/test/content-security.test.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7232303d5be4142ff4467de4f8bb88eeaf4dace47d64f5c7fcb43f85e7f0fc6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Intercept security find-generic-password calls\u0022 repeats the code it sits on: 5 of its 6 words (security, find, generic, password, calls) are already in \u0060if (Array.isArray(cmd) \u0026\u0026 cmd[0] === \u0027security\u0027 \u0026\u0026 cmd[1] === \u0027find-generic-password\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":"browse/test/cookie-import-browser.test.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e6f695e40e8953df1c027ec42af427682b9b4a0f7c9dce20751e925d301a2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write a valid message\u0022 repeats the code it sits on: 3 of its 3 words (write, valid, message) are already in \u0060writeTestInboxFile(inboxDir, \u0027valid message\u0027, \u0027https://example.com\u0027, \u00272024-06-15T10:30:00.000Z\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":"browse/test/file-drop.test.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7eac430fb4846e32bb68d0f5f2c956bc4706dfd1f0389418166f26a16e7293"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022400 bash -\u003E 300 sh -\u003E 200 \u003Charness\u003E -\u003E 1\u0022 repeats the code it sits on: 6 of its 6 words (400, bash, 300, sh, 200, harness) are already in \u0060const under = (harness: string) =\u003E table({ 400: [300, \u0027bash\u0027], 300: [200, \u0027sh\u0027], 200: [1, harness] });\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":"browse/test/session-name.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b08519fa2d3423bae0bc9c706f635c5257b71c23f443871677e8987a5553e80"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Step 1: sidepanel sends sidebarOpened when connected\u0022 repeats the code it sits on: 6 of its 6 words (step, sidepanel, sends, sidebar, opened, connected) are already in \u0060test(\u0027step 1: sidepanel sends sidebarOpened message on connect\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":"browse/test/sidebar-ux.test.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eea8dc7b5722f8edb652781272b2357f5b0ff9e3131c3a6fd445b6ac2e19fc0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Step 4: welcome page hides arrow on gstack-extension-ready\u0022 repeats the code it sits on: 8 of its 8 words (step, welcome, page, hides, arrow, gstack, extension, ready) are already in \u0060test(\u0027step 4: welcome page hides arrow on gstack-extension-ready event\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":"browse/test/sidebar-ux.test.ts"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f488fc27aef709eec67e1282f485faecbcef142cc6bd31cf4b437abb5557d06"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the image generation result in output\u0022 repeats the code it sits on: 4 of its 5 words (find, image, generation, output) are already in \u0060const imageItem = data.output?.find((item: any) =\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":"design/prototype.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf9957e72455d61d638684df575239547d51028ef6b2ebae4c427f95b384ba8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022All images are base64\u0022 repeats the code it sits on: 3 of its 3 words (images, base, 64) are already in \u0060expect(html).toContain(\u0027data:image/png;base64,\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":"design/test/gallery.test.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57c7e92dc837339e75680f28731c6fc32f25e468f554bcca82ef191d477d6b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Box model from computed\u0022 repeats the code it sits on: 3 of its 3 words (box, model, computed) are already in \u0060const boxModel = {\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":"extension/inspector.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4732462b3c94c68f02f0987106f40b2e0e8141fde4e021e324c76fcac12ea5ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Total budget: prefix \u002B \u0022-\u0022 \u002B tail \u002B \u0022-\u0022 \u002B hash\u0022 repeats the code it sits on: 4 of its 5 words (budget, prefix, tail, hash) are already in \u0060const tailBudget = MAX - prefix.length - 2 - hash.length;\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":"lib/gbrain-sources.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1426cc38fc152f5af28a8969e9397f9c28c765de41fef7ed2de3f30a211764e5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Detect base branch\u0022 repeats the code it sits on: 3 of its 3 words (detect, base, branch) are already in \u0060const baseBranch = baseOverride || detectBaseBranch(ROOT) || \u0027main\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":"scripts/eval-select.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c63f36183e595f10ed0404e62ee1d5831bca6f9001505848c0a24614a3c1a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A registered file\u0027s case shard supervises its one case.\u0022 repeats the code it sits on: 4 of its 5 words (registered, file, case, shard) are already in \u0060const registeredMs = finding \u0026\u0026 shardCaseId(files[0]!) !== null\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":"scripts/lib/paid-select.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c783a3572ea57f13efc982c12fcd91226da05de407ed71e6aded7a9d7262bb9e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 Check branches against tests \u002B quality rubric (shared) \u2500\u2500\u0022 repeats the code it sits on: 6 of its 7 words (check, branches, against, tests, quality, rubric) are already in \u0060sections.push(\u0060\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":"scripts/resolvers/testing.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a74fadbbdf5076dc129d2bd9d65ea6b85d586121a73ad1f19ccd861ebc96cc4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 Test plan artifact (ship mode) \u2500\u2500\u0022 repeats the code it sits on: 4 of its 5 words (test, plan, artifact, ship) are already in \u0060sections.push(\u0060\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":"scripts/resolvers/testing.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5ad668259f67a6e5fb87a8b441b9f8465c818fd54c927842f81519ed8791f6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Project data preserved.\u0022 repeats the code it sits on: 3 of its 3 words (project, data, preserved) are already in \u0060const preserved = fs.readFileSync(path.join(tmpHome, \u0027projects/user-data/learnings.jsonl\u0027), \u0027utf-8\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":"test/brain-sync.test.ts"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb026ea79a6e9eba40450b05630ec7efa271c09b90f64ae0bef4460a0955f16b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for codex review with inline $(git rev-parse)\u0022 repeats the code it sits on: 6 of its 7 words (check, codex, review, git, rev, parse) are already in \u0060if (line.includes(\u0027codex review\u0027) \u0026\u0026 line.includes(\u0027$(git rev-parse --show-toplevel)\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":"test/gen-skill-docs.test.ts"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ff24e86de5a9f89adb57e5750504c64ef8d977635d3e725c7b01fc881bdab6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Fixture: minimal NDJSON session (system init, assistant with tool_use, tool result, assistant text, result)\u0022 repeats the code it sits on: 9 of its 11 words (fixture, session, system, init, assistant, tool, use, result, text) are already in \u0060const FIXTURE_LINES = [\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":"test/helpers/session-runner.test.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"251a68e57b9e7fa8b6ddb7840d711c7a040d48847d3e0e5129a199e0f4bbb44f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse all collected NDJSON lines\u0022 repeats the code it sits on: 4 of its 4 words (parse, collected, ndjson, lines) are already in \u0060const parsed = parseNDJSON(collectedLines);\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":"test/helpers/session-runner.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee3bb2a6f199bdaf3cd78cc6a05dbfa8e2544cba1dba340d6d542c0cad64f36"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Restore with wrong schema hash\u0022 repeats the code it sits on: 4 of its 4 words (restore, wrong, schema, hash) are already in \u0060const restoreR = await fetchJson(\u0027POST\u0027, \u0060http://127.0.0.1:${daemon.loopbackPort}/state/restore\u0060, {\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":"test/ios-qa.test.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd56d9ba5912d1e741cbd31210549a23af58eb8cf7c96c84055ae8d44dbe127"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Error logged to hook-errors.log\u0022 repeats the code it sits on: 4 of its 5 words (error, hook, errors, log) are already in \u0060const errLog = path.join(stateRoot, \u0027hook-errors.log\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":"test/question-log-hook.test.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d795f920e4bd92b03627b042c6cac9e9f91c586798ae30a74576e72542a7adb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Expected: qa, ship, review, plan-ceo-review, gstack-upgrade (its real name)\u0022 repeats the code it sits on: 8 of its 10 words (expected, qa, ship, review, plan, ceo, gstack, upgrade) are already in \u0060expect(entries.sort()).toEqual([\u0027gstack-upgrade\u0027, \u0027plan-ceo-review\u0027, \u0027qa\u0027, \u0027review\u0027, \u0027ship\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":"test/relink.test.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cde51d4c2a8aeb404dbfe358099582f516103072d028e6fb7db180f948a08ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Expected: gstack-qa, gstack-ship, gstack-review, gstack-plan-ceo-review, gstack-upgrade\u0022 repeats the code it sits on: 8 of its 8 words (expected, gstack, qa, ship, review, plan, ceo, upgrade) are already in \u0060expect(entries.sort()).toEqual([\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":"test/relink.test.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"da88451c33a11810ebdb3380ea2c7ba741f6742b9721b17b9a25858ee5609714"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Idempotency classifies as DRIFT_STALE_PKG.\u0022 repeats the code it sits on: 4 of its 5 words (idempotency, drift, stale, pkg) are already in \u0060expect(idempotency(\u00220.0.0.0\u0022).stdout).toBe(\u0022STATE: DRIFT_STALE_PKG\u0022);\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":"test/ship-version-sync.test.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b152996e002ece3ad821e4f044187f68a495fcb5caf7671de2ed084f719056"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Routing CLAUDE.md: the ## Skill routing section gstack ships.\u0022 repeats the code it sits on: 6 of its 7 words (routing, claude, md, skill, section, gstack) are already in \u0060fs.writeFileSync(path.join(workDir, \u0027CLAUDE.md\u0027), \u0060# Project Instructions\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":"test/skill-e2e-context-skills.test.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f434e76b820e32b21cb7d3d4b6f22a0cd0ec9d43543ab6196aa61c46c72d03e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Record to eval collector with outcome judge results\u0022 repeats the code it sits on: 6 of its 6 words (record, eval, collector, outcome, judge, results) are already in \u0060recordE2E(evalCollector, \u0060/qa ${label}\u0060, \u0027Planted-bug outcome evals\u0027, result, {\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":"test/skill-e2e-qa-bugs.test.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d8fd35c7046594dbba1f3208e9757a4d03a4e75cf49094c88136b4a1201eff"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Seed timeline with a completed event on main branch\u0022 repeats the code it sits on: 5 of its 6 words (timeline, completed, event, main, branch) are already in \u0060const timelineEntry = JSON.stringify({\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":"test/skill-e2e-session-intelligence.test.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f09b1e8931b9268ff6b169cdf1f22a653f968df9a62c1fb589cbd4cf134fbd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mode detection question\u0022 repeats the code it sits on: 3 of its 3 words (mode, detection, question) are already in \u0060test(\u0027contains explicit mode detection 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":"test/skill-validation.test.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d179f9e361de90147603d4c17389c0376624b633988b616b1cd80064a8fa31a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060(repository root)\u0060 (186606 LoC, 2621 module-visible types across 37 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":"544099b6d43d76fa7987307adbaede84119056febbb168fee4c0686bd8f493b0"},"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":"0b82e8a1ad3a15ec85262ecba0307ce12ea104014a2cea15dcdcc6f350bc5558"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6113efc192e1df0df22eda36edd36acfa72eeea3a56042d3185e5b004a409daf"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9973f1445e0723fc420a73ffb040fe19cd2919f8da4e5594b2bf3ca829294215"},"taxa":[{"id":"CWE-676","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df965372945a80dc95ea3f8593c1ab9b4193e655fdfac98efe3fa573fb10fddd"},"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":"b995c516b1174897f1435e127a562a72cd11087eca1f577816094d2ef026d0a1"},"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":"e212791ddaaca4050f6eb305fc07e9b5ee39ed1df478b919d04026e2e16f7459"},"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":"6202e4fb714b3ccc5a43d0c3ffc046fca36a83b79ecef202ae997ca1434ea959"},"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":"900b815779ea16f0e8ffa50153aa85091f480ab5a9d61b60892a9032dbb24d57"},"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":"13d1e30c544906b5530b07a195c8cdcdbcbde282399d10614e706af26da146e6"},"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":"814a4b7a05cc7a746e11b359e801ec50252c45f911032a05189b90ec12949e3c"},"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":"c51f6ae2dcb1132012a4bb06f2b0b860378114a0247ccec08e849f5fd1a97395"},"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":"3a1f7e81aeb744d5f6d3110bfc1d068fa2e593603534db8185f8de34774dd217"},"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":"16c11c2c37abc3bca6b4c836cc9c48d699b0d67a83936bb66e537c508c7c987d"},"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":"1578328d535db300e8f4d438671d90667c6e5f0f17f90db6784529fb96adcfb9"},"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":"8a57d75c47429f34070b279ab34e2eaa106c25bce08dc054948642aa407acd24"},"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":"9683afa4d89b4807e9290a29fa68a1f535a579926c5060b8ff6b0724d4563593"},"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":"c063e1fcc8445a419e92cb29d3cc777468a836f55088ae263a1904f13a35086f"},"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":"8b6d1a56cd99a1008ec90da787b31338172c827a0a03e36dcbf550badf40f75e"},"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":"b6919956bc2686bf249386858cf290a8c5283e25527a13bb428ce3750053f334"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2dda396b3efff1b78a8842e36245de6c8f012b32542290a0635e93a2f209f7c2"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62439fba749330ec5e050b1848d4047e1e66e879fade771f7bb4c171f45be09a"},"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":"bd049e46bfad925da7a9f7f7b72da9c8005ceac098f9f9460bfadab37f4a4df7"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"997747d2cc7ee6cc2457ce05a2d8db4cd8493655a17b2211ed66d02ec0036ffd"},"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":"826c71872e04309eb8aae688b154df5b706f4894a8aed6fd4ab92a25dab7eec0"},"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":"3db927cd344bf8204175a2130e8ebc0cc25da08b9eaf316e48ddd1b0f7cbd7a8"},"taxa":[{"id":"CWE-310","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":"f7c8a93f1b062977d060631c02b54c22b523bc992798087ee5d03bc19001f846"},"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":"dcbfe3e09f791243a9ab86aa44f2fb380fe78d29601c5ab62f3dab06e20c13c7"},"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":"848db465f7aa26f7482f94319a6df78b5e72c312cb9c20a0e368abe98f363755"},"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":"6e087998f39fa2de331243cd04014e17ea45a55834c6340a9f9aa92415e961b4"},"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":"74aeafa09fba26e5980c9fa381a2bcbe7a38ff60ffd73c59620a60ae96ad7967"},"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":"8f4db4fc203d3be592911c73adde316180c5047feb84220be4ed9409cc38229b"},"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":"cb4ab1c881718ca06816a80ba71483ea62a522ef26d267b14095e5e18003609e"},"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":"0e5c00e7e9abe18e2444a17ba04ff0aacaddf2c3c38a63483b2f58ddd2e10335"},"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":"340a96cdc62206e8252a6558e03d83fd4afdd868070ed79ab0c4df03afb5792f"},"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":"1bc1fedb744b74c9785ecf0931079a4e8ba9cd68edc8e94d1352502a25c0b4ed"},"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":"70d41f08acd184fe0b1077470c143e8f7544cfb36756ada1384a27d6654c8c47"},"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":"8327b36365276be470522692180dd2a45592cc5e7869576045f484c427c9810a"},"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":"5e8ec40bc5a32f2ad0265d6596b8393d8ef5400e33e3cdbe2c19beeaa3fd50ac"},"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":"a75bb6769b96a0380e4f2720f3f66fde3fc31ee46d740e0923c54e12288dc242"},"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":"e8aa3ce83663c07803fd41689f31ee5161d99293432c9e45bf0413304c79adf8"},"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":"5ab935519cebfe8335139a0bad00f743908d20f96b36e2a12e9f85a4cdd47abd"},"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":"ec49d6bf9bc86f29071b7f19d38bbd568b7f6486f6195d7a666a2152b1d8c684"},"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":"b1f1ee08660def78ab22d74f45daa92ee48cdf8daeb7e5c02d11075ed82c74ab"},"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":"d1ca099a087098533314748f75bbc158b51f98f93ce0be2c80fa853bf69e98f9"},"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":"af34623d738b299c1ccdb9b3b110adf119788cde26f577c6f27309c0992a2749"},"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":"2103cfed9b9476ad63d42815c63c9c0d1eafd1af7d95b7088a5c5abeb240b258"},"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":"ec3acd307e1c29f66f33f7a6be558beb6b94509b54f16916e18e19ef681358be"},"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":"e64800938bf887bc67b00553f864fc3d2f575672aa06c3c3fade6c90baa0f8e1"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"810c6e89c6f62436ffb1b0d985598226579b506bb4a3d64ab69286a80ea35210"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cece1c56e8b50fe843c099f046a62ffae8c887726e312670a2c108b74bccd290"},"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":"67b8df343e8d48112a99b8b4cee1da296ffa23738a9b670ce00f2aa6d932c7a3"},"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":"f8449723d28c89fcaf4f81818cbca0af41b8deaa3ec33d10affa38e155d23a4d"},"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":"6007269afc07e96b3f9da095b6f2ac96db13fb9c29b96838125941cf6542a395"},"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":"340434d5f9f2b696898a6a063cc52c9b2fa162731d68612e1c6bb6c2cd85830b"},"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":"74da57465f1abd520ea7c3188ce593f735ca71ee32a16cc390f0786a4641998c"},"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":"2c8b5a5394becb776c607f2214fe19c0c9a15500ab1303e87f44aee72764358e"},"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":"b282c6a1f9a4798929717a1c96129ac65746415e871d751d6ab2f0f35abde8c6"},"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":"796f2fb43c3a15d787579e7d8ac73d0cf007197596f8472c7e7ab4a04c0fbb04"},"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":"06636e91ed87b4a89ada722d425ae55eb3797ec5a04e58d4e42f3f320917f407"},"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":"ecdeb1e06955f64d83ae77f7210fd416f67c87f5398a4c61f3d9635844808d77"},"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":"3806485936670f4ed7514e6f1c45db699116ea6a09a41e7a98f1dfa5af12f7c3"},"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":"123ee85b92dfb6b743403aea71c32d9a3a1fb288d171f75f89dfea27bea7507c"},"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":"742cf3a31f75359a9003fb42612f87560fd49d3aa209d1cede292c10d8e57f4a"},"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":"b37e84c5a88a383512667a2bd685a52db4541790d21e7afd496c9bfb980f79e7"},"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":"3402a0a89a58156e469c27a9602b3b3b44b496ab2fce524f213285676112299a"},"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":"9ad50863938325b340d0825d1725b7c56b051e7bb6fa68711c2c3790726b87eb"},"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":"eddad595fafeedfd0a8a886dd449ff27cf2688c215392b33edc707ad661e1304"},"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":"44d1d982fb5d1f88bffe5b56dd53e9f255e040921ccbebf4c7be07d3b22616fa"},"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":"75de98d19f988fccf2abbca5d8cd9bb6b294c4c8f4965fced969e79b6f6a4c8f"},"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":"db7fc4bb1da160a7c60b6675819ac99ccbb0174df6dbef1695cac3f8cd54c50c"},"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":"a045d6a143914b1ae26a773c0561a2a62f2431153c97175973409e20530a6d0b"},"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":"bc13fa1c4fb0650e5d71ebd236ee36eb826efa0739916e09ecbacee2dc6519af"},"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":"f2d7994ee1f39ad4812bd9121289f6c938beadf2adaf9c93f3275fed91d49c2e"},"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":"c4ac721bd0a9443741f459c1e83cd40904b558cfc7e588a478e9f1abd0946924"},"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":"cbe28f79b060cdb63d874a13c8dba9ca3554508c0424c49a6ff83bbb9557aec9"},"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":"dfe29596375d3d7d7e677730966963fb19a081f9b538e2bc382bc163fb31af3b"},"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":"66384c674d08c667c9a5353c88c3744b2eb30b5251146df223d6753acbff835c"},"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":"a2a3c7ff7d0fa86d2ff03cb2da48e06b5260b29db2c6fbded3b004ac65d9663e"},"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":"bff42b0f80d5602d1a75d1c10427d2da675a973596bceaeace9769b063137d57"},"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":"a0f955d2c613ac0c1a214e6c4ddc170dbad224b666ff102bda447cbcf49a7be7"},"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":"aaa41fc3b19f9988e6b5fa9c4dd66575293a43a004a56656cbca6a8bef841f12"},"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":"a41457d423f3d418f346ad0a8bf2ca240aafb3ef77b21f5ebcbae06b7bf72b03"},"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":"c3455ec852d629cdd5f67b4290ef1086b844ea31f1af33925bdc7e3254467fce"},"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":"eeb8bba21b14f581d379229677ab30aa998c2f793ccc6ab3b3b3fa533d40e556"},"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":"3b864b12a84dcfee6922f9bdbfa7924e3caa1d064797226a34bdf74c687dba79"},"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":"1798905e4c006ee9bf63ae99e8540af92f33779186f7ad14135d601e8a8d979e"},"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":"68830adc64e5a7e6f4a939cf0efb255fb2da79c27363cc71ed9283e78a85845f"},"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":"fd57366a68c8811d611fca00b7c1696363140a3f9bdd7c0ad33537cbdaac6f65"},"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":"0558b807a7d979865d33f2485bea8965c489a9139b7c8a32aaba91066b04ecd7"},"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":"8ed0f8b7836e082f4f941b4e208574cb7412113bdd4bdddbbf1cb34d8feb09da"},"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":"6db3059e7ba8ffc82c758e26e243fb2cccb32ebf8e85917fe82fce74dedddeac"},"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":"0fa33b22196eb1cfdf2d0fc2e1b2057d4545bcb5d38a13a1634d618353b0bf50"},"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":"2bb0ac67bc82a6774666314d3a05daa9ca48d6d210efd86c1a6280d3762749c4"},"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":"3dc3e8e307afc7c87c34b56c30a5c3cda8be908991a3f34f9893489bb3624275"},"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":"7932be72fca2d9b1d55584a36e10f2bd379daf8de505a4a1f704092b4c31c6a0"},"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":"204ba8d345cc9285bdbaa9109459c13fe17fe9393b80a19b0aae976b7c918600"},"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":"9f824c100899e7d82c28ce848f425fc7b2329277e03e128f530f73a71f8d1114"},"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":"8b86755015def4ad4a39feeab5de9110d3a994014fa39981904c4234bb7899d9"},"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":"e7a5b01d653567d8c72445b6c4530c9ae4b82a6905d34760e27eb2cce8f26f95"},"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":"4f335b2bc6969b454c196f5b06a9703df3af024a4a4140e902af6b36b45c0edc"},"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":"c0eda86518543996bc492278047be28388dda209c6f7420e8e459ebcef8f9860"},"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":"c8e89426c4476b320f004325d7b2c302f181ba876ffd60241f03472dbe9642e6"},"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":"50c5eb5c7f55ffc04574ba42f39c28dab3a1873732097d72593c007ed293d6dc"},"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":"ff6071de3390d6fe42c4346a981076774bff00a6109a769a2394db28ba0fc43c"},"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":"8f16765310adaa07706607297df4654b8f227c50c28d9550c878b032252a5911"},"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":"0faff5c4de00ae99ce8e7cd4ba780483b013ad323541029b2dfe46fa67db3bdb"},"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":"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":"c3e543b22381f07dab5e0182e0e6274a59886787decce5b7a9d26bf98e3db95a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b63fd18137fbf647964ae41f72b5f73c3dfd241ce6f19faad95131fe553839f8"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c5b4bba55b9cb670ea5d2baf5e4c20cbc3d9161017afefd3bca224055ddb1a1"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"92865fb1371b3d5a1fa94c9fe4f0271bf77289e312a785da014841f53a3fd354"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"026fe5d82eb0faeba02ecdc03f1a143ad4c741e3c2d003dd268ba5130c0790c4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a4538010dcefe4917579df8a1e7a1f44e2fd6e935ab6d28436fb5ac16a8ddc09"},"properties":{"dependency":{"package":"hono","version":"4.13.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"558bb848fc8c31c84f6a62457c03b22724a6c98c6587407ea8e384316cd6cde1"},"properties":{"dependency":{"package":"katex","version":"0.16.47","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03648a9fbf9a699b5a3efd2590ebd8c1a1e9727920c6ee077a5cb2c300a93d36"},"properties":{"dependency":{"package":"katex","version":"0.16.47","advisory":"[CVE redacted]","reachability":{"kind":"not-imported"}}},"taxa":[{"id":"CWE-807","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"257b5e026e2bc0bcade698a4acc4c4bf4bada5df017336a1fa0de6dffded6201"}},{"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":"43ba574047ead0ade706bd656e4c13861cc8e0784f92bd150e2e68d8dd69d684"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ceaf03377c4242789b18484d3b91244db5aa5e400f070c026db5c654612b6879"}},{"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":"7d7c01e4d6fe1a1000ec29fecf27b41f1ba6a6967f4b88237db2e904f73da017"}},{"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":"bd02b27ea4d6faed03c78a1d1bc23fc3eb3a0573fa750a32d12baac0a899b6f4"}},{"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":"1694bb7e479b283803edad2e436ef6bef0796304fc96f2dce5368e2dceb5716d"}},{"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":"bb336b6f3c2aca0d3dd5ad6bc0fc9ad2363edb80c8361952a42ad1b911c88245"}},{"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":"7a98a51c706a46b71ccc2481020bae3ef460e75bab3026d381d6d3fc08d368aa"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors-tool/Sources/GenAccessors/main.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c4cd28447b2631ce078892770a3416c188b30ceb3d128dc51d275879cfb42d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: read-commands.ts \u2194 write-commands.ts: \u0060browse/src/read-commands.ts\u0060 and \u0060browse/src/write-commands.ts\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00607e96fe29\u0060 fix: security wave 3 \u2014 12 fixes, 7 contributors (v0.16.4.0) (#988); \u0060c6e6a21d\u0060 refactor: AI slop reduction with cross-model quality review (v0.16.3.\u2026; \u0060b73f3644\u0060 feat: browser data platform for AI agents (v0.16.0.0) (#907) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8137781b0693dd0f7eacca563f8d9cb03fe2313db9a5f5119edfc716e67188e7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: meta-commands.ts \u2194 write-commands.ts: \u0060browse/src/meta-commands.ts\u0060 and \u0060browse/src/write-commands.ts\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006019770ea8\u0060 v1.51.0.0 feat: $B memory diagnostic \u002B 4 CDP-resource leak fixes (#1751); \u006054d4cde7\u0060 security: tunnel dual-listener \u002B SSRF \u002B envelope \u002B path wave (v1.6.0.\u2026; \u0060c15b805c\u0060 feat(browse): Puppeteer parity \u2014 load-html, screenshot --selector, vi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"914c09424b458c535d8948ef6f93ca330101412cf10aaba981d38d8d1627a13a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: capy-review-pass.js \u2194 review-pass.ts: \u0060lib/capy-review-pass.js\u0060 and \u0060lib/review-pass.ts\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00604bee369d\u0060 Retry /ship\u0027s second-model review on Astra, then Gemini, when OpenAI \u2026; \u0060a4d058b0\u0060 feat(review): enforce the reader fetch rule with a per-stage sweep (G\u2026; \u0060c9d55cf5\u0060 fix(review): Step 11 on its own --out renders only the voices (GST-13\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/capy-review-pass.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"537733ce8da3f58e23098cbab087ba6e3e52592873196808e92679194fcb146a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: read-commands.ts \u2194 snapshot.ts: \u0060browse/src/read-commands.ts\u0060 and \u0060browse/src/snapshot.ts\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 \u0060ea51b45e\u0060 v1.38.1.0 fix wave: surrogate-safe page captures (#1440), Implementat\u2026; \u0060c6e6a21d\u0060 refactor: AI slop reduction with cross-model quality review (v0.16.3.\u2026; \u00601868636f\u0060 refactor: extract TabSession for per-tab state isolation (v0.15.16.0)\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bc1e4a4861454493c0166837b0c48bb2f3a26c8d3bcf942981e21504f727be"}},{"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":"5e4607103018ccbf4772504c4475df05c43062f243e17471503584c98dc62fdc"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/ids.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"270c1b6315a9b3188f5672c64e612931f9a2b10ae338303aee956cba03a0e530"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/ids.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c406ad4f45e053e29cb9daddce4dc40b98e6c01f3fafb4b2884e8e05bdf16d8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.html"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"17511cb7fc55c502fabc9c6f162be8c27f874e7968d50fac664a1b72554913db"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.html"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"942a94096eb5162c98ec5cd2901006786d1241b8a28569ac471f9d555514fce4"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/commands.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d02c62f6e93b094a6829c527ebf12471c6c9f7864a5ee26da260f5b89451c42"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/commands.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6a92f5bf468988197e21aa012c338dfec044bf193c6ae4e45246e84c63ed1b"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/commands.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"baee8ea923510edd3a551a0ac950021f01b8caf38973dae3e0c6ee56af7a2caf"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/welcome.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9f81980ac33df6f7b5b7cd789569c871139fc741f5b614928e7a9a60463ca1"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947f61ab5fc569438f42aa31faf42de6b0ca401254ad78f13030315ca7df414"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6f96c1f0f363cd3e51702b2a6502d36d8a44ff45febeb6b80c2a8c5fc20e3"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa1e8b0abb3235c61cd4ec76238223315bc27dd81b7885c408a0553730b40eb"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"005073d9a2e3643d8c5eaafff6d402a0555cf78c6c63f9b899af9fb5fc78ea55"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99aa3453acc8e280715731de492a2ff2f6a03b8c9203212527ff4191c1f716b"}},{"ruleId":"AC3","level":"warning","message":{"text":"More than one main landmark: A document must expose only one main landmark. Multiple visible \u003Cmain\u003E (or role=\u0022main\u0022) elements confuse the landmark map and the \u0022skip to content\u0022 target. Keep one; remove or hide the rest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed822c2d9af7edb925b65d4e81429f62beff9af58eccb907026b3005a2a3a76"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .footer-port with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.html"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565f8099222073da1a7086fc25d810aaf5cad160f04cceb9f0f5868e7415e35"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.html"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfef78118ca8537f7015b9e23b5cb47d539309e681aae6582094af1fac487d4d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sidebar-prompt .arrow-right\u0060 moves (\u0060animation: nudge 1.5s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/welcome.html"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"44796d7da22b9edc7361c563d8abd3678de3191e0f85b0691682c34afeac66bc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.4:1): \u0060footer\u0060 sets color: #52525B on background-color: #141414 \u2014 2.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43bb3eda968175d429f8d8c7b9a6e0a817c309b7d6efe7b37255644223db305"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.mem-toast-btn.primary\u0060 sets color: #fff on background-color: #ef4444 \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddb497efb9ac6c422c50f3ff58af8fecdb83ebc045548eb37ab520e57b49805"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.0:1): \u0060.inspector-specificity\u0060 sets color: #A1A1AA on background-color: #52525B \u2014 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d1fadd8a402dbbb7dee735f8f24450ded116e742dbea59f874d2a40daf6325"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#gstack-inspector-highlight\u0060 moves (\u0060transition: top 50ms ease, left 50ms ease, width 50ms ease, height 50ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.css"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af20237e8b3a4cb7e7cd5294baf61b8a271c838daaccab8c60ccd487d986a5a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.conn-banner.reconnected\u0060 moves (\u0060animation: fadeOut 3s ease forwards\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc377657856d164156f44030432105065fc9ebf3790358a2c28c5943e96704ae"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.chat-loading-spinner\u0060 moves (\u0060animation: spin 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"909188388ee0de4f60dd3a39957ff878a1a934b59e2a1e505e0b9df8655128a2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.chat-bubble\u0060 moves (\u0060animation: slideIn 150ms ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f8accc9a6e5036c091120370014c9a9a27fdebad46fc8918e2c67fcaf88de6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.agent-response\u0060 moves (\u0060animation: slideIn 150ms ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf7d63f4798504ceee2406482dccc660422901298171cf390da5a0fd1bf3d0f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.thinking-dot\u0060 moves (\u0060animation: thinkingPulse 1.4s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5886945862be58a0a69d6b8a1adeb26c671a8f15eb00667e914e30674f6dea1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.activity-entry.pending\u0060 moves (\u0060animation: slideIn 150ms ease-out, borderPulse 2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"d991e630d0ac652dd4e148d78f2bf9487534c536e637c8496860e95574e8ae9c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.gap-banner\u0060 moves (\u0060animation: bannerSlide 250ms ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"1780494460a380bcca93af71b3aab7930cc8cc23738fbaf2ec304bc0a3e27219"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.quick-action-btn.loading::after\u0060 moves (\u0060animation: spin 0.6s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7bf6d841f7d156a3933c498686059e6c8a0038ee0c065a18ce976e2b127499"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.command-input.error\u0060 moves (\u0060animation: shake 300ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc413a8269d8b254247b4a656da9f52b2cd8aa89e27a2d40918329c12a72ff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.inspector-action-btn.loading::after\u0060 moves (\u0060animation: spin 0.6s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.css"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5a1f3f13cdfb83ad12270ec3e42dd8fcc441d03cdd40ed0c0c1e77fa42991"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022Lorem ipsum\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-catalog.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf22ca6f067e1b11ed6ac14dab07c8a635aacb67f8a75d205f0639a0e13c092"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022Lorem ipsum where a visitor can read it.\u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-catalog.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f32c8fb74c3f2cb890b92da0f4524858f712cd6095df3560e7f61b241fe9115"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022Grep visible copy for \u0022lorem ipsum\u0022.\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-catalog.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f62e87878b3cc3da7280f2da783e12d84d3fc40c57021bdf1dcee15419a8d"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022lorem ipsum placeholder text\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/ids.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbfe9181f135893dfd6bf555e612358252c242b28038cc605b16b628cafc63c"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022CHANGEME\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b948768a91400863b95be8c490e5def8b0724461770d77199443a0936e60d7"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\u0022CHANGE_ME\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcfd2f4bc2ab6f7c58f9ba478bc3b9fe95c7d1a6af652d3dbf72d726e38e58b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060flushBuffers\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":"browse/src/server.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1b3f656d5802a922be8df0601436c6b4dcdd7ca7a9085c37b4e7929844dcbf"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060ensureDir\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":"browse/src/tunnel-denial-log.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"54225c3a3ccd0b7336f8ce9b87d4f1a52f7051cdb3b4451ad0a12521475803a4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060gracefulShutdown\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":"design/src/daemon.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca222ba920a0795cceac2ad5cc9051814d896b6f592f4aa4355c6f293558a3c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return selector;\u0060 also returns \u0060selector\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c45b05b037fc4bad3037e445c8c716588264188732a94e0bc8f51150a8d41e"}},{"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":"extension/sidepanel-terminal.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a9d2c5b94f9dbc0042ce52e7977b2cd9f13ed93cebd9a0455ccf8da1f5b69e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060read\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":"lib/cso/cli.ts"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"025264f6cc0c29c5973573e8598b57ce7592cec0e7b967f5cb4c3b5af43015c9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060history\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":"lib/cso/cli.ts"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55c555b3bd57d278fd5abe837d708ad3ee471f70ec61dfc242929abd8123c85"}},{"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":"test/fixtures/shard-equivalence/skip.fixture.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a28a5fcd2585ce5b83de389203a59bb901677083599d5ea58524a23f3d2c00c"}},{"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":"test/helpers/overlay-case.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b786d776fff8ad75987ed91519d55df1babd6b2e6d34b8090afe896ea008511d"}},{"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":"test/skill-e2e-design.test.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50ea422eaf9099883f6cbec4294a1579405723b5e7eba94042e88d8316bc64d"}},{"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":"test/skill-e2e-safety-design-risk.test.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f045d1cfb01e17632b4fa6d13921578fde783a06e399b5da4884c7e44e1d6b"}},{"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":"test/skill-routing-e2e.test.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8480ecb40e0a17e28366298a858d14a07cfdcdb9b99b405a07bad827be9eff85"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 10 ADR-shaped document(s) detected by content \u2014 \u0060docs/designs/CODE_INTELLIGENCE_PROVIDER_CONTRACT.md\u0060, \u0060docs/designs/CONDUCTOR_SESSION_API.md\u0060, \u0060docs/designs/GCOMPACTION.md\u0060, \u0060docs/designs/ML_PROMPT_INJECTION_KILLER.md\u0060, \u0060docs/designs/PLAN_TUNING_V0.md\u0060, \u0060docs/designs/PLAN_TUNING_V1.md\u0060, \u0060docs/designs/SYNC_GBRAIN_BATCH_INGEST.md\u0060, \u0060docs/designs/multi-agent-wave-2026-10-10/ceo-native.md\u0060, \u0060docs/designs/v2_PLAN.md\u0060, \u0060document-generate/SKILL.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 558 JavaScript/TypeScript production file(s) this check read across 2 module(s). Each was searched for its ecosystem\u0027s logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"warning","message":{"text":"SAST runs, but gates no merge: \u0060cso-scanner-images.yml\u0060, \u0060scorecard.yml\u0060 run(s) a static-analysis scan, but no workflow that runs one is triggered by a pull request (or a merge queue, or an unfiltered push) \u2014 the scan fires on a schedule or a manual dispatch only. A vulnerable change therefore merges clean and is reported on the next scheduled run, by which time it is on the default branch and the only remedy is a follow-up fix. Add the pull-request trigger to the workflow that runs the scan so the finding arrives before the merge rather than after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73211886541038635ced0208da9cedd27ed1caa9132fd6aa5e44d2976a4de6d6"}},{"ruleId":"P3","level":"warning","message":{"text":"Secret scanning runs, but gates no merge: \u0060.github/workflows/platform-qualification.yml\u0060 runs a secret scanner, but none of its triggers fires before a merge (no pull request, merge queue or unfiltered push), and no other workflow runs one that does. A change that commits a credential merges unscanned, and the scan reports it afterwards, when the secret is already in the default branch\u0027s history and must be rotated. Add the pull-request trigger to this workflow."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/platform-qualification.yml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f8f625eff536fc756b7b195414496dcb2f5ac62a11fe31943b87bc62abfb89"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/bun-polyfill.cjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e945e89ac942da9d19728af051d98322fc283b3cbf18458beaf47eaae3f439"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"582e2129ff0decdc6adc61dd4c853cbbaa111ce399aa7abba8d3035843c27781"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a3adea16fb7b31629398d3d4b27d42f830934fe08042e54acc75a2b4401d89"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6b2248960640cef50548d30ad94abe12eede187085f7e1f46457a5e31cc367"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801106e68fd6bdca3875b6f991dd72f2fdbb309d46b957d7fd183177b3db541"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetchImpl(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/receipted-fetch.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"25747d571e8c5fd84be5121c95e18ade0a2605e039c278c6dbb5fc3bef3e8ffa"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"980b6a094428263d2b28a37db5859a6221d8a9a698dd66723d7347b1a2ceab2d"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-bots.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6e385494d01eeceb7fcddc9d72b9c1df7aba478b29f52e6093389c48f836e4"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060got(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-risk.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f45e6a6751401d00ee84025c79ca03204b4b0cee0c45bb5d0a9a2bd47ce5db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060install\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"604ac88c22352e6c9bc151bf5d71154f50a692247e3887e399776cf9c6676272"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060install\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3c16833142c407cb4472e8e82a39b85da70bbd791f20f7dca2e627f0f2fe95"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060install\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"03698882e2c10e135b096a6b4564ce2193b450fd57d944671771214b51f2c130"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060install\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4fdbdbf56eb442543fbc45eccb05e1f38bc6e70d25cd87a95cca99c571d30"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060install\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-design-detect.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a490071e2dda8a3459459851d7c9bbfac6c0d0de440870a553c4147ba130c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060probeMode\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"978a15378c7d0b53fe3bbd2020b2d677875c25c4fa99f867dabe6d9e5067734d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ingestPassScoped\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6076752547657589c7046882c4dd3ec6441526783ee0a3215fa64e47c063b75"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060importBatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa214788ee51b3c1171fdd0698690d3d7169e71cc001503a7428b5983e11fc53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060importBatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bin/gstack-memory-ingest.ts"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d31c175899bc0c841c5b4df0aff481c9167958df22b5e027ecea3f4b939953"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce086532491e0df7318ac65d5e6dffcf4b0e8dd8ffeade8b15eaa26664f17c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060launchHeaded\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee141c0c9d6c52344c59a363ace7f0664168ed005a88f4e836873758b737129"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.spawnSync\u0060 in \u0060launchHeaded\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6d5c4e8895b7fb44a296afab07c239c4be2e221aeb044f5b8ca2bf3c995e1e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060promoteToHeaded\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cec96245f79e05241e55b612f8c710759de099e0741123981afc99e7e149b89"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1ee00e2b35e8c219d38610b19337d2c4e838291c4aef8194c2ce9fc7c8426d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060runToFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a8771bccdba81a84d40b3785e6f58994d5a33c99b3e831dfb325a44020c1db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runToFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c0708480cff15389c7762ea3203ead222251491e7a5ff3d6e842d1cf4eb59a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060spawnSkill\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"44eff8990c1e0c8e603cd866dd64bb6947b750e58f303b565b98c40a2ab0305f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.spawnSync\u0060 in \u0060killServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4b6f0f6e3b60828c81661881622835f96239c0b4790ed85e8972ac2ff5c2bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.spawnSync\u0060 in \u0060startServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"8404516c12a3fa8a62946a7fad1e7c7afbfaeac4f084692e3b3074da8b3fe5d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060startServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f011ffc9491468568d50505d78df195f55e64026fc89e9a5b3221e6e17312d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060handlePairAgent\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a03e9f08bc93ab43f23f9e78f0dec6337ce23dd96218d74c32b908d40ed6290"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to readChainFlow\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b58e2d6ad539236983f7340df8e65caf9df3f4674b54b9db7a28013d0d9d1a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060getWindowsAesKey\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"2540e5f6709ca45efdd7a89d2160107ef9aaa10348885c429227a62298ab5ea2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to executables.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":"browse/src/cookie-import-native.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"77622a3804f05d8584d8f3f3c084d255f39e4f7da8889167e8dcd389034f0674"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060importNativeCookies\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a8c6332936faed92fbf75e11477a340f915efbbc7500a9d42912044c8cd368"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060importNativeCookies\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505d321cdf37994f39941bcae352b1529bed6802b2d9a55eafc8748e59da240"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060importNativeCookies\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3d64d1dba5aa41d6f07063043051d73394bcf9bdfe64978204c731e0a49b5d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060screenshotTab\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/device-emulation.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c690bcbea810d08de81962a6f0b8b3c8dfdbefe510c203e49756afb81aa5bfc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060handleEdit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skill-commands.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1e5cd1fd28847a2bc4052e22d7d5e0d2ff9c4afdd93353b1acac38483641d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fsSync.writeSync\u0060 in \u0060writeAndSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcabbfcb6e3be2c86037a8081726545cf56f88aaf031161a30eb41ea9a752d99"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fsSync.fsyncSync\u0060 in \u0060writeAndSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c15e893be096010eb9e07481987e9b5f4c9a1f499bdf03dcff810098534517b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fsSync.closeSync\u0060 in \u0060writeAndSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb71a72d1ed8c8e0335546a33e024681a3b8560a69f86e67be6d2a63f7c76d7a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fsSync.closeSync\u0060 in \u0060writeAndSync\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aa2291eec6ebc2214f498dcf85eb5eb5db0daa3d1be12fc92b52200e79b354"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab7bff92688c8b5c178c7b0c1417fb8d5007d03418619940f036e057f52aec4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd609ce3d2ef380f3a21be04feb0fd24c85061c2722d26e09bb87e09e8b90c05"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275977e1be7c70e526c185d0b4346b56ac19ac629ceee8a89c30a1eaa61489d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3df0d7811d85808a77587fc436d88b98a085576b96ad25fe18b94a227a641c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f91ce4c200a602604621bc9e4c8f360059baec956f4e998c0719b16dfcd3abe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"3995634453d224bb477778e308f6d7384e795b300b45b2f3224b03677408d242"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"50efa5366b8a4d251ebc5ceadfd721043d255ffd00e80fb76a46b82bd0c0e5d0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleMetaCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fafde2672c6fe7f820ceea2a10a2dfd1ca2da991fd7780521ab5f13cbe6200"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleReadCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e5aef80ca392f33cca99beb0e26bb6ba8425b6ca930d74661bd7da3238b4df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleReadCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc904708f2e5315eaa24f1fef7ad373c501e80fc1e33350a02cfbc52f3b0551"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060guardScreenshotPath\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/screenshot-size-guard.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c0fd33548d751e5d995effee7ee17ab1de65ff8d67373741a368e7f77cf3e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060guardScreenshotPath\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/screenshot-size-guard.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"546322608834c253a3ade847ac8051dcdb8bcd6a5a18e15bac83be32ee0c600e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060downloadFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"558e9b8c179d99f980e09e09240d2ffdcca6a8fc22359faa3e5e301dc0bd8149"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060downloadFile\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2cf119eed71672988c7854e31435fb1b2e3c297fc1a1385d9d8331285ad7a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060ensureTestsavantStaged\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a237c030a5f409a598510fc956c3701b8d6a9b72fcd762f0ab3fcb58f0ed18c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060ensureTestsavantStaged\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf64f68d1785a9133f16b443a62a1336df1f979e0862e2d3f4006b3bfce47ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060openTunnel\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d233eea7dbde4a5ce426560345ab90dbb3f2494a67c428b27526a0ac05c314a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060openTunnel\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a238754b19548521ee3094c8c0c83fb3ea078feb82f9bfd36d49bd8658240c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060openTunnel\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d6fe83d192c80b0eccfc8ce22a3b43492f4461f5f26c5a8a022fc5043a27f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\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":"browse/src/server.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36743b22ad80cef7ef799f71383e6ebbcfbf62f3bfd034b4e5c2b8460b2065d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060shutdown\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"db325605e0f76877d5619b16ffcd4ba3349dd86017da3763f198751171193792"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060shutdown\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf81c264efd66fe54f080bfddf112e2e825650d4f1b61a51144d4ae5a24441b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060shutdown\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8124e69d262d43abd8718ed162aa6ccaf8be8954f773cbc052cc951ac0e94c9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"f820de355e92d937e66f34bcd03b022a81aec0d05dd1341bc1ee2eb24baa1bad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac67f6d974a4097ec0d503077287bdad24f19c872d84ed96c1c55c7c9c552a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to setInterval\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40f1c699795f48d1210a3b451228e69428fb97a6d3e92fde1df2fc615e6bf35"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"362e96828fa07af0f6675e9cd271cbb4090b706f5c873dc815068c3ec8d91209"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42e0bb5f3eb7ee06d170c6c942c3d3e6a7744b10c3b8c075ab0e1f6256af6f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4617414996bfa52a6bfeefc29f843df26a02b971483b7e86b41114c19bb126"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3050ec3f20d797373054ba389b8c32f7eb6dddeb40ee3c020a9693a890eba03b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8befe1c87f6daeeb5340bd1feaab541913628773370228aed97fb8eb4dd899"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ced071db6cabba5335ef9ab53aaf63cadd78feb5989fa5b679e58365c39690"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaf20a4128015c63b0aa5e80caa253386d44e8c58a950699006a1960f10d6fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060persistSessionState\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/session-persist.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f0b4f3eb8520245719962f9e0ca450ab3be0a4fa1bc7f88c3f2cdbb89ec9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060restoreSessionState\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/session-persist.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"53deb02b910d96b3c0bacdbd3f2bd9636b298150b2a121784996ccea4f1f2111"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.realpathSync\u0060 in \u0060callback to map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b9563040c9a25fa3f1560350070c8c41f2ad977f5c6dedc9b018c3110f7a4a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.realpathSync\u0060 in \u0060handleSnapshot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5ef4d392b000d6c117855200916672450019e7f96867b29dab86cde0fe7606"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.realpathSync\u0060 in \u0060handleSnapshot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b7688f5df66c62f0e1d1c4dab36be26ead8524147e1d47bdfe62cc73c17c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.realpathSync\u0060 in \u0060callback to map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f37b8d7902fa4dc8785d78c5f86c7ba5cf0124ec65db85c9ca16c83d5b91a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.realpathSync\u0060 in \u0060handleSnapshot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9635148e888bd8e27b3094786683396a20541f30cc9fbf384dbaba6b4e2cff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.realpathSync\u0060 in \u0060handleSnapshot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5c1e464b8109c1b0d5ba57b3a95be34c76ddcfa5dfc7fd4c7942da51934b75"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"30acbb6cc4f2a8ea8fc5bbc4f61789ec48cb2138d9d1df6d6911f716b9774ac6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aabbc5f85680315b5913c528db83e702b79655d22bde22c1f464c893c15f80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec3bff6177e86ddcffbc3a67da41b86f8dbb7d62a9a00659bf0d51b5e1d61a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to filePaths.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b705646a69d950c84a1df88c9a9aa157472b1b043b60ccdd1283673307527d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060callback to filePaths.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ce77adbcfb534dd10bc56fda1d49ef7dff1177601ae440f67bc30806de8e47"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to validatedPaths.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0cf21c2fa8aa87450adca597cd566ee309fc9dfe7b978d97acfa9af618b36d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da0d7469b45008ffcb1ee6af3ab66040ff1407ca79974d3660632f057eebe3d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f41d3fdb37d41d6da18596bd53e5970bffa9748531eb50ed43b60789095d89"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b6bf05df45c6a5f2f2a2c5bd018c6b2eab625169790e4f23f63d878206a792"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0683780f588c714bc6fca1ed8c904b9ed700037ee0f126a66404c614d9133"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2cb2515496f8efb852e47a1f356030869661d5e094a7099edfbb5485aa9356"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eabccfcd4cf0b61379bfdcf77be92ae8a059165464d80a75c2d93bc2bd8cab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b7c4e7fb80ccf2b99a89c07ea50b9370e6eb9b53dc0d0b7ed56e4a00aa6bf3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"706efc45e3593411abe59e0f75647eb6fa75aeeacfe880f18cddc8b1ac79abbc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2083fdcb438fd78db05f3ddc7734430b1c0d00567c28016fce177c7764da7f9a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handleWriteCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"031279809ab89f56ce4d5ca7a7400031b0e29446bfc43e169232ef5ef8d1da79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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":"browse/src/xprotect-heal.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"26de2f69aed215951910c8cedb2567875b5034302b1eb547b483d0e5d65ee93f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060spawnXvfb\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"17407b56790700edc28c876c6561945d88c24b7bf3398e3dd58502550f58af3f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060spawnXvfb\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8653b69fbafdb5e1e18c3246850adb0d02482e82543c8ce9947d9b62921292bb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060spawnXvfb\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"645cbf264afa2f1750f57aa1b93faaa0fe33a11a96cc9f4ec19a38128d3d0e8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060spawnXvfb\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7edf2e200353c43144b70fe0a4da6b436164b0971d05bb912a488deaffa1bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060spawnXvfb\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f50feaf805a76ab7d651e647dc4fafd33214480b426b177ce62a7b28b9c427"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060awaitXvfbReady\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"504f19522aa322dc68a8d1bae4d13717f4fa393bf9ac5e4a2a4be76dd5a27bdc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060awaitXvfbReady\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d3ece69c7767e9fa69b0e2d6f2ef6a8aeba88dc4da38b2eae1e3c6f57bc219"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.spawnSync\u0060 in \u0060awaitXvfbReady\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38baf9d25fc2f81c337622958be409ab85786f5b84f04681e865e41b7e3582c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060awaitXvfbReady\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e64b0024e8df2928a4accfe115952bcc9e175c31fdfdf7b8be75f1bd972a35"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispatchCi\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-dispatch-ci.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a518faa3542cdc12e60ec547ae2b7996e9632feb0d7aaac22f2acca55170fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f680a573977789adba24fb4a34888bf290964f2ca3d97b7d1f0732218656a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23d346cfdd7a90de6326b7355afe12b625a92ee7e98b2400414530a594701d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed034a8bd5b61c60c73ea6442d471cf94c4408f64b095e1a727b395d0eb5648c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc105bbe0fecc49ac3174fa793c1e0520de16dce6207ffcb2b759642deb5c11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb17602b5c73040b94263981a1a9767316d89104359962ad214953d779016a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060landUpdate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a06861066b7a72cdbc6d09494ec5ace4e96cbf62d27bdf027a9a97d049ed9f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060landSlot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea2e3bf373ef732d5c4fa164e3399748ba5583d6e54fd2e0df646edd1b22ac3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d412942260526ca038e441da0624952eaebea017b2f4cfca1bdcb8696cb8e990"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5facd61990b062be1e0ccb549d9214dd960700a0cb85763172cd0b236208cf30"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"215e8907b4c7b5e3be5f8a08f6cb8ba9cfcd3544ffd0470a1756e413a028b038"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43f7f7834f5e83e59c968b5d32764b5c737320ddfee209659eacbc9b20a1fa6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3eb11526c4550172c653acf01d6d25a1ae2d366df5e2734983c299402f3e86"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060log\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6730294e038517af8aa07e86e1ef28d11e8941c9f6b7ded8ce75ba7b4f764445"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0efff39e3643db13cde79831ad1d0175eeca15effc99cdaf44c115d83e5342a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060stop\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ee6d043237004ef16abd460c8a8cd3c497659bd467b4e2e0542ada0c2f20f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060stopCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"373bbc74f2ba4793dc188064c184c32e0e076b94b13b88802897d4471f7713ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060stopCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c9e671db2d8597980721ac04592718d62d0b9b6e2aa1a94a0550953a47d830"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060running\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e252351a977ba5f83448d8958d3cf8b8a63829025739d3e801918e541523187"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060stopCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa18c6b2fc5ad638fca27ef8224e8025e2d5a1db922b8527726735f21a6663a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060checkMockup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/check.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9226c636b1370585b83ee6a5a1490121006d88b5da072dbceb2aeac63bd419bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060runSetup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3284354bc056b422464bc620aa10d54457152ca098c1c6412d9fbb951ad7b1af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060spawnDaemon\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8dfa13c05573031f40e42736b9c1f43f8e3973d0a459bb11ce6e75e24f4f8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060spawnDaemon\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dccd355ef650bf07f8c9e852215f93a1f41344acec07429257205d96b4e4a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060spawnDaemon\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bd9652df575159346d08d0b96880a4eb5984664a452214e14ae5a74bfb0780"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060spawnDaemon\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0af0baaec03186044a7ae58e07f486508891586722f96799abfd70d839ce7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060spawnDaemon\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d60138494bbe8c355f322a9e5550cf96739ad6755b9dbe8f5b7b11902d338"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handlePublish\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"612e7dbdadc51123ced4ecc4da4f4b421df5a5dfcf548a095b5541142102fb1e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060handlePublish\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"628540489ea30a1e9b387d8fa0f5dd13e12ecbc430e9f81d4caf25612c644b02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060handlePublish\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"03733b75c591a333ee5f4d0bd9e83ef76e4dc1d77ae2191f25a4431873353d4e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060handlePublish\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a4e8f42c91afd7207aec20304248ca4764ce1df8c902b882f0c4e9d6b5bc36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handlePublish\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd51bf5f2ad62ada1df54dbc3dcb5c54e13f30a40eb4d7a5a8315a45f2f047b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handleBoardFeedback\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a35c230afa6f65aae3004015212a1ae9107231189d31fdf0a9c9a3685b4810a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleBoardReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b4242818ef7fc5a3eb2fae36d059f7082c5983044778d54f179242344f0138"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060handleBoardReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a469959ae4e3717f1c0690b5e6ee1d612cb1118058bfdc92e3eed6e2f16589cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060handleBoardReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8376a965b715741e6209682305971c77adaae1b314d1c363991b0f3d7cb7515"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleBoardReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d34dddc608cbba0c2af7e931fb99f9232b84b5cca78f6d64114dc3e31ac4e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060generateDesignToCodePrompt\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/design-to-code.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"606b631f5c71603b91681edd0ab065b3245870574af28973f0957fd0e3826d84"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060diffMockups\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/diff.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8a8738e163246bd8612108ae21d096e0e84ac09538c26b89b11467f2b3d486"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060diffMockups\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/diff.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1035bfbe4c47f3f2bca01886a15cd6d8cbcd860459ec96300daeb313d5554"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060evolve\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/evolve.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675499ff5a990ed2c689a604cfaa98134ee9c1b6ba8bce7604a96242c0577c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060resolveImagePaths\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/image-args.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eb58b0a7cc2d457340450d54d36453ff828d3bb5b331d58d7ff36ba7fb2753"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060iterateOnGemini\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/iterate.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2194f26872040ec0d92a4f0bee3491f8c132491df3a67fd16a801f173c23313d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060iterateOnGemini\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/iterate.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"325282bb807ecb6a55d2f77ba572dca01a8119a59dc52216b045b773ff677f8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractDesignLanguage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/memory.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f6337db5d31b2f2eda55101b5c992911bd7811d380936f6d13aa8d70d061b5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060serve\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11b5caafb00546d4a838a9e228364506095f37b53821efda1134b67b0d4c703"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060serve\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee206ac079f3572e4e21d8e462dee1abe515629f76ad0607c301b74d6d496a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serve\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef702f42b1c7e8efa398ce987721d5cb4a9deade2135b9dea0d71be49cbb4d96"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060handleFeedback\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4180b01bf849cf343cbd7eac063d86e691281d52347c2e03c3617a1813621328"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060handleReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d854e75cabeb39c9424ea0891a7283b979ee2cb6418316bd723e7c8dcbec1a57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060handleReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"822548220438588b27a3bcb1141f82808f1195c375084a8eef2e3d92a8963611"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060handleReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acd8f97d75e023dede8ba0790217e6c7493efd8681163652829dadae05e7fb0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060handleReload\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd22f79f66cdd914f27246612b4a0e92576d088075a3069acd2f0ea1e9394bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to results.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"665d657d401a12c2085806fd01aa5e6602e8af45d629d8786db88d4655688e3b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060attempt\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da68b4ace6987ec7589820243f2f7fdc109300d06fc7dcd086fc0770e0db183"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060tryClaim\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292d8c24620b29aa2e93847436ac786eeb9f24374a12b22510b7972b974faa0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060tryClaim\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1322aac11ba9befb6113537f53446b2223869445ab1f2f84b5e4661a3244ce88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeSync\u0060 in \u0060tryClaim\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"66be6e8f351254fbbfd1211925f223f37c8f18fb4fd9b89291b577ca7c626233"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060tryClaim\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c0ac6c03b74bcdd77b9bcc2e4b2dd386ba973ddd93cf0de9fdd80ed961b573"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060unlinkSync\u0060 in \u0060process.on(\u0022exit\u0022)\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9fad9c0d26f3afb39ba961643c940905355fdc502bf1d6f92f53498e6b8f7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060asideRender\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"daffd369112fa012586d229b8a387c24c88ddbfba4d2a05504ef8650e5ff1e80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060asideRender\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d311de2bfdbe8a365387d01c80e3a822601151b5b03e60368a2c053df29ca5c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060asideRender\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"449277e6665f402ae4d69a8e8de1045131ea1449087b85e3f43afa65e5d45bdf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060copyOut\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"727f014b076ddbe0f9f3ce3d25d8b2c2d2f8fd9e83f92b866d56391c1958d4a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060copyOut\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f72f4938525f1b7035d30f14b1acf2a90a419c1bc1bb0081d46e1f671fbd486"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060copyOut\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1515090e3eb38e71b7842b30421cca353f828d81dafb36bc2d8139319321623"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060renderWithBrowse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c561739e087420f92f554e2d91258b443e8135f58e7a623f78c6aba490f3fa96"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060renderWithBrowse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"57657654f284fdcbc815962b76d802a739be5f24bc21ddb20efc94a1d54af5c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060renderWithBrowse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6919121fcad9c93135814b2a31a5ec3c8fc9600937a6de5408a9cb33a2a26e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runShadow\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7c36f6f2902d6c3542894c535f537c1100513b994d7461618711ed5771e610"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runShadow\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a5777636d1683748f450bb5e928961b4ee147933d492b6fa7217381c038e5f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060shadowBeforeAnswer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e6a2e6d61aebcbdaf925be723631a2a291d97f57e4b249a872bceed517a962"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e289aeb52e5c4e1479090dbcaa99d7d626a8f52c35b04357132a4ca893e46e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runChecks\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b4a08a76b411a0e6d1b4e172f1542277bea5d9de67e5792a2dcb63f94df04c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runChecks\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"368595ef7da1133f7c9ae6f1197e8cd5ac4a39425927577345ee662469f51ac2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060runChecks\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ae65dfd7c08c743a2d09ae09d7fe33496c4fdc530a16cf5549deaf436f974d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060status\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a94ac20a285dc362a0c5f6830e8f6e3cd7180b5772a93bbd56e4ccc0650373e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060status\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b076fbac2b9257106ace7787f867cc62d8e79eb62e0bf996c2555d6ef21da9d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060status\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4237519d1c2fc61cc3961da6eb873de7ab73543135a58cd763081139575be8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060export\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c5a09721d5cbc23b2544e9f4283ea001bcabea6da510703478a788150b8630"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060export\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cbaa2d6a586dde53f65fe9f84ac96a690f60b9223506e02c11b5d540c4d3e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060registerSource\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/sourcebot-adapter.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf106fe51ef13275cf4dcaab3c719d676320eda92014f3e9b0eeab95ebfbcce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060registerSource\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/sourcebot-adapter.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d3206a4107bf13eb449d0b3972ba6feb040940e90626245a62be71c1aafd16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060registerSource\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/sourcebot-adapter.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3292e71f6bf9ec6a9776e165aa24ef35da92001f10492b2d08a61aad012975a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060registerSource\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/sourcebot-adapter.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"db94a46d101687f11e03050466480fda2ae549effdb27e48b3495030adfc1802"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060measuredKey\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ec931e57b58aa0a469b5163584d01ae260f2361f816fd0c4d31e09f76cb791"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060announce\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"112433000b172d727a2846e11d94c46ebc63a5c0f06ccc0e9a37c209a9c54a57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060contextBillMain\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"be699e14eb66e9852c80c6dc2f97e35a8dfaa55db9f152fe82500b4020e3e5ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"551407a3e2cd7a09cb8544a12f8e8b41162940b7cfa22e011bc3f135e2f099c4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\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":"lib/cso/cli.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"2300ebd80b5232040254d9c12fee066caba480a31c5057dee399366cdc8e757e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\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":"lib/cso/cli.ts"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e1a74c98f488ef74911d6fc89183aa492229807f40c681ae4053e53166015"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\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":"lib/cso/cli.ts"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e788a733b3e186ef6fa95bb7c034a1932d623e0277794999164150d9a23c282"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\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":"lib/cso/cli.ts"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ced0ed5b5aac6501f8d42d6db170b94ce30978cd93d37ec3d324aef3c6f1b0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"03177834ea958fb9215044e754ef08fbe0221e008b026e7e370ce42b5b6f59c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060inspect\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c882c7e724f8db1c5f54a1e5e5fedac86cef120c3ea63e65d829b66776b39865"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060history\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bfd4772ae8b7ba2acf0b6b67163c7a3202926d65d7f528d5ec1348e8e06d30"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060history\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6eb9515d7b0f5e760ed5b55866654ac85fb504894ef1b7530b12d9088a37a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060recheck\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"953a3a478fc068e0bf94bdd6b935344b7e359a2f85a2a0fe5459f14ed19fc2fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060recheck\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4b8b1fb1687009ff46113a43b1db33c5b062f65659849cbde698bd4a0721fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060observe\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee343b2787dbdf1d1fa4c7b6ffa87e7374e324c611731419291a23f536d260"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to withLock\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1f60b4cdc2efc915b232165ffb140c19f6dbf35e13f2d35d76ba9a469b3ac5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to withLock\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b4716533cecaed30a2368036ff057346a0a78cb64f08c747c7747fc920478b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to withReplayBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec39e95c6459a4e583c710a5e28b7e0a1ecd796328da5c4cfe92da47c6e5862c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060dockerEndpoint\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ccbbfe21cf47f98cff92f030981c26788c3f697763aaf5e81962bc989a714f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060launchWatchdog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f60a53c250b17f126eb753019699a3c99efe46bf03a77161d02cb197b45d999"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060launchWatchdog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"791643f2c1ccc9f7c94c4a476ba789ff8a32123e48767fa85d27800320202afd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060launchWatchdog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a84244c30ad397381e8397d3b8f933ea6ff85647a9c1aa30e14495497bb7e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060launchWatchdog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d0c8e73608873459026f8ddfad16519c13604e5873d50e4d10a64916d86b06"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060launchWatchdog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6380bca52e4aee1fec0e560a8e79441f18c0fbe89b5d0ef2b363c9ca7ec782fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060launchWatchdog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dfe95a4ae67d71a912ba6c48698beb37e94cd6bf51e4ab836fcde197856b21"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da95ba6abe8b6c573dce40c4f6775dec1f5a26ae444ee75312a180791edfa45"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7c3e3eed32ff9def3428a6d7cf6dfe2008bd2865aed2b461d9ff881a4daee5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b51e9169512046f3a262835a774fdfaa7bb2fc61d9fb17bb5ecfdb0a0a46c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17472bca2d5718b1ae2e586f910bac5f6eed21e94f3e0e901de4ebf086bb3cd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef694b1420283330d5a25dcc8027096aa1005ef1ec5e20209fdec9795539399"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d2c4816e4d3c79b283ea1f18abe13482dab7fda646993573670e96fee0c334"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b0c9ca0a08353828d4b1976a2779f8e1284a2c91c83b0f1979e6a07b88f10"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060directoryMount\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ade9dbf44d865b7c0182cade57127dc535e1ff69e630a3e0967591dffb1bb4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060directoryMount\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"669342291927c8359e3844842ac01421db5800a9c6157879fdc33448c47011b0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eec71aff1e47fced83fc0237e1953d9a7cefad6102421c32a638d674e809ea3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060createContainer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4bbf83ab342c638728c0e5611ad3810371d91ed0fedeb5ca7d8fe2a25a74c4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060copyPreparedExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26bf9a5f05cc2c856ed49ef247b7beaa2f162f313cd937c9a404379816a73c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060copyPreparedExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e97044af21491a6c6c0578b06caf78ae769cacb273e6ec293d3e628e9610f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060copyPreparedExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"89be7c8ca0628d290fc2054986c17df22213bf71791f4b0bee335af9cbf6e8a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060copyAcquisitionExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f01d8eb7c38c94b316d94ab71d7eb38678d936591a04d9a6f7e7b14e9af4281"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060copyAcquisitionExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93bd655bea699950e3ecad49289566866b09c8ba7734b6b3d4fcf92bf86e021"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060copyAcquisitionExport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc65eb2e2d0d761733d3fbe20026924e6eef99f303a983454abee8bf03bc55fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060cleanup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd342f0ec00b6955ec810e0051fea166ac8b6828acb0fbbe6232b2b212d3dc3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060cleanup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33a75aa9544ac89b40a6d1da5caf84fe86d1f61436aa9c7017afa21c6e95d6d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060cleanup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f40e73fe6875c6073f9695be1c7aae2be521c83f2328b19e1ceb86b51c491e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060openLocalCatalogImageSession\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8974f957cfb80c814e3b91705cc79f2ce30409e8278609dc3028eca71e8e00c9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060openLocalCatalogImageSession\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3e3c18b9aa5c7fd1cc87d54f4c5891955b7e187036f9365bd15f0eeb6069b9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060openLocalCatalogImageSession\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab740a6a0a2fe0d3925ac410bfed4b819369368df5e4068fa03ca81a9f06a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060close\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c01673c2a57346a1fd99de61031e97b0eafd61b323c37c6e8085a64d8e6ec4a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060openLocalCatalogImageSession\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbda5a1a436ebac581718dbaa6dce2debe5e8bf622dce7b9481d932ee04edfb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060download\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f4d4ef636a6113dafbbd5b223a16181f2b884d89d984551491f8a69f27c324"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeSync\u0060 in \u0060download\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10bc6c8971a608cabbf88c1a9c2ebbc982cff80e09df31c65ca606153d99dcc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fsyncSync\u0060 in \u0060download\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1da7777fdbc97ed07de5140fb083b4a2c48f6e17d80b283d06cff4a5db07ceb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060download\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32120fcc8f88aba98785970f227af7cf4d1c069ec404447a43e13a553e71dd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060manifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaae3553d457950f903ef00e45a5a0f1ebc04c37d06415a50c6fd01a9a3bec2b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060manifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"2830e151dbf5709d6d2a3de20671109e9025c76a265d3f9ae34937afe137ca92"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060manifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"250233dbbd00f15991538eb64811b9207317f752d6c75ffa958ffc3a53097432"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060manifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6425b3c42432bd7e0dfc886d1fd76e7f13bc98654097768a520cb80c66848dff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060manifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d88d145026cac05274a81247d77c3b81d7b416549b793ec6664a00965597d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060manifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0ec42b6ccf6b67e132ee496575ae67eb7da456d58c1c2c31f09f656bb47da4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060forwarder\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"83717a07ec149022f9b17d95ee6ba920b4ee1462bae82743c65332ac1fdfaf16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060copyMetadata\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf1974684b7103577d43795a3053be6754494c5e3b875e024d2e3f5fee8ec72"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060copyMetadata\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"38746f6c3d0cdc8506e8d1ca50a942af75bb5b659fcfc6b24c8621d6bcc1c678"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060copyMetadata\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d1b962734d2e9884749f855d312e84156023e20f4baf6519357cf063f7e3df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060copyMetadata\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9be2561e85017361d67a2b4f80964907a4525262a0cddc2fb29a074234d2063"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060copyMetadata\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba70eee0ef059e2e9e8ad906f04bca42e6a50eae41e16c1d66fc6a286d56b2f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d77063c4530e56ee719a08116ecbbe9d9577151d77ff68afccc35996aa1af5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fchmodSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"18791f87809850462d32abb0c169f70f199d60b92da92f43ccedd610131b7f3c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fsyncSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8124481dde1e178b25a1e69fe386e48275c5ed39a421d5bfd9917b283708e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab22db308380dbb42af08967422d6d107839dfe3d94f9eeb68c38b6d3939421d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"188155971a471aab40a4f101482e6963441d5724e28be7a1d866a7ee296027ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fchmodSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"1749cae04c1204475e6915b4f4a27775e03b8fa45da98eb558dcb6681b9fd95d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060consume\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"71da0aae7b4698ddc165225c3e1709d230d27178d17830fe37fa6061c876c3a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractNpmArchive\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ed8ce087173b67ad9523f232141d25ca25133fb65d6bdd3b84b8992fdd9ee3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060seedBunCache\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf548123cb266b2fce92e11c6dcc7510c8ff1f7cb3ea4c69904193f46961073"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060seedBunCache\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ce015f4fdfede6a3b8cb98dfb5fe02e78706e8c370fe66d6909e78188413b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060callback to http.createServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d13df9191b7783fc54eb2b929c159ff746861d58bfbd47da610a0893034c908"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060seedBunCache\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1179e56ebb0d46062782f80c332cc9a9f0664a9efbb40efbf16cc511a5e651b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060seedBunCache\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a417e6ab5622cd802147eebd1a926a7a5e30cdba1e5346d34f6151910c06d0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060seed\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aed6a71379d9146a9def65045546a1e6b0e2a753fa7ec4a188dec75ffb5b4b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060seed\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"7065fb63f44ddc28c1fd247e8fd791d3f75c29c5843e08f6a6908f227dc0098c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3461dbfa7fe8b57b75a1310df8f620dcd2740cea27a3c56805b7b2ff41d9979d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d11ed7c9c1ad9f3afc66cffaaab4ad66c6dba200bd7a1a341f2491c05424981"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060start\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d692300331849c7e6e68727e6088ed812b3e5601d546bca356941173f7d8e2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060close\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5aaf76563732c146f7cc781429759d9a309af44a48255485f90880cd1a7a9a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060close\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3364eaadd1362d3a18e01dff832dae09e5892ceb761f59efb92a2fd8c68e220c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84c5b817f9a0cbf6e9d0f88c01b7c794f5d426b7804774f090ccc6c27d75c8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc60bbc0e742830b61aa678cc0c495c676ae3ba693cff487739a6da9af2a84a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"322cf6939d95a633e3dd7df5c543af568d3487b59bbc0082d1ece0983885b15c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fea4e2f4d91b7f41ea9a3a47755d15f154f1919ad0d6f70b9340bad41aca31a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"991aeb7584e31583fc355945670d21421ebee2b088b4da02ea59bfb6d6bd0d4f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"911e9a8d8aba275c1cb5b66d01e19e4b52558621d0d930970f6e39f682603417"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060supervisePreparedCall\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"da40866be4d1c8ec90466e101decef30e5630e6164b5cc277324ca1c074972fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"a221c1f8efd294196a4bce0ea684a950fab8a0f99a81a33fcce9071ad4cbbc23"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"09af9deadfea2b278574c8b3c418442affee99a5adcdffc8a2d4e3e4702690a9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"626e95f6151202a75bca6f4b2ffb99cf07a667bf60ca41c28fed38dbb8cbdb82"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a7c8a3aced57d7c6c6e164485fec59f920643659325b7af20cf81eeb12ae18"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a83b2cf75fb8fe01872864542963bced4214af93b495b4e67a8cb48d55e745"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"59194bb2b023a939f3160eb0560176064669101c5f3bda2edfebceae39bda5df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"b533d27977875698df19f62c5a97a41a0b368755024ba1894219f36ee67b2d7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"569d24ed81b7e4c4608ea5627628f42c8814e665ffd395d62695f3ec5f1565a9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6811358ae2c1f7bb49842759180cdcb4a4cf1cb5864685cd6b591a814f4633"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91d50cad3073583101442346ac9df146c77c624736bb85088c77f8c54df2a0c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f264d7a04f946a07895e1fa6161210fea39074f02d522ee4eb2237432055b38b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"928cb837b7f4d1e70f58de7787b4695c2f81bda78ce413061feec23bfc94c230"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"2668799ff1c595d8dd723cefa92cf09d208111addd140bf8e56a7071e0cdd69c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060superviseRegistrySocket\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c35e1ee63368427942b47e1f346a9114acd2e3ee5be52fbeee123830ec0a6d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61e2d8380129fd15d85a65093cb36ea8269ceb1c1e1c0980b75f57270c679f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84afe6e4b85b49b368ce95eefebd3853dbcaf5e418f9b2668bc7c4428ef4a60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"854efb4c560bd588b5d17249532adc487cc9c5412aab3de0def050dcff157071"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060dispose\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad37325fd357bedd4a317702481373ddaa7e8a138a8a603266f83a87735cc41"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb342e7f552d23eaaaf9737f95a78e140a08b9d4c0f7a684ae70c12436c2a5f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0056b855f2b9f98c9a8f6e303b2d1a72670d3420522379b9430e4ea6d5bd11db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060prepareOffline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f709cc2e7a215cc99217ae2e726f9c380b550dc6de8c6b9031c71be9960f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.cpSync\u0060 in \u0060prepareOffline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26143327960c6b2d1cf9f87d0ee7af3f9e10ac1a66217d9174775923cf23e44"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060prepareOffline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af41bef27acc79e17cd9738c9de3326708e4c5906551a3fa9bad25b5ed98bd3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060prepareOffline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f6e90c80ded52decf466a19f80344c6b111a40a7a2d47e7de913c630cb4bf7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060prepareOffline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"143182e227c4c8283ec2f90dd9309cd4fbb36b1f80b70f433e8d92560786e739"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"461f1e95cf74e74e99e4057be357081f71b7e6f72d4569df9e7a5b63b4ad145e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fead8ebcb8c379affb963c8eb6b2fddbebc06ae1677785ac76b0be29648134"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7de76fdbb4c7d34f630af33f247f192b2a72b82c7a5995efd5d8af1da733e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"699c19df87e52f22eac4e446d02d735a6797ab404427427ecd7fbb842bea478e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"23deda1a6b4c266ba9bf68ed332edd985d645ae6ff37fa25ec11f87f895dc3bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9922c57cabaa46203b77972505e44397e0f20f07ae60ed2a075bda480e17363"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"204cefe4659656168b3f20c9d596c5d6a00d47b798663e77d551dc322aa1129e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060acquire\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"49796a1fc786555eb2bb61612906e057a88d98720276a8436029a3c7015f2cdc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060prepareOffline\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"185b663910c6bfe804d673aead88b2e58ab5c201e0035d4fa8ad29aaf4736356"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runProcess\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7f14c82f76670435e0198474283b7d9d22720d2edcfc10563e3eb81cc9623c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060cleanup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5f28339bbd79c0e7cde305437f02f9690d7fc101e6468f9fe27fa0caf07ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060prepareDockerScannerApplication\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f82feeb06389689963cca400520074932f8bb4f6e2167cc1908e5323b5103d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writePolicy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3212bd30f9bb3702b78100ba88e24129e941f7ccdb1e58a2ab6cdbc63c4d36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060scan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead8a64ca8d9f0501684e3f3799b61b677fb89a06e4e68eb53a14297cee4cec6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060scan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"a893ae30d1eb24a310249307b469fefa735f3f2b8db6cc8c67d5407d39a5bc02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060cleanup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d6e204b21ce34e5fbb77ac4152828697dcdf997e06d591e1c6f234d853ec3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060createDockerScannerRunner\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2b171058c3746686b34f20b57162847a3291920dede4192cd3482f7da23a20"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.opendirSync\u0060 in \u0060walk\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"273f9e55f05a095354490b6d0d5b23188da54ec3a696581c77f5449ea841db51"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060directory.readSync\u0060 in \u0060walk\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d4e41a3857a9de092009bd14c7391a88b567436d2a60de818403e0289b250b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060walk\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"592218c8d01b4f02db7bee30cc75a8d52ed5e5cdade7103e675a60f6fdaee447"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060directory.closeSync\u0060 in \u0060walk\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edb789b43edba30b5d745e07eadeb003fa3a781dfcfc38b8e1dc5405058d1a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"7663ac5cb74a275e8bebe5c74b81719ab412aef4a1716152890dae3e59f50b73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a00cf772684bab61ae0613f301093332d26260233790bc41ee533d2b398305d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060sourceCapError\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19c340b69ce0d8335a9f0bd5853af16212627006682df16d9dbc6aa3ad7a498"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea9cb192c310321221a63e4d99bcccf03f5db0257d0b38e2e2183886a34c2af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b41fd3de1d18c3cbcf705fc54476ade33f6662235fa56ee24cb35355ba4247"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"21437d81cbb2520345c81b716c89e9ef910b7d45c9a7b69a515eb6108e0ea487"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"7329d10221349e246e4f86d29017bc4a874cca3dbdb4fdc74be56cf2100865a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71bc6590afc74bb5b03b95d041e82c83d58033bb4196e064f6df6e12599ba79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060assertAbsent\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adae54928a45169cdf8ed7509d8c52185d49153a9f656ba3e336fa4684c46fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060assertEntriesStable\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea86b54c37bf3892e27e2dfb107c923f19cfc6c64f7a8825afefbf8157db9809"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060assertEntriesStable\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e7851807297181efef1622ce56e8ab9ff98be26044e64322fac67c51cec4bb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"56396c6fc1786def6b5c879d75b3d3f71f2069444368af2ccc4c8503a3cfef83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd37cb1e587e8d2792a8647fd35ddfcf4c082326210edd3529dc8a4d58f8c7df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c485bf368d824797af9d7f14e178320fea83db541efd1d94aaa59f10887dd528"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\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":"lib/cso/verification.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ade447413bddbb199bae08dcca73101d94a47182604a286b5bdf1f26bba22fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\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":"lib/cso/verification.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad3542cb74543b160368b4bd83d4f36949050917254230aa00a6eb121eb0deb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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":"lib/cso/verification.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33174a1478c851516a6f52fe170347effe013293673ebdfde4627865bd0f8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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":"lib/cso/verification.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3996fb56d7925aa055294ceee051145d7111c0762236ecfb46e6a3d524e65f60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060observe\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcbbed6420396fdc0406fe32435a59ae30d48b94c7d15249267c93b373c9d71"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060observe\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b0b23ed8360007959c6d2784251287e450f48d941ddebae832b77d7e301a8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060observe\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c964197185bc19d7cf889ea04d24d525b72f84ce7d5761dc24a9baed3e896d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060verifyRepair\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e3f4f6be9097c918b11cd04e92357681ac604844cb453e29e48d52429460ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verifier.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabd9393d34ffbd499c1303f20377e5f3903e8b3d1011d7f0b413e643b534891"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060attest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1115628c2b7d68aeac5d17cbafb80092c25754a61a24e1f652d629691ebbea9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060appMain\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/app-cli.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2184cccfa5913636766681cc7f44d87bbf6ba8c13ef2b27bac77cc630c83cfc9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060lintPage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e346f5cf5128c787af59e7d17d73fbd9d867365eff4a6d236cc4852d3f15427f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060confirmPixels\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e814e196188fc8d25ed241d8f62f6006779d7ffd903431dc00472f86ab8186"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to groups.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b616557536d83fa47bf820c19e6ff7358efcafc2ee3aaad4daab671f0d665fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to groups.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"477767e45aa9e7d38c86e18a02b2d2aceb318220cb9a6bdbf8ba6265bcd3e8ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060confirmPixels\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9409e013fc79d9eb7718ec171558056761fdd98b364901b2a062bbb74639503b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab5cc18df72f7d97824e128fe81c74f7cc3326fa9e539318051e2036f6f7c11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060dxErrorCaptureMain\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"756181b0e6117658d28b9659296b9202233b434bfda4d7a159f7c55d7d56cba9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060attempt\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0775ecb8ede1b45deaf1dd00e89487e04b328e466c4e562dbf641b8117b1d5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060attempt\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a98708abad2a9af17f4f0bd977fa90de818bd1f45d42be623a624c240d69be7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runFlaky\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fe3476a6d3af92dbbcc5ffc3d090d13d53dada0923b3eea9f73fba224433ee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060rerun\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4b22269a16bc5132ca8b1ce131de4823728330c64e2dceb9bbdf2df89959b5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060rerun\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"845d0da8e08dd2c745fc4dac860dc8c0f20d3a6487843bf07ba27d6fe9fd08b4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runFlaky\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1626c26fddea7fa133844e36e63f96ca0335be4dae8e460e6cb2ed64f5de510f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\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":"lib/gbrain-sources.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d059aaaf2e546de058197b55804f185b4c7a841f04ee7b7a86090d64e267403"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\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":"lib/gbrain-sources.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa9b6d60ca2d06f044478ea39f6cc53df298cd295622f9e100cd644c88263f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060cmdListOrphans\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"da560e93b5e457fc73f1c6a204cbd89279d950febd24de826249e43cf64a5b92"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060cmdListOrphans\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f88bc711148beb36f768275da7a17727504e70421c51bb90830401cf5bd1df7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabdb32fa2194fa179f195f02cdb90d3f0e917c87a888e0b861d994cd454b414"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.spawnSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e021e63c54c9f550f635a0b8d5b239180d0aca09554dcf5b8e4aa5babdb7a9c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ad02c0110881d79c4977ad5990dbdc06594daa7d3e8af1d28e75a83f599288"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93a91ac3e07be498d59845bd072de06af492ffeb9ba5eed15b0d0d47cfdf066"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b71339ef692183e2c087d27c1d6643bf23e47ff61d9fd8686a5104e6c6971"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1075bffb971a457840c8c5a15a2bab87256bedb2f2bcb151207c431beae84ea7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"01edc460722c7f76db13aa040b6ec13816ac1cfd111929af6e588112a0d44cdb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df34969f277ba65ca484a28d2559f8dfdf0a96877543e6861aa36f4e5d30a72"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7156ce001a543a13bbdeea1ea92d57c401ad60eb097f1915b25180d2196d5fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f8dcf6a0ab6ba5c7cefc7722a26de90a1c235d17741fccb07eaf37d17b10e4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1b55300dd907ffa04dac626effeef4fe2ccc604047453f90789c62b1a28ef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf6d2a099c9b24db8408ecb5ab345c5790814ead8b579189fa566f7eaa1eb7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"50afc50704d240c4fa19ae5f68206bd00b73fce50ee503b94df5d7b6aed4c99f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baf477c57bd1ceef5a3e3201f1ee857b4ac63bedcef10d46c2086b175aade7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a74b0e515fbdb964c507f5e153fe07a905fa83e5c97e3a32dbe50fa7088987"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdbf3413b46b572f1fa13135932fb3ac3bfb6035d3b444bcf597019bb777b70"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060run\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1957892f8e11abd9029ca1d6c418e15ffeb5e28b9403d96a71309ae9021ef8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runGuard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/guards.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a11cc7474229dabbee607461a1e76cd106e4e4f701c1d35589f8b2f304b8b0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runLocal\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"892b78a666cc9eb95b465d08388879e214c4b5663ebee5185ad68715f2430ad8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runRemote\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"448dd63b2de1eea98e20290ea39cc7eeae049b1445e0bc6d8c2aba74253f94bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runRemote\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3e22010c6191c79e2092b6f2de47e474cca6b43879233b04129e8ebf7aade4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3924bcea3872702b5d8ae9a705fd90d0af75c3966f43b09fde3b57b303775a69"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc16bcfc3e7648ac37a9e74a26ed337bce21e9a14c78cf4a843669d3a8341011"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060write\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09b58fb16b480e91d80ecc2e026193e176abd008048eff81f2152a4ff09c11c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fstatSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"902885620f5a15da8eb8036e0e5f6d900932a06df2710671045e9a65d3ce66be"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"51054ef7922eea2440fc749b9b82d05f539ec576d91d053b9276bb439094fbd5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fsyncSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"807ddd0a27adf7c532a4be77983d2e52288850272b557bcdcd7a7d966d47a2d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fsyncSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a848d5f7f0f97ef8954eaf9ee94961ee5e9822aa629565fb135909f31754e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"979f9b2edf3007d95927f62259ba74077ff7d162535180f3cfed8a7d85466a35"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2cde15f4e83a94f5c5b56f90077df0c6a1ded785ac4389c77df40258a401de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fdbc6c138db4a528bdd61fce1536324e2be979ca6ca989eff05e720805303d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060finish\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"33695dd695c2bbedc1c00691d3c01af40de20c60eff2e43277ab58fe05a60e94"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060finishStages\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cd4449a9727afc9ed07dfd1daa30aab659b3407f22b1905ad32c7f3f1b7732"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060finishStages\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e553370d233fc34e94e94c6a799c8e43f035b7a9425635680ae44554391944"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060renderPdf\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/asideClient.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7902d2cebfcaace907d3b46486ddcf351d4d2b3a002c9c1077ce1138a8f49d4f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060renderPdf\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/asideClient.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda84740c542bc0d374fb5d18390dc06bf2274e69032195f7fd3cf569a05aec1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060renderPdf\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/asideClient.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67876d744f9576377258a046d770acb7f6d4105e0e98824faaae98dbbe174c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/cli.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"326d17d965ddc2fd6a41800fdae3e0a8651414bde3f6fddd5b5fbf3df6c4050a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060runScript\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa579a7137b00e43f95bc9edc89dd55fe6f9552dd047ecdc57fa2566228f4b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060runScript\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9623d7a27c1287be51b69adbbdb05577a0b2ec1864028befa413f97d44018768"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to calls.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d7116b2c175371963c33689ee085489423cb136605778cce3900b0442f41c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to calls.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"928a973cd9dfaf8a7545894754a3790892cd41e538cda48a497da3445f649282"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runScript\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa83e3cfd7ff77a56fc21aa80cd0e45de9f07d27ed31da76e93dcab8e73af02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to html.replace\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb47ef5d67e5127eba28362f8e9bd75f574bf652beee43d550f32d0afc5ba7d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to html.replace\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebf5a8809357491778721580580909063a75c8994c5ab5bb18ed21accf32085"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to html.replace\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e449290f125fcd9774b13511148b934309ed200684959965811bd309b56ca550"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7af8f68cd4729a0866527eda5ac777fc7cbb86781cbf603dd0ec677514e7d5a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a5ba129a7eec579ae5c13c3ceff36abba4dcb5d232cf04d918e1955ca379ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1331b2adcd6f3d7f8817c75a2b283a397cae47d5d54ac9de9f0d325ed6d422e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c891143036daccfec71d20cef30803704aed4f24b168771323aad53753522a90"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d515dae153230a7bc511c0ff9feefc6dd6423a86ddc47ab972e3e3347f4a2da"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdb67301fbcd43eef2bcc31dc7f5d1ed08fc337c0b42822d176cd9516165d15"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060generate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd425ead0b7cd3722d0e9e924ffefa4f8b3dc61b00737ef995eabc8d2bb39538"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060preview\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb2240db4b6a61e508d45eb07f4bfa2b22b89a5437dbccec81fb1f76d8e107b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060preview\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4c8c09633ea5907ee8cda5d6476384c4d3b4ad80121b92d7bdb557e29e60db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060preview\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbb277bffdd72160db666658d8f7f3a9c417c0378613a88e49077b2ac8a3f38"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060runSetup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2481553ebc97551b54af016c3b609becdc1fe805a4ed5f8392071cc90f9f610"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runSetup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09c16da0fde486f17406ab72ed8a6d3cd35599dcc185b8a3c55ea8e5eeedb1a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runSetup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba5ce32f35234c1f002dbce7878c83defcf8189d61f103c1e27b65ee015165"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runSetup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a60a6a6396a150a3d108a34fd72ecc508e506bdcfca17d8e60aed2b819a8583"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060runSetup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60d6d5ccc8094855ddbce67d0b9126835a8616a0c735107a563ceba0f16ccf0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runProducerCell\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ab7cca9b45306142789d24df571f97558324ed52779613aa6d4dcba4fd5027"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runProducerCell\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5705b232e95d6ed58195d0d4f2af910e0411bcb228c857d1e3e119c39d042"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060runProducerCell\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc97a3ca03ecc195a15a5e064a9f520cfe0e90eb59c0b2f780086da45fa1e90"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060verifyPublicGhcrImage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"515233f7a4a5fb7fde414658573c9cb73f0cfd23d108d98da9f9ac3556c70961"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060verifyPublicGhcrImage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc4f74df57ab05453bcc19705406a534902e4d2cf51fcb8ecac04e778ddde1a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060verifyPublicGhcrImage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c31248a3c973917c57ee2359c04b42cf005d64db0be50449500e301ef1dfe72"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060verifyPublicGhcrImage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"912db60282606fbda65d36ba485c40947c446e84351303da3c009b85dcf3a3d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060imageSourceFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-requalification.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"729bb59c2d316b3bbf5e55f6f83105de9bb268d4ef91827499a03eb921b78754"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060committedPreparation\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-requalification.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4139894bee53bcd1db3a067cada61c6eafdb412cd868f30f48aeb244b3913403"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060committedPreparation\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-requalification.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc69adb7b23e10ac8e407aa8a4778f1f22c6538fc2b4b0ea58fabaea771ef11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060committedPreparation\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-requalification.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f558758d62a56f06a604ae8b2ac886bf5ea5a1e5d8f36d8c6504dde2a6b1575e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060committedPreparation\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-requalification.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f012eedbbbb9cd38c66f8f32970889e986523011e30ed5cdcd9ab85a4405268"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060requalificationTriggers\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-requalification.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc931204f2f7298e016b30d78a36c6bde7836633b7d3fd6c689b3911c0fa861"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeLlmsTxt\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-llms-txt.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"088b018d607c0ef2439aa1534243697625d41d68df04ece801f0e0aca11d34f1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to void\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-llms-txt.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5230786551cc926997dd84e0d7bb6cdda54bb7e793fe3d9fef7d02387a76df84"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to void\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-llms-txt.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"117abc6fd336ebcee337f1e741cb050c5e600b3ae75a966ae157957b565ccc91"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060emit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9feea05d306dfb0b5ddd79ce5b7f922633f3d89433b19fba2fa2be70435b26f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060emit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9e42f9f9da7b301b91e43c1af2276a303c2f163f790bfc8c4dae650ae0b7c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060emit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b16de95c88743af993578ac58037637fdc0ccdd7d04ab56dc118289313b2f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runGeneration\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71bb14d9aa90b59b4e5dde2832977aef648a723f27e6cbbc87178af91129c52"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runGeneration\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"190fb867bfa401bf1b3efe3172da636cd205c3150af1492d0b1c1c4f5f94e90d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060runGeneration\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cbc4006a91bc2ff8e1f087bd3470b8fa51449f50f41c4d59a866617196775b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runGeneration\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fde79e2100482a82b36c10da24cbd21584dcc94e98d884b6f2e56ccae964b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runGeneration\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"782215e20042b4cf35057ff589a1f5cf45d9af872dc34389474b6286fcae9c85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a8500855eb9b243363da3a809e00c8898532d43e78e3edec5afecb45074a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060priceManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a82cc30b9bd0a1125dc9dfce618ab02ad09117edc7324ebdcde4ead62f4587f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9999b1a22bdeb5f8a7fcb60c2958130e20d899c58de4f4b60d6e389fa7b1607a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"100abfa1a8a670b2159d26eb53c412d850a522a9b49a251cf23a04347259d008"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"81454e746fc6192df797bccd7c08aef0c511160acd05e4b70d759e4d6ba1362b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd9a91d8365fe1ea353aefd553ff705853ca25f969b9f5de44e6fb3868a74b5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe2e20b6f375059d1dcee845da3d8c7cf7fce92bfeb51e421ad0e66d54a49b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060onRecord\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1365f0b74544ace556a3b465209a9ed7b418cfae89b1b4df832a6b4e96b2d39"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c46f5bceb28705c1d49ed0b535073a431c85701c0dfa9cf33ca50cb0b3ebf82"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d4737f27ea839e265ffce0c42f5580f11d80684d6864dfcd398b5effdc4e5f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fec5a842053320b91a04121e50daa54e7a9c66dfabbfd2c13b562ece6d3c2b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f0427e079199d81ef3ebd699c034fdfad23924928eaccbd563d909a55e9ffa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7100ca21f17914f8820451f8bc391769a3f1aec77bde0a541641bb15f2da11b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runModelPolicyFreshness\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/model-policy-freshness.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb30f407445fbea006fd51342dbf6654ceacd2595f68cacd9734d7ce29ce0fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/model-policy-freshness.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63f6747c041e7a59b37d4a9cb580b996af2065cd3b7ecc4bdaed743cd757d8f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/model-policy-freshness.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"009b3fb6b2a4e0ecaaf9f960abbeeb97598ae3a4d7afe8462f788c72d57436cd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to catalog.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-cli.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d989d392aff14850f295ede0e7ef0d11376271bd51f0da565145352987266e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f35490375aa32f83496ae55194e872a1fb8983bf158d932f3db6784d39a889"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.utimesSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aefe1afae41b78f4a38e4995f2eafce62b719d71555e5854d23cbe1aebbe1e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7250572acf33901893de9066c90611d81a39d3ccb39144633c5f4df6f00de1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f453f3efad949130613c9f00913a7a0b9641f18bf812b12e94ce300202fbcfe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8c7a9540e395e7503bbc84a3a3dafeb6a33bba05b571477b25a9ffdb86613a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3718b5bffb35b5e680ccd1ec3c70739d533a0077810ac45a2e7b01d50c2b17a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0709a58708cb735f0b43bb5b9e0f5293dbd50b26fa392e84562d4a93822b54e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70db3b5664630d55a6bc86327866756a3d5655006f5d9b68c21cb09ac990345"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060installLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2ffdcb56c93e37722dbe2cad2a18c1a91a80dc984e8305cc5b929ad01aa80b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"783e4b47d19a4cb73cb367af3a6ff15fba1caf334df545a2c5acf8413209a15b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"70780a946bf336811866fbc4552364104c1fa79e471ad6a4520b1b1eb10b3ca5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf5f759abb35c8c82a40fffabee4eee16b82d39b63535d2f62a6c5c0461862b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3bcc09ad4ac0a2537a9b23007a07b79406eb08a779500d755678cb40625c3f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84954c9783d020d8ff2bb8288a2a918df3ed813c574f16dc86e3fc95a2e8429"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c163e51bf95a758602eba59bdb5288e41cc0536e521988e263a3f960bdb85e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8a879d84281dbedd0eb29d935c4895376cf72c4d1064fb940595eb63bb26b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f29d989765f2437ee11cca051898f0f0c7f2f5481bf90a861a1c602f7477f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6ea8912b5fb96e5a24e237627a7e13002483d672cd51c2368d389b6f430782"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c6dd619b78aacc7f7f883cefba7eaa8a7c3cef2d35f3428713919d63356eea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060renderLoadout\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"348555e2a266e82595e6c670e3f9ca853278630590451a6faabcfed09bf028c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runSweep\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83dee836767392f9f5e5c37b56dbf86c6d60c58ca81173f5606e170e61e5b54"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3fb02503d081eb6fcf080835f5bbef5ed81f9d6d5801111fa8ed42c66945c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc80e1e525daf4d969dd4ee51f25d867a9192d5269879da6533b85e51124a2f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060sweepMain\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e762b4180f781bc855b2632757c70a1b93130471aad74d4d04b0abff912b094"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060measureCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7c996df785f9c8d79565c9e07692319b573a0d6ba4643c768633ec7e3d866d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060measureCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6bd74bc3fe26707ce52e5238cc0a7f61f934e2f44ee7961d827c026c710c98"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to Array.from\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ee1c1baa1f2b4a545b92588848cf7518fb9f86ffbb770b241c517bc03844c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060measureFreeShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b7314872420a2160dff0507be23c6ab2cde75d686c89dc848c3ab6768bc24b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060measureFreeShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeff62168434b97ceb7f1145a9cc5ad852d1010dd6b9e58ba3ed8aef39647b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runOne\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"369605035803b1d3334c37b9606d5d384618b1e2ca5f7e3e7bb489d4223b3181"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runFreeCli\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0e4cb650c999bae01c6968a2ec6be66799843693964be597e7300608f970c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-check.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a6a87e0ba8c3a7a52065787261fee8d4b28b3dcce5c3aee053303e6bd5208"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-check.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"176f643db30ee5f1e226722c9d8513865b142282f469ca384cb5f37386f6bec4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1388dc6d803ad8b72a45c092e4a030b175261d90bca5fa7a77d728fd79159d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab726e5bd7a82b9b88d21b93daa898301a34f7d72e4f03de540d773302b1627"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1eb3432c71649c7e0627dc461ec81240c64bc1a0d236305972cb07f6424bc2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6006c03554221a6154c52aa7845a09fa6625667759546cff236a69c0accf8b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c947e8fde7a917dbbf3966394f2938548ff05714f00ba03b5f2c8cea5150c9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b192062192b131c358272b9c12dfcb0172dd45a395f518ebbd8c0d20c6ab1f83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ee1377e5740ed923996fa4820d119b0af4fcb050629320903c21de715be4e2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060play\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f524e695609974396944f0e9ed671a82c7aade148671dc5cd7a45a3a5ff7b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ad51d62283bd9029d6fb6aae6caaa3072a08c0baa4728ee32cf172a1d86cf8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060descendants\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1163a79438f52a0f914b1b5674e82dc5cb73c76973e9bf8551bd9487a72cb5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbda03821b20b2be8463b29649280527f4f5d4478ee3b418125f14c518323e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be253538b38da025356d2de783ca2ee815bea1d8f81df3d6b453155b1d07f7e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3819545e19ccca61453beb0a5c9b0497571c02b62b94552b0b069a113181f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060capture\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"af68f158a9e603e45afa16fdf0177c722c748d04510154d674daa618c6ce0280"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runFreeShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e01ed2be74f1039857b82af5292807269a6a0ec0ecbe570a3fcd3c1ba80e19"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runFreeShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b626d6e918824bfc8f6a47b5d01eec6d250cd1f977710a8d2831515a6ecd249"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060runFreeShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4776769d1d03c572199f749b55c3b1e3a475a78c79a289399d2dac297285a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060retryFailedFreeFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a731b05348fbb5324c5210e1a203d5b5be74e126fa157dca6383cb3ed3da6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060retryFailedFreeFiles\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48eea9178d8207a1bc1331022605f5e030f735e1c753f546a15c8051079273e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9596a1c5cc7b4f61dfea755f15ee9f4f498d3c7b4cf576d8650f981a74494f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060writeJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ac8c127da2921ddbba55245ef0083e273b0be6593047512588909a52e52f2a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f5b6a8abc7989a8f5ecdf1e8b08673889f0faa67e6ff253178e46d4cb2066"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060writeJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2048778e493c67028bf663f94dec17e1292c9879952c352a1143b435c60ff3df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac424486726f42dc11deff1558a2078e73a65cfcc05e409a258e9584b583057f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b1018ffb7a24822645c96d31eaeb532c9cfa052af4901a2792fdad7a7118e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42434e2623bd5395d7c5dc8e5ca22364143a375e9c1271bfb807440b616c7e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runPaidShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e67fdfcbadaf2cd79b46b91fb03096eb9bf5d056844a19da160c3dd8578177"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060runPaidShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"da687004549e3fd169ee6f05e300ce1b678ff116d6a2ba6117f0052532293632"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060runPaidShard\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c12361a8541ccde379705a354a423f92879a4302decbccdf66f903c10c6b80a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"da261fb4206a21cdbf60f007d1100b9a1c280dccd4c111d21d5a2afae1cb6865"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"2894b115bc90dfae67b249163d40145dad7e4e8f2ade9a5111de806a78a463e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f11785654aaf85fc793f11804697ee94676c46d843adb17235d3bbf63eaeb5e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb3de0b41059533651036957daa277899f4ae5e9278311a5ad48b3d7a783311"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeSliceResult\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"3128770f206c11657bed79b7e3fc0716c940317e59d7150e0ba86543490b0b78"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060writeSliceResult\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c620b3dc1264e93619f78031e618582e7aec2a8d99ccb0852efa01a4d70b98b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060undefined\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcb810495a3024e98665e7b41c9f2a0ed4c2878b9f2e6e25ccfd2452bbdee83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 11 sibling directories (39 clone groups): 39 duplicated blocks under the repository root have copies in at least two of the sibling directories browse, browser-skills, crew, design, design-review, extension (\u002B5 more sibling(s) not listed) \u2014 27 of them are reported below, and 12 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 39 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 39 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 39 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browse-client.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f52009e22ec78753eb18a4115d9f325317053f06d1daf7854293cd486c519fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (139 identical lines \u00D7 2 files): browse/src/browse-client.ts:34 \u00B7 browser-skills/hackernews-frontpage/_lib/browse-client.ts:34 \u2014 these 2 files are line-for-line copies of one another \u2014 139 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browse-client.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"755646c6d14cbeeffc2c18d41dde96f585344868547986eed36699ac4137f322"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (79 lines \u00D7 2 locations): extension/sidepanel-terminal.js:571 \u00B7 extension/sidepanel-terminal.js:805 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"70854d487b975d3136b9e24c1834dfc464b5b9e3beda3b529c173db0d89c9d0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (60 matched lines \u00D7 2 locations): browse/src/snapshot.ts:333 \u00B7 browse/src/snapshot.ts:464 \u2014 the two spans are one implementation copied and then locally edited \u2014 491 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":"browse/src/snapshot.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95a31f1cea346aa8e9dda05a60a6abb50f374ab32c3725e30204aed15aff948"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): lib/cso/bounded-file.ts:13 \u00B7 lib/cso/snapshot.ts:132 \u2014 the two spans are one implementation copied and then locally edited \u2014 365 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":"lib/cso/bounded-file.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d633a43039c29abf73473afa54ff01647cd2cbd0081bddb26acfb3603176e187"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): extension/content.js:176 \u00B7 extension/inspector.js:214 \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":"extension/content.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6411acfae583c0b349af4d1104f6910aa2422e3f5d42897f1963aa82ec2841f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): design/src/evolve.ts:25 \u00B7 design/src/iterate.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 302 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":"design/src/evolve.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"71709fb79c0c09f6e42147775a3c3db07961942f5a248b4881917d443582189e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): hosts/claude/hooks/question-log-hook.ts:44 \u00B7 hosts/claude/hooks/question-preference-hook.ts:56 \u2014 the two spans are one implementation copied and then locally edited \u2014 207 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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"045b51a57c4229ee0b491e5d04211554305eba560c42877d49155665dd37327e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): extension/content.js:146 \u00B7 extension/inspector.js:182 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0395ee4cb19b1083b81680c7603dfbf3e7089e8209135c7bc2f88ce81a36880"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): lib/cso/preparation-container.ts:272 \u00B7 lib/cso/preparation-executor.ts:777 \u2014 the two spans are one implementation copied and then locally edited \u2014 238 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":"lib/cso/preparation-container.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cae9097920acdeb9d0a00c9004a43f2e51902b87070c28a9d75f65d056cf6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): lib/model-policy.ts:555 \u00B7 lib/model-policy.ts:619 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2fe7ff7ec569fd39faf0a9a611914f29d4b2bc0398a6771b0256935e8b1aef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): design/src/daemon.ts:438 \u00B7 design/src/serve.ts:184 \u2014 the two spans are one implementation copied and then locally edited \u2014 187 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":"design/src/daemon.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e1dea69e4ff1b021b1666c6a0cbc34d6cb83f355a506a53e69e98df14801d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): design/src/serve.ts:124 \u00B7 design/src/serve.ts:184 \u2014 the two spans are one implementation copied and then locally edited \u2014 144 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":"design/src/serve.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b772bdcd0e8b9432ec48328676ea954bce9b65a6a45a691b817c34a0490a80b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): lib/cso/docker.ts:1017 \u00B7 lib/cso/docker.ts:1043 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"79148d5011104ef6f24039414cb7490d9ce7d8d3b20cd3b888f5d86a6a6eb757"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): lib/cso/state.ts:755 \u00B7 lib/cso/state.ts:776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6050a76baa3e01d8f9a03426293e8e9df86e3164dc8b89ea350e7ba6761e31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): crew/lib/gate-cost-history.ts:372 \u00B7 crew/lib/gate-cost.ts:592 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 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":"crew/lib/gate-cost-history.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"687e190f3df37a17ef0f4f4c7ce9a0c3f35b273344407f406a222bf5a2dc0cb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): design/src/evolve.ts:86 \u00B7 design/src/generate.ts:52 \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":"design/src/evolve.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"947ad47e9b3c2a39c0820d0579134d4fcd123af0b4799267422c44f162fd22d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): lib/cso/verification.ts:2005 \u00B7 lib/cso/verification.ts:2030 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"798cd696b70b255d0cf8426c40a1ea6ec25becce664cbd12ea219c83d2484915"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): make-pdf/src/orchestrator.ts:82 \u00B7 make-pdf/src/orchestrator.ts:264 \u2014 the two spans are one implementation copied and then locally edited \u2014 127 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":"make-pdf/src/orchestrator.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e14f9bfc5eb1c0cd46a7aad7e55361f6f231e7356d4a01e4db1c42b2b09d888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): crew/lib/ship-queue-gate.ts:79 \u00B7 crew/lib/ship-queue-train.ts:160 \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":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fbfda322a43c756d8be13d72790a69a21fab45df7e9a2226a5dd3f5ddb2e68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): lib/ruled-notes.ts:21 \u00B7 lib/test-lane-exception.ts:24 \u2014 the two spans are one implementation copied and then locally edited \u2014 248 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":"lib/ruled-notes.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c16370eb030b1726741f0aac4082047ea396af64ffa4078de4c652e9f379a05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): browse/src/content-security.ts:163 \u00B7 browse/src/read-commands.ts:246 \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":"browse/src/content-security.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc6dae9bacd1b7ade20d252ce3b6d006cbdd6a578bd95dc6a45569942bfc9e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): design/src/cli.ts:409 \u00B7 design/src/serve.ts:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8147cacfb0b9ede5acd3061e22441a530d6da245086d67b9d454110d1604d5a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): hosts/claude/hooks/auq-error-fallback-hook.ts:40 \u00B7 hosts/claude/hooks/question-log-hook.ts:79 \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":"hosts/claude/hooks/auq-error-fallback-hook.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf16ede666325c2afc74e84837d7ea0d6008686f5ce0325b9a0b6b9f10f1df1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): lib/autoplan-run.ts:47 \u00B7 lib/spend-ledger.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 142 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":"lib/autoplan-run.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"449f9fe84640dd7a9b0bdf6ede95764a723351b695e95ad5b05ecc080fecd5aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): lib/cso/contracts.ts:682 \u00B7 lib/cso/scanner-executor.ts:171 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1377d13f38aefc2eae4f7f1e743b42604a811f4f240681ffc3057aaa1d1e8d58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:831 \u00B7 lib/cso/verification.ts:107 \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":"lib/cso/preparation-docker.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98bab0e36288f6da83f91c3f3c658a9a64727bfa9b8b58b7e37fbe870e499bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): lib/cso/preparation-docker.ts:103 \u00B7 lib/cso/preparation-executor.ts:553 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6204f9f21938295756031fc093b2dd164780c76c921b589b5d14163d9d016a3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): lib/pregate/flaky-exception.ts:191 \u00B7 lib/run-evidence.ts:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 353 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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efb26a6469d4098067ef703b38bea2b59fa86e4de578e04729890db5a9d3011"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): scripts/cso-eval-producer.ts:136 \u00B7 scripts/cso-eval-producer.ts:159 \u2014 the two spans are one implementation copied and then locally edited \u2014 128 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a8f62c504abbf59f568c909696bdf599d657aed29ae67e15d3cc095e50d17d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): design/src/daemon-state.ts:137 \u00B7 lib/memory-ingest-landing.ts:184 \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":"design/src/daemon-state.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e2cdf70d3925b709ec23a00cbf9cbae126c06828c45e0fd58991924b73955c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): lib/cso/docker.ts:539 \u00B7 lib/cso/preparation-docker.ts:841 \u00B7 lib/cso/preparation-docker.ts:1023 \u00B7 lib/cso/verification.ts:117 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce182f6885f0f3cc47dce7d37661fa1276db8cec07aa2bb805e6261ed7340c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): make-pdf/src/cli.ts:126 \u00B7 make-pdf/src/cli.ts:177 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/cli.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b897ba317260c5c327503ffac15b35c2f2c8522f54212b89af3fb8ded0c58ddc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): browse/src/file-permissions.ts:115 \u00B7 browse/src/file-permissions.ts:181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/file-permissions.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"927e96ba243d2ed0374d0bb5c2f9472d3da891a8ebcdc3f051b695939f32b5b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): browse/src/routes/pairing.ts:39 \u00B7 browse/src/routes/tokens.ts:26 \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":"browse/src/routes/pairing.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8b8b2da82c94d647c991d8f2506f78f693a42660b3909723dc403ba4c6a791"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): browse/src/server.ts:1255 \u00B7 browse/src/server.ts:1287 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c79c8a2636e071413d23c86e81449dfaa8dd893cc15698d9d06df210f10a8e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): extension/sidepanel-terminal.js:342 \u00B7 extension/sidepanel-terminal.js:645 \u00B7 extension/sidepanel-terminal.js:854 \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":"extension/sidepanel-terminal.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"076ca9baf9bd230a8b0b7d3ec736537be441b2f1d6dda28777eec5a3e53ba824"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): lib/cso/cli.ts:1233 \u00B7 lib/cso/cli.ts:1319 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1412ea3c83ff8bfa3eec063c960e0c285f74d84214ebd4bcc386c8c268d97b75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): lib/cso/image-provisioning.ts:266 \u00B7 lib/cso/image-provisioning.ts:314 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"061469004281e0a58611552881b777d575c12ac9116081a8347ce2dd75abdb78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): lib/cso/preparation-container.ts:364 \u00B7 lib/cso/preparation-executor.ts:580 \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":"lib/cso/preparation-container.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59425f1d15c5d4e27531ca9477c0447ca2606355dbeccfc52d86ccf17ba14cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): lib/cso/scanner-executor.ts:792 \u00B7 lib/cso/verification.ts:1688 \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":"lib/cso/scanner-executor.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6eb6f6e9a85ad87a81839358cc64df780cd7058c136416ba95047cd97658a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): browse/src/cdp-inspector.ts:634 \u00B7 browse/src/cdp-inspector.ts:649 \u00B7 browse/src/cdp-inspector.ts:698 \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":"browse/src/cdp-inspector.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6f6d57a53b307c42f1e17b683eabe53781bc580f993ea56e454f2965d1bfbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): browse/src/config.ts:33 \u00B7 browse/src/find-browse.ts:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"browse/src/config.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2485d8d1470e33bb1762fbd42303d16be97725c80db028adcb2fe1f44a2ac7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): browse/src/routes/pty.ts:39 \u00B7 browse/src/routes/pty.ts:114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/pty.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a52bb0f59a4a1caad8a6216c3bc007123cd68bc72f3ec6958e983f6114b251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:90 \u00B7 lib/cso/preparation-executor.ts:844 \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":"lib/cso/preparation-docker.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2811d62f9b61666b565e3b81a84aae0f02a538b6b6a494d66ed897edd582bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): lib/cso/preparation-executor.ts:82 \u00B7 lib/cso/preparation-executor.ts:110 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5667034bcb1ca1aff446f4458eb50dc0428a4f240610dde56a48edc0558a942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): lib/cso/state.ts:1377 \u00B7 lib/cso/state.ts:1760 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7233f39b80ba14bf04c186a63d69b5b03a5a5cbe44de7d2b62cc70bf4b89de57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): lib/gbrain-sources.ts:119 \u00B7 lib/gbrain-sources.ts:272 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"62839d35cfab70c97b0219c35669fc7b1b1503e59d019815a6f14deb42de182a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): browse/src/browser-manager.ts:852 \u00B7 browse/src/browser-manager.ts:2208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"812645223de7bc4b33eb88d55694c182338ddca5f7b4207a5dd38e6c96da0e5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): browse/src/pty-session-lease.ts:126 \u00B7 browse/src/session-cookie-store.ts:44 \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":"browse/src/pty-session-lease.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9124d851fcac8bf4b7babab7069985c30c81cd0dd85c7179dd19fb92a6ab5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): browse/src/read-commands.ts:385 \u00B7 browse/src/read-commands.ts:403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43ea3456077368370c351d91108cddb73c7dd8d2a6edc7a388c85ab3ec98c87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): browse/src/read-commands.ts:300 \u00B7 browse/src/write-commands.ts:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a227fe69d3f34d7d9dd5841fedbcd103c1cbf9dca7e3190dd4b87d32d0fb2c76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): browse/src/server.ts:518 \u00B7 browse/src/server.ts:541 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"34745c581ea2dd10aa40971259722d002ea94d0c9bc93ac8ca33b9213667b82f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): design/src/cli.ts:225 \u00B7 design/src/cli.ts:266 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"design/src/cli.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51dc33b99a2df382d815d9ba41694f33e4c473667d5b8d61a5e180065792ec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): extension/sidepanel-terminal.js:320 \u00B7 extension/sidepanel-terminal.js:627 \u00B7 extension/sidepanel-terminal.js:842 \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":"extension/sidepanel-terminal.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78a908fa161a1447091f02ab292e28d48014fa2a108b0d67cbeaa9104c12281"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/cso/admission.ts:45 \u00B7 lib/cso/process-identity.ts:26 \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":"lib/cso/admission.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58a7c26706370f5dcb84d29842ebf1bf5aff45ba837d253a71af3c7a5328af6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/cso/cli.ts:1219 \u00B7 lib/cso/cli.ts:1359 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe98ea439778d28009653caf22630b84896038f30c1029dd1bb73fa0f805ffa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): lib/cso/preparation-docker.ts:847 \u00B7 lib/cso/preparation-docker.ts:1029 \u00B7 lib/cso/verification.ts:123 \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":"lib/cso/preparation-docker.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"d432a27eb0868b96f6992265fac165b227d1d3989a91b02d608e72bb9c89d55a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/capture-baseline.ts:43 \u00B7 scripts/preflight-agent-sdk.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":"scripts/capture-baseline.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dbb4de47539d1e5f5248f9af2ca10cd9d10f097df0b7d2720bbe0c87e10fcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): browse/src/meta-commands.ts:214 \u00B7 browse/src/write-commands.ts:205 \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":"browse/src/meta-commands.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14dab91e6a15a6d05961d1e02afb3fe3a5de1f0df2a5a91e01c2318c7295b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): design/src/daemon.ts:292 \u00B7 design/src/daemon.ts:389 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba85a9d709287b786409e073106b4878a29d9cb0e1a55d3f53ff95ae7eb28444"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): design/src/diff.ts:26 \u00B7 design/src/memory.ts:37 \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":"design/src/diff.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"83badcc9ffab2cc839f1e5e1716c5b8d0dd5bd8c706e6257e0fab1cdc2099609"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:1055 \u00B7 lib/cso/preparation-docker.ts:1077 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ad86f7c929de34110bb488db91749fe5811e4d8fd84eefcaecff411940c88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:1310 \u00B7 lib/cso/preparation-docker.ts:1516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a0f5daa252eaff898a7f18af42b9c6ba3610e8d5527d11f1532f60206ea4e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/cso/runtime-catalog.ts:168 \u00B7 lib/cso/scanner-catalog.ts:175 \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":"lib/cso/runtime-catalog.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5330c30a7c1d818a3ba65cebdf0f0bc3ea327108dfb73365169a0f64d48a41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/cso/state.ts:1966 \u00B7 lib/cso/state.ts:2029 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfa1ecad73aca12eea95a47c651be7bb8266ae71c8af7e2e11921259d97e718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): lib/design-lint/rules/motion.ts:315 \u00B7 lib/design-lint/rules/structure.ts:118 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ed23ca5c20c58882aab6630de02d8db929d6ab063e65f2ca4a1b7735297434"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/design-lint/rules/type.ts:46 \u00B7 lib/design-lint/rules/type.ts:65 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa813a993fecaa1edd04452fb03f12a50e31abb4680548a17cf5d39d0ecada6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/gbrain-exec.ts:280 \u00B7 lib/gbrain-exec.ts:330 \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":"lib/gbrain-exec.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71dcd22f26b312204bf7118c6438c485c5441af31393c67c16c77539ba8f835"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/gbrain-sources.ts:231 \u00B7 lib/gbrain-sources.ts:248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e41566c8e04244c12eab72496d5dd69e1c8f25f662375c51e74079ab7bc2bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/bun-child-config.ts:14 \u00B7 lib/bun-isolation.ts:29 \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":"browse/src/bun-child-config.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aa49c51d7b65597df0ad380a267951845419d46b24f6b9a2ddcfb1b1649977"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/cdp-inspector.ts:571 \u00B7 browse/src/cdp-inspector.ts:582 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ec5cf258793d1d526aa26486e73c2d2107f04f14e4dfe23fca6d228a8687b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): browse/src/cli.ts:1224 \u00B7 browse/src/server.ts:339 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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":"browse/src/cli.ts"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a74a0bc7158ebdb13056f95b449691c3e3f41063cbc83e9a08be5be0159ec6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): browse/src/cookie-import-browser.ts:689 \u00B7 scripts/cso-public-ghcr.ts:143 \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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7667cf29f7c6616bb462b6ab632830cb48b0dd8c11de50f161d86db58b21a6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/cookie-picker-routes.ts:255 \u00B7 browse/src/cookie-picker-routes.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":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"788075810092c3159ef75ec70f086439451ac8e532f0585800f5cc4849d179a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/domain-skill-commands.ts:228 \u00B7 browse/src/domain-skill-commands.ts:242 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skill-commands.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a893c3079f7427f4d8a0b696d5c8bba96a051705ea00343f52b5f4e5f656b48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/find-browse.ts:46 \u00B7 make-pdf/src/pdftotext.ts:50 \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":"browse/src/find-browse.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdff987e97bef2410cec2c13bf60a30a645b664e068d4023bbb42d44939e9795"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/routes/pty.ts:56 \u00B7 browse/src/routes/pty.ts:90 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/pty.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"df39a9b0fbb60ce8323534b3c0047ec489026268a4eb1b60fb628dd9a4b705c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/server.ts:455 \u00B7 browse/src/server.ts:2157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee18a84c1a0c1c08fedf2d46a5ce8db113d0935606b8556ca6d9dd088a1e65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/write-commands.ts:1048 \u00B7 browse/src/write-commands.ts:1073 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecf05167a7d728c6bc5a8b21ad12ed3eda44a4e833d581ca85c6efb947bb3f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): browse/src/xvfb.ts:102 \u00B7 browse/src/xvfb.ts:130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"592637f89b5d205423ee3056d0acf09ac6983271fcd19c698e3e7283a4c5f8c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): hosts/claude/hooks/skill-route-hook.ts:38 \u00B7 lib/skill-route.ts:92 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/skill-route-hook.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5277ea66362b24f24aee2697d1e0032e539948d8b3b909abe19f6ae00bc3c527"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/cso/cli.ts:1263 \u00B7 lib/cso/cli.ts:1373 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbfc2985cd6711969e6ba0c6b4e19601e7bf63b9ef823147e222620de486299"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/cso/cli.ts:2382 \u00B7 lib/cso/cli.ts:2711 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bfdcc2be41cf3fc40a5dbcbcb236a36fcd893a279670bdcb1d9170f7397907"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/cso/preparation.ts:124 \u00B7 lib/cso/preparation.ts:510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"13db92cf932ace5f418dc7267fd49b9dc9751487e8fe016d10841aa234456536"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/design-lint/render-probe-app.ts:374 \u00B7 lib/design-lint/render-probe.ts:92 \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":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a789644fb32ac70763f326feaa9ba0f4d2d0129b38a97bc76a011e58e831a813"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/model-policy.ts:386 \u00B7 lib/model-policy.ts:435 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"526a9de36ce15ce73a11b0fc25197e4b6a4a66b4a09164cbfc02b6068e82f19b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): lib/model-policy.ts:257 \u00B7 scripts/gen-skill-docs.ts:1010 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"15920cf9a1b5081652c19ba2e1f7cb4445d71006a90c1a00b0a91bdcdbc6e427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/redact-engine.ts:467 \u00B7 lib/redact-engine.ts:508 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"048d400cec368e399c52dc81225a5fded7a41bfed918a61566a0884d510a7c3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): lib/spend-ledger.ts:128 \u00B7 lib/spend-ledger.ts:143 \u2014 the two spans are one implementation copied and then locally edited \u2014 115 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":"lib/spend-ledger.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1447bc318453376b0443c2a04042c24bb742d7fc98ade2a4419e40c020e40d22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/eval-bg.ts:439 \u00B7 scripts/test-free-shards.ts:2251 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcbd75508e28b711d6dc415f0a5b8ed5bb705cd0f0cca115eec781fe6b95d0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/eval-bg.ts:439 \u00B7 scripts/test-paid-shards.ts:1169 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf583fa975c47bc8eb4b3dc3d6dd4f061f4a119a8e8b7587914137a56ad6324"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): browse/src/browser-manager.ts:1699 \u00B7 browse/src/tab-session.ts:84 \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":"browse/src/browser-manager.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae9bbefcfee4eb3cd8a7ea96a2289d3f0734cbdd9004cffd6a921c8133d68cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): browse/src/browser-skill-commands.ts:143 \u00B7 browse/src/browser-skill-commands.ts:172 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6ad5443db637a7fd76759e806a3abab17d8273dac62fde176220e95cafb316"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): browse/src/cookie-import-browser.ts:295 \u00B7 browse/src/cookie-import-browser.ts:896 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af27f4ebcce9193702b084e6892c81eb1bf4b81f27a968399d4e168e8a439c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): browse/src/domain-skill-commands.ts:172 \u00B7 browse/src/domain-skill-commands.ts:214 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skill-commands.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ee6f48d92731591c49e9b73e9dfd72c0305045e98e93d5f75ab5360301e9db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): browse/src/routes/inspector.ts:56 \u00B7 browse/src/routes/inspector.ts:84 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/inspector.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4899af777035d33fa2479f5a9851cd2545dc4ecf75313809327e3f70195edf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): design/src/daemon-state.ts:92 \u00B7 lib/pr-wait.ts:249 \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":"design/src/daemon-state.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9b83bfada62f8a329cb9444de0e0d7a62638e65a1fe9a08592bedc40638e9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): design/src/design-to-code.ts:69 \u00B7 design/src/diff.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":"design/src/design-to-code.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f23b6cdcc1bf56fb7fe87de776e5470112a5bfa4434bd75c91899b4dacefe54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/ci-gate.ts:67 \u00B7 lib/pr-wait-github.ts:66 \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":"lib/ci-gate.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c4fc5726c67af53fdd73dff55a9cb26d81cc97c8cdc495b76fc819b84c7c37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/code-intelligence/gbrain-adapter.ts:251 \u00B7 lib/code-intelligence/graphify-adapter.ts:96 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/gbrain-adapter.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8248ba9b10d65f3d1d006ac4b14569147a7205afa61b97205e7c42eae0ecde6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/cli.ts:2049 \u00B7 lib/cso/cli.ts:2074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f676fba72180d09314ff0059ecff0bd8820d8a20326253ac58804389ac4b0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): lib/cso/cli.ts:1051 \u00B7 lib/cso/state.ts:2199 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca999c4011a5d3b1180ed8bedf610adeb6dc6419b01a1f92fb071340e6a4afac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/preparation-container.ts:218 \u00B7 lib/cso/preparation-docker.ts:225 \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":"lib/cso/preparation-container.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"036783bd864cc9999ddef1e69888bd2f0cb339d2fc30c86bd2ac40b3f8950526"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/preparation-executor.ts:547 \u00B7 lib/cso/preparation-executor.ts:852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"34991525799f39547669c07d6ba80026e87ca9a273f4062cba4116433ec6937f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/preparation-executor.ts:1144 \u00B7 lib/cso/preparation-executor.ts:1377 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd5c8c0c81b6dcc96f064cf8a47c5aeb7236088f5910a5984ff6d2f7733d50e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/snapshot.ts:155 \u00B7 lib/cso/snapshot.ts:373 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd43b549d2dabcb7fd5bff9048c484073160d7f9e5c055530d95215a4878484"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/state.ts:820 \u00B7 lib/cso/state.ts:2519 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d6a5ddee5e5764774ebc6a56e85ea4dc4c39a1f0efb44abb9ef67f3723045b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/state.ts:1007 \u00B7 lib/cso/state.ts:1347 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2407349afa0245cb93a3504f45cee17e52d8ef76848b14c6f5ba8e5021e4a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/state.ts:2008 \u00B7 lib/cso/state.ts:2054 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"146533b853faa6bc80250f874ff60b7692a3254994856070d6522f3cd039d69b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/cso/verification.ts:444 \u00B7 lib/cso/verification.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":"lib/cso/verification.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93181588ae6a03fe06ba01bff5986bae88a53ba16be8293ec2fc9d0edfca43a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): lib/cso/verifier.ts:28 \u00B7 lib/model-policy-freshness-sources.ts:33 \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":"lib/cso/verifier.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13c1bc57889c76829143224ca0074ebd1b81bc43bdf1c9c2ae6f3504dea3a65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/gbrain-repo-policy-client.ts:105 \u00B7 lib/gbrain-repo-policy-client.ts:150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e2986a65e3ab07df8987096e22867370162702f07565e2f996be837c842cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/eval-compare.ts:48 \u00B7 scripts/eval-compare.ts:84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-compare.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9d6597100d96e9b006f547f886dce5356a86b403c38133e5db424034d79742"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/external-skill-names.ts:8 \u00B7 scripts/resolvers/voice-triggers.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/external-skill-names.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d44b0a06869dba768c1e1ab05b79b74582bb95369dcf4b9d28316451c40ce65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): browse/src/browser-manager.ts:676 \u00B7 browse/src/browser-manager.ts:2032 \u00B7 browse/src/browser-manager.ts:2065 \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":"browse/src/browser-manager.ts"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2397795d875b18aa84d7af4de18401ce472241cf31300edf243a3cfb036c27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browse/src/browser-skills.ts:324 \u00B7 browse/src/browser-skills.ts:368 \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":"browse/src/browser-skills.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bccd017b69fd02b3e69e7087e9b9651214e8a4df1ead1153e3147ee5c0fb0a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browse/src/meta-commands.ts:732 \u00B7 browse/src/snapshot.ts:596 \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":"browse/src/meta-commands.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e312b874f8be262d459d5f8e6d003321b2f98d1f6180c6a303483ae13d69c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browse/src/pty-session-lease.ts:53 \u00B7 browse/src/session-cookie-store.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":"browse/src/pty-session-lease.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4b52682818919953ecfddc838ed98d37200a73bba2c70ffbdea3c781919a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browse/src/read-commands.ts:710 \u00B7 browse/src/read-commands.ts:719 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2841f12ac474715d3fe6b540ad5f94d4db1748ac66a691c8a5b7c57f4c0639e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browse/src/routes/pairing.ts:122 \u00B7 browse/src/routes/tunnel.ts:27 \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":"browse/src/routes/pairing.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"be47e294aa88355c21c95425405b8e9c3364b011cff57c931825a7cbd1f71797"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browse/src/write-commands.ts:417 \u00B7 browse/src/write-commands.ts:493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3bd93569521881b4303e37e6d3e2816db140fc0576067d24f05578f5f2c783"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): crew/scripts/eval-input-cache.ts:221 \u00B7 lib/qa-evidence.ts:50 \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":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac392e8e436392390624b91e838f4833f6ddddc1d720d23115be36d9906618b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): design/src/compare.ts:630 \u00B7 design/src/gallery.ts:260 \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":"design/src/compare.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d30a1bf20318baa8d826f6dc4c7e177177b346165fc64014c114a96e400acc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): design/src/models.ts:58 \u00B7 design/src/models.ts:88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/models.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bb74ee6c5c4536e8c724dd3976e6ca0100970dbd7f6bc5b58f1101a8a463e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): extension/background.js:388 \u00B7 extension/background.js:398 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9359ca3add606fc79ee71013f072c0f6542107b7219cc6044a0343db68009c4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): extension/sidepanel-terminal.js:430 \u00B7 extension/sidepanel-terminal.js:439 \u00B7 extension/sidepanel-terminal.js:941 \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":"extension/sidepanel-terminal.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbd8c66ed5396e9aafab44d9c9bce1358c4de36e7b3d729a4532544b7f8b1a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): extension/sidepanel.js:822 \u00B7 extension/sidepanel.js:1102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"925e3e8a0d62c32c55587bf824dfd26a99aa55d95ded7f55e5f30a60516a059a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): ios-qa/scripts/gen-accessors.ts:389 \u00B7 ios-qa/scripts/gen-accessors.ts:430 \u00B7 ios-qa/scripts/gen-accessors.ts:537 \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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e325b9b57f977c94151d47ffd0e377d8ae47bb1d4ae12cd2131c0cde705124"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): ios-qa/scripts/gen-accessors.ts:158 \u00B7 lib/design-lint/html.ts:219 \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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"684cf318577d9793f341c9e8cc818b051e990140b92b547717e28db5ad51cbf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/code-intelligence/gbrain-adapter.ts:67 \u00B7 lib/gstack-decision-semantic.ts:59 \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":"lib/code-intelligence/gbrain-adapter.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0878b7642c90f2f0a764ba3d21ce91c402bdf34cb0138f4db20856ccd2f1b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/cache.ts:646 \u00B7 lib/cso/cache.ts:689 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e2e4bbcbf4397e3eb6e07094989db1d7d67d35c26a90295751ce2dfe3dee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/cache.ts:795 \u00B7 lib/cso/cache.ts:928 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a638af1bb3e754f4f8f6b636567c897ff8f89e4a8511f42c4c1c86cbc61199c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): lib/cso/cache.ts:243 \u00B7 lib/cso/snapshot.ts:311 \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":"lib/cso/cache.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c1e5fdc307e59b541017f94c4a6b42fa218f0ca8cd510f6d196176655617e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/cli.ts:1507 \u00B7 lib/cso/cli.ts:1653 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c59146a46d0f2394a5b2c9fc1590d7adaa3597baea48bd45088ca439b2ac9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/docker.ts:277 \u00B7 lib/cso/docker.ts:316 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a9a5c8de57be9f80669d252af41b2c82d914f3401eade9911918292f600b7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): lib/cso/docker.ts:777 \u00B7 lib/cso/docker.ts:1027 \u00B7 lib/cso/docker.ts:1053 \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":"lib/cso/docker.ts"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c416d900042abbffc0eca65752eb2a36532cb95eecf65843a87fdc309778c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:1281 \u00B7 lib/cso/verification.ts:1701 \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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"614d7beb3d5edd06d4ab4510c8b06c0096ea982999b873154d38c0e91f30d9e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/scanners.ts:672 \u00B7 lib/cso/scanners.ts:798 \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":"lib/cso/scanners.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d0de2b49a960eeac76f09b30b1ecba7d6c8bbcf123553ece5c9dfdb060a54e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/verification.ts:580 \u00B7 lib/cso/verification.ts:784 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c336515ec3d48d0c570fbcbd862d78517805264c7788bb19ee5782f0be1d572b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/cso/witness.ts:426 \u00B7 lib/cso/witness.ts:434 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a54fd469abaaeb09a9c540cdee1fadbacdfb228904c2ba350528680a3e663e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/design-lint/render-app.ts:94 \u00B7 lib/design-lint/render.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":"lib/design-lint/render-app.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"896e95d50f76f629bc31f8aa9c994adca14547505c07c0b6032f2f85d2874d82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/gbrain-supabase-provision.ts:406 \u00B7 lib/gbrain-supabase-provision.ts:531 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d456d873c05ba7ad4161e2f493c4e70c95f3ef8de3ce6b2c0e3b364954cead"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): lib/pregate/checks/secrets.ts:24 \u00B7 lib/pregate/checks/secrets.ts:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"lib/pregate/checks/secrets.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aed4942b4fd51ec5fdf9fa02721007e66a0eba82aa5dbb4e90f4117c9fa89cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/skill-contract.ts:597 \u00B7 lib/skill-gates.ts:175 \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":"lib/skill-contract.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e138627d5ff9fccc3c53b08040f80e3e19f642f13a5f87868d04d75606b7fd16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/eval-select.ts:100 \u00B7 scripts/eval-select.ts:111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-select.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d45c525ef9d3eb1b8d8c416972eaedf446f6eb2a359f80774eb51e7f016f24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/psychographic-signals.ts:286 \u00B7 scripts/psychographic-signals.ts:318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/psychographic-signals.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf6a6845da2bd46f00e147b3cfff76f6899c992f286dc9cf208c4e530fce39e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): supabase/functions/community-pulse/index.ts:110 \u00B7 supabase/functions/community-pulse/index.ts:127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/community-pulse/index.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad1c54665195b9500f4bd88a67bb4935775de723e5fb0769e4227ecb787e7db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): browse/src/browser-manager.ts:707 \u00B7 browse/src/browser-manager.ts:765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"25435ab3c49e2c50c169a50f887418081d1dd3d5375d1f19a6cc6d24ac70924a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): browse/src/cdp-inspector.ts:647 \u00B7 browse/src/cdp-inspector.ts:697 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"39052cf19570724aef127a12eed5ab0b24c374d84d5224b6b658e70d1c109d24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): browse/src/cli.ts:370 \u00B7 browse/src/cli.ts:1941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6172eca4396393c57e963cadf1db3001cf25d91171f79f7b9808cbb40bbd276e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): browse/src/pty-session-cookie.ts:23 \u00B7 browse/src/sse-session-cookie.ts:31 \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":"browse/src/pty-session-cookie.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47a3e99ce3a1286790f85ac7db455c3b73ffeadfff5d343972ee02eb1f836e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): browse/src/write-commands.ts:378 \u00B7 browse/src/write-commands.ts:396 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"676b3e65e5c49a9ed079d659b11a74d40a0bed118c9fdfa5b84e4285620ae81f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crew/lib/ship-queue-train-land.ts:293 \u00B7 crew/lib/ship-queue-train.ts:546 \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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a79e00539b0b0d0071cc7685b0a4723f9575979301a28cace954b44fddbd0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): design/src/cli.ts:60 \u00B7 make-pdf/src/cli.ts:49 \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":"design/src/cli.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9a7eef9b0b5550ea80f55471c1806759d43c40f4a25583e1e04cb649585abb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): design/src/iterate.ts:121 \u00B7 design/src/variants.ts:179 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/iterate.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"143e7e9c4432da893521d7225628bfa8c77aa7a621c63e6f41f13e65e456e59e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): hosts/claude/hooks/autoplan-stop-gate.ts:53 \u00B7 hosts/claude/hooks/ceo-review-gate.ts:62 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/autoplan-stop-gate.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b625d604d1c7991a01e18017b0e83fafb357e02a798ca73d6055624e445fbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/archive-check.ts:100 \u00B7 lib/archive-check.ts:178 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 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":"lib/archive-check.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403d5164c10f9281f81245fb481f96ba0972f3f044a2fae9239b4c390a2bcd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/autoplan-shadow.ts:152 \u00B7 lib/autoplan-shadow.ts:435 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 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":"lib/autoplan-shadow.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd268ce4037aed448398137c95d61a651aad1953c1907ce93788444c4fb8f143"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/ci-gate.ts:173 \u00B7 lib/ci-gate.ts:182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6a0d400cb3f0ccb2bf658a0299536d801c466010164b4354c748ba4271a545"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/claude-code-migration.ts:192 \u00B7 lib/claude-code-migration.ts:233 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e3ecdd66cb901c6a4666a02eaefc297c24b383a46507caafe4e454d43a7e64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/code-intelligence/graphify-adapter.ts:111 \u00B7 lib/code-intelligence/sourcebot-adapter.ts:130 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb7bc7f8fed64a0bbd3620c5ca7799043a88dabd646f51dfd14fb7a543dc3a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/cli.ts:385 \u00B7 lib/cso/contracts.ts:381 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7626e7f7b88d2045b8806b8316c4d848424abb36a1a340118b7c355ef0b1ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/cso/contracts.ts:874 \u00B7 lib/cso/contracts.ts:931 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"lib/cso/contracts.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bda2141ea652297156997b99a454b41fdb59c5a98e708c8ce901b9b14d4a65a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/docker.ts:966 \u00B7 lib/cso/docker.ts:991 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c46c5f08cb31cec073fe7bd87305fa28d435940beaa55bdec2da147672b6dad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:35 \u00B7 lib/cso/preparation-docker.ts:183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e5154e38856e26aa3ceabfbce725efe3c50b844c4d967df9dc0b3596cfef95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/preparation-executor.ts:529 \u00B7 lib/cso/preparation-executor.ts:842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"120c5e4194f8810c6c7d6758646513dc2b778840ccffcf83cc5613209ce71a88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/preparation-executor.ts:1193 \u00B7 lib/cso/preparation-executor.ts:1434 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"246ad3b1aa919193c3146c0f411309a79ad1cab6cdc7fdf6f6b56b652dd8a70c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/snapshot.ts:526 \u00B7 lib/cso/snapshot.ts:558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"5630aec130614821e1b1bf1e14923ac103339764b65469700df8a28ac96baf2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/state.ts:1915 \u00B7 lib/cso/state.ts:1925 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb62f673e989ce18e6f1caf34bafa384ff637740721ac4cb55ec6bc1bfd02696"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/cso/verification.ts:233 \u00B7 lib/cso/verification.ts:297 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9b6e2bd2d5b33d113df70c72d0dc027a1c82a44f3ef72e25f83baaff6157f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/design-lint/rules/assets.ts:100 \u00B7 lib/design-lint/tailwind.ts:452 \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":"lib/design-lint/rules/assets.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"605392d9e6325601271c8bcfa56185639ca8a4afc8852aa56ee800a24e7390ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/design-lint/rules/chrome-copy.ts:140 \u00B7 lib/design-lint/rules/structure.ts:319 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"lib/design-lint/rules/chrome-copy.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9000519892820aae65ffc3dfeecfc70d76cb65bdc0f60375d926a81e292584"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/design-lint/rules/finish.ts:228 \u00B7 lib/design-lint/rules/type.ts:120 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6090e35f53b88bb86e41029ba341e4408137942ee1170cbfaf71ed9f6d1ba05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/design-md.ts:494 \u00B7 lib/design-md.ts:503 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59a015864b46dead2023900e1573b7389bd7218f9ca946718c82c0ef33c68ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): lib/gate-dispositions.ts:65 \u00B7 lib/ruled-notes.ts:31 \u00B7 lib/test-lane-exception.ts:34 \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":"lib/gate-dispositions.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3579b8a92f9bd592413b2c5e95ec6b52976897a59968523df05fc7ff97ae4a8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/harness-register.ts:200 \u00B7 lib/skill-triggers.ts:73 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f3be388e574b941435de3f77f6f6090b051cd66f7499faa6ef75ac3ec6693"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/pregate/context.ts:105 \u00B7 lib/regen.ts:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"lib/pregate/context.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55cfc5ef179cc2effc96e322c0474821a2ff0a27b974729f0d6b779d7a48598"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/pregate/lane-selection.ts:182 \u00B7 lib/pregate/lane-selection.ts:195 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"634f745e3e508483f8487dd70cdd911317adc72518478cfd46a6a6831ff9f5ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/pregate/stamp-only.ts:122 \u00B7 lib/pregate/stamp-only.ts:154 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/stamp-only.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4416387ec82ea728a539148485817c83c4330d80572eeb58b1a90ba27f870b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/run-evidence.ts:363 \u00B7 lib/run-evidence.ts:406 \u2014 the two spans are one implementation copied and then locally edited \u2014 134 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":"lib/run-evidence.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b45dc8a7b7d56c87c906dede2498858880292dc064c7011158f7131b1d32c44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/sealed-guard.ts:330 \u00B7 lib/sealed-guard.ts:367 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"lib/sealed-guard.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ad213937c36bdf876962387c0b8f7351cef3e2ce91ee51990559cac6f411e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/ship-handoff.ts:164 \u00B7 lib/ship-handoff.ts:294 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"35847e2c5b3e2893fd559b63f17fa40a5b0f5d9510d188a45e9743c559d47c83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): lib/skill-gates.ts:203 \u00B7 lib/spend-ledger.ts:93 \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":"lib/skill-gates.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"209e82389733176d951dfe63649cfc2e76c69c12117d86379f09b18be9f1fe69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): make-pdf/src/image-policy.ts:179 \u00B7 make-pdf/src/image-policy.ts:197 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/image-policy.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89bfe6488d4f53d1029f9b11c74bf7ad02028eec18bbc278c578ad7c98354f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/analytics.ts:97 \u00B7 scripts/analytics.ts:139 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analytics.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2cfa1632f5bba7e9cb9c48662b6109ea2fa5d6befd36dcc01bcf6e8485890"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/cso-public-ghcr.ts:256 \u00B7 scripts/cso-runtime-promotion.ts:385 \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":"scripts/cso-public-ghcr.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1285a1ecf9048390a27b1ffcf983e09664f6ebd46ed1f9c1be78f31fcc8201e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/gen-skill-docs.ts:891 \u00B7 scripts/gen-skill-docs.ts:900 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"195c09c8d89d12188dffc58d864a0d115ceff6a168584582c483e12951f6270f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/psychographic-signals.ts:295 \u00B7 scripts/psychographic-signals.ts:327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/psychographic-signals.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b36c18fc7299128f29d9f81246d5548cec1a2f93483ca1f577e8af9458c0a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): browse/src/browser-manager.ts:501 \u00B7 browse/src/browser-manager.ts: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":"browse/src/browser-manager.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a190f70e9ac5d5fa482ece97ae85c822232364f2874f6f590d9f9eeed3ae0840"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): browse/src/browser-skill-commands.ts:111 \u00B7 browse/src/browser-skill-commands.ts:146 \u00B7 browse/src/browser-skill-commands.ts:177 \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":"browse/src/browser-skill-commands.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a62d1d68aec4686fa2b23cafac3d8d5157d97305f6ce6682fdbf5ab4abfef7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): browse/src/browser-skills.ts:343 \u00B7 browse/src/browser-skills.ts:377 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ab55ef542fe36297e77d5abb3a8d686d8d9bf15d2da06145640edbbe9eb3f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): browse/src/buffers.ts:48 \u00B7 browse/src/buffers.ts:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/buffers.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b2e1cc4e87c6433a2a8fbf37d346a9072a1afa97f2a452588262eab96f3e19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): browse/src/domain-skills.ts:220 \u00B7 browse/src/domain-skills.ts:309 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cb19aa78aa3ac2d52e3b52ba40dd543e06c8c4e7563362b54b36fb816adb0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): browse/src/server.ts:670 \u00B7 browse/src/server.ts:678 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"08310fe36418578b98501189303d9eaa194e27f169c06cea5fe3eebf6f733c48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): browse/src/terminal-agent-control.ts:101 \u00B7 browse/src/terminal-agent-control.ts:374 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"89394f75fbfad0e9bc92c490795374da5effad2a86a278d7d3a2341b56756c13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): browse/src/write-commands.ts:476 \u00B7 browse/src/write-commands.ts:492 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e78653fad811e398e033a998bc64a401b05afdc0f98cfe8c5dff3cbd98aa43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/lib/release-gate.ts:389 \u00B7 crew/lib/release-gate.ts:404 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 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":"crew/lib/release-gate.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2528e6598670a1d3133dca229d3571d82c782f188efb7162b7befb754fa6845f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/lib/release-gate.ts:83 \u00B7 crew/scripts/train-backstop.ts:50 \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":"crew/lib/release-gate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"da42d1557d625707b657816438ee46281ae01deb2e9782dd254fb0bd1f92f9a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crew/lib/ship-queue-gate.ts:47 \u00B7 lib/autoplan-timing.ts:33 \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":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08c86f820fe388a40a25c34d708899e321a14b9d0c551c6911a3b25a71a8068"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crew/lib/ship-queue-train-forget.ts:21 \u00B7 crew/lib/ship-queue-train.ts:670 \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":"crew/lib/ship-queue-train-forget.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"447d53d2ba7084da364d218d016e9840f2fd555d83c5df4d125d985c258a15c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crew/lib/ship-queue-train-ready.ts:316 \u00B7 crew/lib/ship-queue-train-verdict.ts:104 \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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab631a8f6150fcc27b91590a866e330d4706418b6e4d2a0e0d9d67bfabe25587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/lib/ship-queue-wave.ts:372 \u00B7 crew/lib/ship-queue-wave.ts:384 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b7fedcb1df87646e9020358515ca3209ce5901bf8b85979ea13570850bad72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/scripts/gate-reuse.ts:516 \u00B7 crew/scripts/train-backstop.ts:280 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f20331a70627afc5e4e3d1d6ffcc8e3e2a722b9fd48b7fab4677785173e39c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/scripts/gate-reuse.ts:163 \u00B7 crew/scripts/train-gate.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b424f169bba1bdd6b3d588ef1a91ff8534af989627b14a4fffd3e51bb0201d81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/scripts/recover-receipts.ts:308 \u00B7 crew/scripts/train-gate.ts:358 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/recover-receipts.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa48a75e8b19fad9589b1b90d3c828ea53197711be94d08f9623db54193d7a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crew/scripts/release-cut.ts:219 \u00B7 lib/ship-patch.ts:67 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fd054f3c21880acf8f43994a303a33ef9536f81c1fff03c03c976c5e5ba33f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): crew/scripts/replay-pr-selection.ts:168 \u00B7 lib/retro-friction.ts:147 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc48b858375768ca7294be19e72f2d0e4e4748524e61b74986c85b0069a1e73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): design/src/daemon-client.ts:142 \u00B7 design/src/daemon-client.ts:153 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"design/src/daemon-client.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd6dc10ebf8ec62698d516ad4ff4e4e3e312e91c130196059ccb6803af86363"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): extension/background.js:177 \u00B7 extension/sidepanel.js:585 \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":"extension/background.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6c529454890880f25b96e028914a1a99c35f63365626a20e6d7a7f17e56be5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): extension/content.js:229 \u00B7 extension/inspector.js:117 \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":"extension/content.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f9da3358b087bcd00a896a8e7faf758a63c7201b500fe871f2d87ec6da701a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): hosts/claude/hooks/autoplan-stop-gate.ts:136 \u00B7 hosts/claude/hooks/ceo-review-gate.ts:101 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/autoplan-stop-gate.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f062c9bb568bf8da5fd57d3981820eea28e3af3966b2cee6ae4d888002dc6fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): hosts/claude/hooks/skill-contract-stop-hook.ts:77 \u00B7 lib/skill-gates.ts:270 \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":"hosts/claude/hooks/skill-contract-stop-hook.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd506609517216e560fb72e807cda38f630c7af2a0aacd6114962d03fc717969"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ios-qa/scripts/gen-accessors.ts:545 \u00B7 lib/design-lint/css.ts:75 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"540eee6c1ff2b30660a3ed1d3e5b3c7883f752899dd3c4557ef7b4a482df9463"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/approval-citations.ts:46 \u00B7 lib/approval-record.ts:147 \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":"lib/approval-citations.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"812ca5e2d182201937a7dcb3326c9b8149fc5c800f9720fd009ea76da3e282ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/autoplan-checkpoint.ts:64 \u00B7 lib/autoplan-run.ts:57 \u2014 the two spans are one implementation copied and then locally edited \u2014 124 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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1395d1f02e632a0946205ca829a2ceb54172b5e704625623d42f440e058002f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/autoplan-checkpoint.ts:61 \u00B7 lib/spend-ledger.ts:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 128 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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a140266e1d583b0fac224928ea0ee94aac0de7af26ee490ef1973f6206b03d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/autoplan-export.ts:49 \u00B7 lib/autoplan-gate.ts:198 \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":"lib/autoplan-export.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552be7e91b59bf4e6ea78893807e34eb78633489810c42f77326d7a788d139e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/autoplan-plan-text.ts:85 \u00B7 lib/office-hours-probe.ts:51 \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":"lib/autoplan-plan-text.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b13501818114428f8846086c6db334059633de6748caa1e79d982befe327ff1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/capy-review-pass.js:138 \u00B7 lib/capy-review-pass.js:266 \u2014 the two spans are one implementation copied and then locally edited \u2014 114 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":"lib/capy-review-pass.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bbcc954bff6897318a0084c88502c8b5fabaeb0d18a48a952a69686ed68c47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/checks.ts:85 \u00B7 lib/runtime-pins.ts:136 \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":"lib/checks.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd09497d32e4bd527de7190e8e7b1e266506e95b02afbf4dee20fb6e653e6d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/claude-usage.ts:130 \u00B7 lib/ship-budget.ts:353 \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":"lib/claude-usage.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22470d97783269637b30ff7f5e8d2f6b8d617e2b89aca1d36cf78499e61dd42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/cso/cache.ts:658 \u00B7 lib/cso/cache.ts:712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5deddd8241b6eb264457b67b00d7955c1829af51edf9a2ee9a73c9d40bba01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/cso/docker.ts:719 \u00B7 lib/cso/docker.ts:952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"300f8b6effd1437143d32b20f9baf08d05068d542eb8e71f5b7aaaeba513545b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/cso/docker.ts:1128 \u00B7 lib/cso/verification.ts:140 \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":"lib/cso/docker.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"79419d3aec60c58f9ead963911d505700ef35928d8744ff514771c7186d95670"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:1369 \u00B7 lib/cso/preparation-docker.ts:1591 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"326ec0a8c0f9c6d8d035782819eec10d3205bccaa4f65a4fddd8755a7a422e10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/cso/preparation-executor.ts:630 \u00B7 lib/cso/preparation-executor.ts:1166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a3e0fb0ba9ef0d476364f0989de5dbdd1cd550ed5a1c69e638bce8be1aff00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/cso/state.ts:994 \u00B7 lib/cso/state.ts:1017 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc66d4553b1493232307f3fdb3d85118695973703d33b132d753faeba8ede6a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/design-lint/html.ts:278 \u00B7 lib/design-lint/tailwind.ts:337 \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":"lib/design-lint/html.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec343825a5c39c53cdeb30eb70e2e3e3c6e1da528c425a3799644561153205a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/design-lint/rules/assets.ts:197 \u00B7 lib/design-lint/rules/structure.ts:249 \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":"lib/design-lint/rules/assets.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8712e2b6fed9ade66b0fd2cd27cb2f1dd79e939ee224ffbc37a5067d6b6b8438"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): lib/design-lint/rules/chrome-eyebrow.ts:87 \u00B7 lib/design-lint/rules/chrome-eyebrow.ts:116 \u00B7 lib/design-lint/rules/component.ts:91 \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":"lib/design-lint/rules/chrome-eyebrow.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2978ba5f3ac1698548a3428665d447a14160d135b85f5d99bd6559f2e000398c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/design-lint/rules/chrome-eyebrow.ts:55 \u00B7 lib/design-lint/tailwind.ts:630 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome-eyebrow.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76267decd9e61881cc70fd0936aa9800876d9556ac44c4d33dfb5f2e660f26f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/design-lint/rules/chrome.ts:125 \u00B7 lib/design-lint/rules/type.ts:430 \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":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"939766c7adda9d89b2028f264d1e5ce7bae4e3e022fca6e661160ffa75d7facc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/design-lint/rules/component.ts:95 \u00B7 lib/design-lint/rules/structure.ts:27 \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":"lib/design-lint/rules/component.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"178c0719ff187cee80049a337b9ae819e17cc859e4268a8118219d0ee2c93f54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/design-lint/static.ts:258 \u00B7 test-setup.ts:64 \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":"lib/design-lint/static.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b772579b7cabd5e19c087e2db3390258357680f744e352be8997b0e86c26ffc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): lib/diagram-render/src/entry.ts:116 \u00B7 lib/diagram-render/src/entry.ts:174 \u00B7 lib/diagram-render/src/entry.ts:193 \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":"lib/diagram-render/src/entry.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c63adbe43a49bebb5a30fc71571f8c6504efedb3b542bdc5e37d7761a9e9ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/factory-scorecard.ts:274 \u00B7 scripts/lib/ci-history.ts:113 \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":"lib/factory-scorecard.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90ae7391a097eb121354c3d87059e70074c1a61d2b2712aa76347e1647d6456"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/pr-wait.ts:523 \u00B7 lib/pr-wait.ts:532 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"lib/pr-wait.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9064bcabf0427b89d8c7eee716cb74f861c21d6979bcb119245b443853e9249"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/pregate/config.ts:148 \u00B7 lib/pregate/config.ts:169 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ab4d269492d58abc79020fbd22cdabc6c2cd83f5e4944ac11f6e499de39031"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/redact-patterns.ts:362 \u00B7 lib/redact-patterns.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":"lib/redact-patterns.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e40e6af5c9a31efb2951ce708e62324fbcf1631fad7af33e66e00a2faffc7d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/repo-state-clean.ts:219 \u00B7 lib/repo-state-clean.ts:230 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"lib/repo-state-clean.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e18382249af9fab383c6c9c5f2170dbb5c976771e255d1986343ef6982c4546"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/review-risk.ts:157 \u00B7 lib/review-targeted.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"lib/review-risk.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc5277bb39ea78d16763628fd84dc2fabc9aa7d4b49f985dfaf0b63ccb21eeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/ship-queue-land-direct.ts:202 \u00B7 lib/ship-queue-land.ts:350 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b52ca0e3c6c57728be1bb66927e8d40dcea0464a63a91198915994b53fba9d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/analytics.ts:84 \u00B7 scripts/analytics.ts:109 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analytics.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"324b27225fe8b372cfed9d47bc871dcaf29cd7ac460081aec4cd7ea156bdd8d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/cso-eval.ts:406 \u00B7 scripts/cso-eval.ts:455 \u2014 the two spans are one implementation copied and then locally edited \u2014 222 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c93826501d42da4aa343ba9022cce29f17e542c92d85aadc0443bcdda1885"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/cso-native-evidence.ts:126 \u00B7 scripts/cso-runtime-promotion.ts:385 \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":"scripts/cso-native-evidence.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"233bd010aa919ab9a1a59532bf00b98c1535e7e3ab3f2e6dcbc670716435ee2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/cso-public-ghcr.ts:240 \u00B7 scripts/cso-scanner-catalog.ts:144 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5f107eecd7d64cbd49f5a535657330cf74c4e6fa9ceaf235c0a05c8b6f817a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/lib/shard-engine.ts:317 \u00B7 scripts/test-free-shards.ts:893 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-engine.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4b4a18fa4321edb1567d9b02f9e1135322774b027797f0a9952a67d50c56ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/resolvers/composition.ts:8 \u00B7 scripts/resolvers/composition.ts:41 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/composition.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a336489129872f9f4d1b29ceeacd8f1925c2f7c3d2d28f054107e716ead05ebd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browse/src/browser-manager.ts:2505 \u00B7 browse/src/browser-manager.ts:2534 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c689ce1193191ce5c5461c5167ef8cee653aa100df57ca1afb8b3e13947f6c1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browse/src/cli.ts:114 \u00B7 design-review/templates/preview-fixtures.mjs: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":"browse/src/cli.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cbbeb8c95a9cfe24e18a2fa3e950f068f3ec5b081f517993cb03d9062307bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browse/src/cli.ts:1052 \u00B7 browse/src/session-name.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":"browse/src/cli.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b01989755ff33ee437c20750bc21644968742977cfab35f01675247e006c8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): browse/src/domain-skill-commands.ts:61 \u00B7 hosts/claude/hooks/auq-error-fallback-hook.ts:48 \u00B7 hosts/claude/hooks/question-log-hook.ts:87 \u00B7 hosts/claude/hooks/question-preference-hook.ts:80 \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":"browse/src/domain-skill-commands.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e06af81151a6d11dc0dff5d92ec963e50e6fb9c97bbb16d6f4ff05225eae565"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browse/src/server.ts:72 \u00B7 browse/src/server.ts:1718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04117b416242c420e02871bd1f702a0e1de1f4a44c761472802994af529ff8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browse/src/socks-bridge.ts:222 \u00B7 ios-qa/daemon/src/index.ts:222 \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":"browse/src/socks-bridge.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"119a48e5b733882b6d5da272a86e0a1e3940469d8e5c260469b73f4b0d2ab807"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browse/src/terminal-agent-control.ts:50 \u00B7 lib/cso/process-identity.ts:52 \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":"browse/src/terminal-agent-control.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f795b283035076ee5bbc62e2847263e49d116e034d3a65e8fb7907f9a7d9521e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/lib/lane-ownership.ts:20 \u00B7 lib/regen.ts:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"crew/lib/lane-ownership.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"256cd413df223aad943cda01631f7bb7f2a9ec03b0d2b5be15ea8893514f8144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/lib/ship-queue-train-gate.ts:240 \u00B7 crew/lib/ship-queue-train.ts:527 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"39664e048cc4a035e1468b22f2a76fdc4e92d984940615ddad964fe7e4a10614"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/lib/ship-queue-train-ready.ts:234 \u00B7 crew/lib/ship-queue-wave.ts:258 \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":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"14583b34f133cda2e0900a2a8c73e4725c1254ba0e55e66e2387b6cc86088862"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): crew/lib/ship-queue-train-verdict.ts:108 \u00B7 crew/lib/ship-queue-train-verdict.ts:247 \u00B7 crew/lib/ship-queue-train-verdict.ts:315 \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":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7eb7c015b700978227b4103f1866cd98c67bf644bcb12d577b7603a5464ff3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/lib/ship-queue-train.ts:137 \u00B7 lib/changelog-check.ts:386 \u2014 the two spans are one implementation copied and then locally edited \u2014 129 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a3bb3a65af3b0af512598350586d29d07e2dd1d956d4b5c1f8fd6c2e086d47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/lib/version-gate-train.ts:27 \u00B7 lib/eval-models.ts:119 \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":"crew/lib/version-gate-train.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bdb5f50e3d5ada82c0205b5d65f0022c24a2270ad5aa29deb9dfe95723c7ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crew/scripts/gate-reuse.ts:534 \u00B7 crew/scripts/gate-reuse.ts:553 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa53673d15804badacaa2ef84e61af016fff95923150fd5229b2eb4d89f3c60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/scripts/gate-reuse.ts:516 \u00B7 crew/scripts/recover-receipts.ts:308 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4aaaae251be053ece10b47c0e71df24791b6d0fdeb2d6a2beb3fb3a8746cec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): crew/scripts/replay-pr-selection.ts:144 \u00B7 scripts/exercised-map.ts:127 \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":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"901964e277f8fb7147a2be953621b83b8df914c646daa099aef4431a96b74761"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): design/scripts/live-gemini-check.ts:38 \u00B7 design/scripts/live-model-check.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":"design/scripts/live-gemini-check.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c098c2f03700243dc802bcfc1244bea1d4d262436701b4f66fa95e2d04126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): hosts/claude/hooks/memorable-user-prompt-hook.ts:108 \u00B7 lib/dx-error-capture.ts:294 \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":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce9f38c98c7a3b85dba1776af1bdbe73b1ca918aba0eea3e9691c04186063a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): hosts/claude/hooks/question-log-hook.ts:213 \u00B7 hosts/claude/hooks/question-log-hook.ts:223 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a30b7af73d3aefcd2300a0b9aea6b25352445fac8d9f645ac3dd5d84295b97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/agent-notes.ts:24 \u00B7 lib/agent-notes.ts:58 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/agent-notes.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d48c55235fa77068a9c656cdd8ff67d10dbc836feddf1c4df89625310ab9a56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/approval-classes.ts:83 \u00B7 lib/banned-terms.ts:52 \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":"lib/approval-classes.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"330709b70a5b3943ec43ea25c6cfee81782af0f8b2fcfe1b812231a2a4eec8e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/approval-record.ts:113 \u00B7 lib/autoplan-checkpoint.ts:109 \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":"lib/approval-record.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aeb72397b6bc823b9937304e8fba78a3a4195c767560e349df3cb6108d9388"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/approval-record.ts:192 \u00B7 lib/approval-record.ts:218 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6982e5b892a4eaf2d6aa39dd5eaea4b4b2b9ea36526ef4518cd36363d4922b28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/autoplan-gate.ts:313 \u00B7 lib/autoplan-run.ts:175 \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":"lib/autoplan-gate.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6da1da1a0c676a21ca3674ea1bfcef4b0abcfa149e705f1a07113d98fb8890"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/autoplan-phase-publication.ts:61 \u00B7 lib/autoplan-phase-publication.ts:105 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-phase-publication.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bc6111b0b9f75265321fd319101e65b54f2493a8b40fbe251ab60d5c858e51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/autoplan-run.ts:434 \u00B7 lib/autoplan-run.ts:452 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b332bbb72fcfde44fc667a20130667f5a7e74c5b830b7b6ed27d04701f7157"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/autoplan-stop-gate.ts:89 \u00B7 lib/skill-contract.ts:477 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-stop-gate.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb24b1e21b1989ff420fff9ef3e04e9ff0bdca69899fb6081f7ebb5f216ba8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/context-bill.ts:341 \u00B7 lib/context-bill.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":"lib/context-bill.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd9a3b262f21d2fc05e6e397769ea61e588226ba2926088fde9c815848ceac7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/cso/admission.ts:61 \u00B7 lib/cso/preparation-docker.ts:781 \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":"lib/cso/admission.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdc7a1fbd03ca3a7f7b7136c97a73cd8a9ab97fd9c2613ee8db820eaa107b6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/contracts.ts:383 \u00B7 lib/cso/scanner-executor.ts:158 \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":"lib/cso/contracts.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47c747128c45447821dc0e92de3ba93f1399ab5c2222f3765215a90c3ca023"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/preparation-container.ts:558 \u00B7 lib/cso/preparation-container.ts:582 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"10309ea0d56ff086aa6892555854bb56e0c945be152996f856adcb2f6922252b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/preparation-container.ts:683 \u00B7 lib/cso/preparation-docker.ts:642 \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":"lib/cso/preparation-container.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c6fdc1034d109e914373ffbdc30ca06501482b221e505e73b0da4e38a6a000"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/preparation-docker.ts:1390 \u00B7 lib/cso/preparation-docker.ts:1601 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"401a8b77a973f751443959daac5b2931d173a7d36109932e877d40cda18cc9e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/process.ts:433 \u00B7 lib/cso/snapshot.ts:216 \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":"lib/cso/process.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b162826241910f26ea1dc22cc8ba74c816211048ec88ac8d4f46f139bffbc91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/scanner-executor.ts:317 \u00B7 lib/cso/verification.ts:198 \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":"lib/cso/scanner-executor.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f47297344455e554e610618d986effe09e4500d24933a5a0837326460ef1044"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/cso/verification.ts:165 \u00B7 lib/cso/verification.ts:980 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28a07ba434df8b175aedf553dfbbbcd9b839822da3ff84e87acc1e8d63db2fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/color.ts:62 \u00B7 lib/design-lint/color.ts:72 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/color.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"61166f2f387a9b59c06dd3ac08f944e0f9b17cfe1b078f5a9e1e1bcaa8a3387e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/render-probe-quality.ts:79 \u00B7 lib/design-lint/render-probe.ts:171 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a9236c43d7d4c5d3675878d7eb98e6c31d8b6c400f3d4226dcb13658d57b10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/design-lint/render-probe-space.ts:195 \u00B7 lib/design-lint/render-probe-space.ts:241 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c74ca0b673d8dbca45d783e649e04837ec12c4d7db3daaa2e1d80730686e04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/rules/assets.ts:30 \u00B7 lib/design-lint/rules/structure.ts:89 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c4445beb80c734f7cadef538e6d6c14f6910d055ba02e9025a2b2a74c2972"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/rules/chrome-copy.ts:58 \u00B7 lib/design-lint/rules/chrome.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":"lib/design-lint/rules/chrome-copy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5406403508c1176bec52a7221791842eb19e18794656464f5dd695cfbc574e11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/rules/chrome.ts:154 \u00B7 lib/design-lint/rules/chrome.ts:173 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d775318a6bc1636b291b161c88e923376b5c53753db03cd56c6f56bb4e360e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/rules/motion.ts:285 \u00B7 lib/design-lint/rules/motion.ts:293 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9666cb9031d259daa5c8a0ebe2707d20f91963e8ac5049a5db449ebf518da91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-lint/rules/type.ts:95 \u00B7 lib/design-lint/tailwind.ts:496 \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":"lib/design-lint/rules/type.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce2ab6a2078f6d239bcef0e6051c4d0f87980db8cee39010a2b64b346de30a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/design-lint/static.ts:140 \u00B7 lib/design-lint/static.ts:224 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/static.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98b077bd239a0b6780c44be0c722a64a4d7bf3ec4dc3dd3c284690c73bd0482"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/design-md.ts:305 \u00B7 lib/design-md.ts:333 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"706299ead5dcd5493278cfe556e3df9267e5b93842de456bbbdc4923948a563e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/dx-error-capture.ts:185 \u00B7 lib/gbrain-guards.ts:146 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f762dc2903cdfad4d4371224ef35683459a390e4c063034690da9c89c6ef28eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/factory-scorecard.ts:374 \u00B7 scripts/test-health-report.ts:45 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"08961046ebd41b2bea93edbb0d4e3657bd2c60590f623b1c4cb204cb5ab2eda2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/flaky-run.ts:246 \u00B7 lib/flaky-run.ts:287 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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":"lib/flaky-run.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab26025d9f123482ffa30c87f72b16271b9c34d6d7c016d60681439b3487aece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/gate-diff/git.ts:315 \u00B7 lib/gate-diff/git.ts:338 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2778fd76df5c565b4fa54e3ecf9a864d070c98a4119f57f85f7149d9ca7eb9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/gate-diff/git.ts:344 \u00B7 lib/gate-diff/git.ts:405 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ab1a30d959630da7bee132767110e829f9fa68fa0d0abb4d5f4fc6b175b710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): lib/gate-dispositions.ts:58 \u00B7 lib/ruled-notes.ts:24 \u00B7 lib/test-lane-exception.ts:27 \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":"lib/gate-dispositions.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82cde0c9ea1f8cf1aef0476289d3cef3297bf9032723427e0745eb1a18f4114"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/gh-poll.ts:120 \u00B7 lib/pr-wait-github.ts:102 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gh-poll.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca9df9026ae5ebf17de22aac446a957949fa197a2be3cfbef78e1efb0ef5662"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/model-policy.ts:539 \u00B7 lib/model-policy.ts:617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4eb7852b637f2827bc61be26e385499d386e1d744f832666d392578234aab8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/plan-reality.ts:305 \u00B7 lib/plan-reality.ts:329 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094e8040ba1bcd481a91394ff80d0a9196a57fbb43bcf737ced0b7a1e75cd95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/pregate/config.ts:141 \u00B7 lib/pregate/config.ts:163 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc8496fa6bb79b82deb9dcc6e89cfcc6beb8b569314faa1ae6cbd347f3a53a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/pregate/config.ts:223 \u00B7 lib/pregate/config.ts:228 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2de4e89796f7d2e3413f4af905c077094a3baa33ec523054901399974da6f7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/pregate/config.ts:291 \u00B7 lib/release-stamp.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"lib/pregate/config.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"365fa6efb3e56ee5dae02fe1284fc80e6d1afe3766af04be60d7ac1ac1182659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/pregate/context.ts:108 \u00B7 lib/release-stamp.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 103 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":"lib/pregate/context.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"494791351a3e603ac5207d696a02b1f0dd051281d94812ee30f736e72048234b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/pregate/context.ts:105 \u00B7 lib/tree-receipt.ts:43 \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":"lib/pregate/context.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00624d66d5c113480d6d764a1fd12f2efaac1c4661ba748c93e97a0c9b60528"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/pregate/flaky-exception.ts:116 \u00B7 lib/run-evidence.ts:270 \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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75fa4069715fabd2f09063d3b6460ec1870b35d75b4bb7da8a29be3383b1763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/qa-deadline.ts:295 \u00B7 lib/qa-evidence.ts:426 \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":"lib/qa-deadline.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d751590503259846049368ee66e7a2c0bb220a189be5c5e724e110740c5436"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): lib/regen.ts:96 \u00B7 lib/release-stamp.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145ac7deb07736fcd6de514ab0b1f1b24679486815304f9e5977c12c41ecb2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/repo-state-clean.ts:200 \u00B7 lib/repo-state-clean.ts:206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"980ad6320857509e6d33f541ba2f600e1123bf6bd3b7ca688b8d0e676aa1fade"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/review-collect.ts:229 \u00B7 lib/review-exclude.ts:334 \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":"lib/review-collect.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b4ea34d2dabb3cb8f8a0f71ddcda75f6a7cfc2d9c1f4ebe025dbed5aacee8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/review-depth.ts:584 \u00B7 lib/review-depth.ts:675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6a89016b59585c2dc3865d3fce0eedd129502073fb9765b21ae1fb9fff2d4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): lib/ship-release.ts:644 \u00B7 lib/ship-release.ts:713 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"e892d1573d822467352fd80264bd72a5aecfc53dc7b1eb6f6758e89933245123"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/cso-eval-producer.ts:272 \u00B7 scripts/cso-eval-producer.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":"scripts/cso-eval-producer.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"30120e8222528ab3a0da3815bd77081999d7a5677c0f429d6d882d9d7538bdb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/cso-eval-producer.ts:392 \u00B7 scripts/cso-scanner-catalog.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":"scripts/cso-eval-producer.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e772d6de9f0ba16dd49e2b46dade2cecbc90f718157c1796c85db69a762d581d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/cso-scanner-catalog.ts:139 \u00B7 scripts/size-ledger.ts:24 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-catalog.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c549f6729843ebf956bea7279765ddd62da802e7b26e503e4f803b5e0485b97e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/gen-agents-digest.ts:83 \u00B7 scripts/gen-doctor-components.ts:18 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-agents-digest.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e9739a1e6b55fa28f966a726f719b2dfdb337c714578f35f3dd954d922ed61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/lib/paid-report.ts:276 \u00B7 scripts/lib/paid-rerun.ts:94 \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":"scripts/lib/paid-report.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95f72aae58cbb0a8bf3de4786e404d290c1d458c763e1f63fca140b8da6af5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/pr-dependencies.ts:212 \u00B7 scripts/pr-dependencies.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":"scripts/pr-dependencies.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b24d6d5065e75388e762aa9f7e59b753bf95b66c73238ac6dac2c548d1143e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/ship-measure-sweep.ts:322 \u00B7 scripts/ship-measure.ts:769 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e0ed3492ff3f01cafbe91e98de456d9aa0a4aae3534b32a7c5fa4f3ba709e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/ship-measure.ts:341 \u00B7 scripts/ship-measure.ts:367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea76439117204c6cb7c86114739524c4e24d235266fdec30ba006888e3d8710d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/lib/ship-queue-train-ready.ts:68 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3559185d8c70766b24bd62571058d5eee80ebd4294a4c43b6c39382283e284"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/gate-cost-replay.ts:43 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee98e1035498ab069f38306d819f2f6f69f76a55796f4f079c877215fea59d58"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/judge-calibration-configs.ts:7 imports test/helpers/llm-judge.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/judge-calibration-configs.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4f59566a4f57fdcd696a66c2ff560fec69058ed55b824ec41fa6872149f5f5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/measure-journal-read.ts:71 imports test/helpers/autoplan-guard-fixture.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/measure-journal-read.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ae31448abfb4fb1bb0fb1d3bb79f635a751aff7c708285e9976851790c58ee"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/replay-pr-selection.ts:26 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd18146ff10c59668e6fb0d3b02bf3c42f8da4c8f6a551c2115a2b8df0dfb81"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/replay-pr-selection.ts:27 imports test/helpers/test-selection.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbc30976716b6d0df1c1d467e6e5f3c094d5e3256b1865343498deb9ceb0e93"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/train-backstop.ts:26 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d5a7386893ae85e11db3461a7665569c7e700ce0a6b08ad951c1c6e29cfee0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/train-gate.ts:33 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daae75cdec087d378771f86545c34d19f4ddf9d7d8c7e6eea950bb0f2a6aac4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crew/scripts/train-gate.ts:34 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c88c8f527a41c522e9c26ac3c2b9c035605b196e553f0f56228425df43f5de2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: lib/pregate/flaky-exception.ts:373 imports test/helpers/paid-test-set.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"be07bd23b4eb755bd61e61a996bcf7459e9599a2a82e54455a341a2b12f7f7c8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/capture-baseline.ts:16 imports test/helpers/capture-parity-baseline.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/capture-baseline.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2139f78cd92c9d7b71c0da7f95c20faef07d3d224de5a176d1093f7fa03ddb57"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/capture-baseline.ts:17 imports test/helpers/parity-harness.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/capture-baseline.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab0cc73a5cb58f85f071e9e8f5f73047b3174b0882223457b2e5159f716aaf8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/cso-eval-producer.ts:15 imports test/helpers/providers/claude.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a376f63b16995d989126c06b9aa62e2ab96e7323390b411af1f884642ec40"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/cso-eval-producer.ts:16 imports test/helpers/providers/gpt.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1247f965d677d6b264b56f4c244582bb64cc255977f5dbb384f88d822cdca393"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/cso-eval-producer.ts:17 imports test/helpers/providers/gemini.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd271399712454133b72bfa6ac7c9c46a732700281f6690936969d09693a9b6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/cso-eval-producer.ts:18 imports test/helpers/pricing.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8169fbb50dff936ab1331057430982f813709e15106326de3db09e9212f167b0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/cso-eval.ts:12 imports test/fixtures/cso-eval/materialize.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd963100d7773e3d810d3b52c188a260f6518cbe9ad8caed3173cc658daa74b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/dev-skill.ts:9 imports test/helpers/skill-parser.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/dev-skill.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bc2e2790ff0a685c43ee5e4eb214b1f1cf57b7cb68fcf93c2dad9143473f11"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/e2e-shard-reuse.ts:31 imports test/helpers/test-selection.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d799a64d452372b1666d385b5b0c9f1f05a64a353c9551c059be2b31e9c87b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/e2e-shard-reuse.ts:32 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a729d0c32b9c50dafe9b3ffba9020217b3dc295bd40288837451a1258a6f8b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/e2e-shard-reuse.ts:34 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bbca3886732d11498a18624827fd71a248718769afae451ca8f2258eaaa71e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-bg.ts:32 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"726eafbaeefb11695688ec2cd5413a166df79fc3ba077c3de5437c58628ed40d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-compare.ts:14 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-compare.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d37522dfd239c2d94de2f84bc33a7192571a9286789351a772345b9e7ae436"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-flake-rank.ts:53 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad1d768bf01a4b7bd91b597a7de7b7f24abd6ed213df62bc5732055860cf49f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-flake-rank.ts:56 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"56518e2c1312603b3f705410d63ff8f3575c88cfc75f30f5be46a8a1ad892a8d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-flake-rank.ts:57 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"03be253d273aea24c378acfc7f8f0906638d85b75eec9e95bf0f447ab1964834"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-list.ts:10 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-list.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0524b32745cd53ef01bddf5a34459958677eae73ab669913592c553dbc821829"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-select.ts:18 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-select.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc60086b799304c39b4d78617606b40aba2cb02a8ae3d981b30b98bca387615"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-summary.ts:11 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-summary.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48b8d523e028accc360b5deae137f6d569c0267d9360d4e880bc432f5f5915"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/eval-trial-series.ts:26 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-trial-series.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"428973b77642956b08246bf5b739299bf1125f633435056c23b17b3859240b3f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/judge-calibration.ts:26 imports test/helpers/llm-judge.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd415b34572e7d935b59cddb78acad6228d36d29122ba164421424acecc0216"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/judge-calibration.ts:27 imports test/helpers/eval-budgets.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eaedbbbfa62b3f53ddc8f04fc7839b13360878aac2a522e85f7bb0d4d421db"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/judge-calibration.ts:28 imports test/helpers/pricing.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7eddcba894af5990836512c02bccb5039dd0f96931f7bc8007eb3da42e06a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/eval-history.ts:23 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c52a65e2eba098239d18d8b29ef4fba6a84fdeba7f91f3958864d795a930ee"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/eval-history.ts:24 imports test/helpers/eval-budgets.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f53f8ea7f59917e2946c836430b3aad033622caf94b1017b0d6d75c76be6526"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-cases.ts:7 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-cases.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a60924310364f9291df117fcd8a8a04c8edccf8c8a3279dc0938724890732f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-cases.ts:9 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-cases.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5b152a06d5c52683bd1c62ed79c1498e9cfa1d2f9d4ba037ee62b83488e5ae"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-cases.ts:10 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-cases.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3162b77b593f1177375d388758e4701252b3464fc3a779d42d40f37fb399d2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-cases.ts:12 imports test/helpers/e2e-hosts.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-cases.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a316ce70c54b2199b3e07444c0a4f1d2efb520332193595b4c46136699e615bb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-plan.ts:7 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b754cfa9debb738d001802cce8354efa2116a0dc33b836d1d2412cc0aa7cbcf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-plan.ts:8 imports test/helpers/eval-budgets.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"341893a09274140b9d4addec78932da428caf1cd097a9361ec685198965b6fcb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-plan.ts:9 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6c35227686278c7b388e823505b6fb1e1dfda9cbec6de7e26d556e1ac8f4ee"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-plan.ts:10 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a690c53dab18d618a8ca1c6ed9ab7a574e6dae29d7f6988d6692e39e92e9fe2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-plan.ts:12 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39d8487fff86474b6e5aefb902f2c45f76ef852e336f6b71a1a035f520710b7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-plan.ts:14 imports test/helpers/e2e-hosts.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d92d4d3358774520e7d18010aa704187b5d119432380aa42bb14d9e0764ca22"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:7 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce6feb2456ce48b9433465425d59658fc853b82ea7c766b403e40451444e646"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:8 imports test/helpers/eval-budgets.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"58188fc7319c089e24b95f3947dc6c3075f5bf7a873eb68b4f3c8f540a594b43"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:9 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f194ea2e91a468a6f55ffc22de81fa40fa28a0f1650783bf78beab093e1fc6d6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:14 imports test/helpers/session-ledger.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7b1cc1f3bf96747be819b16acc9d68dcd024e1b52093bd6a2c2b595afae1d9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:16 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e628b54a7a0c1eae2203aacb96855f5195d9209ccd62f244fd2fedb94dff2f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:18 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c2e0c79d7b0653b62ce794384d7cdcf67e3a80a72d3dad7edeb3c5b5067ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-report.ts:19 imports test/helpers/e2e-hosts.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"391326053214410eb3de50e178beb48ab38d943b14ef902f8e8d7e0b601e8dec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-rerun.ts:31 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-rerun.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"79935892b75894a4448ceba4cbcd99e08618a3a64df5618c5f12cb3498dd740b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-rerun.ts:32 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-rerun.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"82994d0bf4e8c4d90df866166f5c406d122e18ee0f3701afd009013bec3f25c6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-select.ts:9 imports test/helpers/paid-test-set.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"883d56b64c66dda501f1edcb91aec5ab2d4580d0ed194e2c8ec87a43b66aebc1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-select.ts:10 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1dd3a44839b3b6ac87f8044a4122b3dec96503b037ecc93e17b24e6068473e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-select.ts:11 imports test/helpers/eval-budgets.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd622e6fdf83edea23dd485479557912f89e8d3b4944a7e1e7f6b7688a8a487"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-select.ts:12 imports test/helpers/overlay-case-policy.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"caea15c9e6d725dfc663e79657e23091f5292199c36fe9249f50a82402b61def"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/lib/paid-select.ts:15 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d73e933fcbce9d261fc6c7bf0a7276cbaf38cc43846772e47f0b72ba4634d0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/pr-dependencies.ts:30 imports test/helpers/test-selection.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ada2400ad42f7d3f9a2e6379f0375ad6a3223719b108d02f953bef8dd10fed2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/pr-dependencies.ts:31 imports test/helpers/paid-test-set.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfd9c89d7fa2f3e045008bcc7d8c62540a78c239fc52cb98adb2ae1945dafe2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/preflight-agent-sdk.ts:24 imports test/helpers/sdk-system-prompt.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/preflight-agent-sdk.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d622d2e7bb706a5843f3eb32d4774a618a2b36e21aecdc0dd3b5186871acd2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ship-measure-sweep.ts:29 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ec118c3ff3207e60295244cce8f72d380502f1f9c762034cd3eb6b9d81cb52"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ship-measure-sweep.ts:30 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"76752b9f0de206543b1e6b93d1b598814a692bc31bbd906710679cc5a3ce5923"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ship-measure.ts:56 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8897b04ff4d7228ccfeb4a3b8c021a3ac206a746b62506823e0ca849039aae3a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ship-measure.ts:57 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"057ff2ce38552cec191ed0d16693df9e4fdcf12dfad8dc6bdf9c3f018ab99275"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/ship-measure.ts:58 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eb8b79f0d38230f908890d13754971e774d1668f5b86ccef77df28c484b812"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/size-ledger.ts:16 imports test/helpers/carve-guards.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/size-ledger.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b349c2a50e3917a33f92f728d08128dff60f2f96cea245ef8700a2fa56c0f4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/size-ledger.ts:17 imports test/helpers/parity-harness.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/size-ledger.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f167a02fc34327e18b2f79ecdfcbff2fbd24dbf0693bb8f85ffbe9817be65"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/size-ledger.ts:18 imports test/helpers/size-ledger.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/size-ledger.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f776d5bba8bfb02b51db946a1230b97df290f2ac31f8603f0ac2f3de8e8909f5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/skill-check.ts:9 imports test/helpers/skill-parser.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-check.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aab06d1f7ed3b3ab858e20a77046eab437ac4468ff4083ea5e77825f5ebf3ed"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-free-shards.ts:101 imports test/helpers/paid-test-set.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"62921e3a67fb596f2ab27ef6d9d28179d77aca5389ba5a2ddc401f62cf7f85a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-health-report.ts:26 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-health-report.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"62778b0127e002c11525ed31e552465177d4cb31fb8fbb1cf690dca1447230eb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-impact.ts:24 imports lib/test-impact/key.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-impact.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"89374e3eabc098d88f5f5cee5e411f1a227dbb0aabb2d6e0ce1b3969a8513e51"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-impact.ts:26 imports lib/test-impact/trace.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-impact.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dbb9c55a61401b96bfcb24a9400b8db44561e933dcab66f9b13aa7ce9a173d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:46 imports test/helpers/bootstrap-retention.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9dd8e07c788b97ad251f7f3ecf4187931286906b97197c3ca4ea90c7f9a9a9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:64 imports test/helpers/paid-test-set.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfe4aaee3ad787e435c0108a8574ddea4dc54fb110791c2710d91215ea51ca2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:65 imports test/helpers/periodic-exclude-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad690544bfe22a7e532cf0719c9c3e0d1774d1c5545c040e33334a449856171"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:66 imports test/helpers/eval-store.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c05161e286ae737dd522a105b3350ba43cd83b33997552965ab260123e07dc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:71 imports test/helpers/eval-budgets.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0d4c1a0aafcf7dd09ddc8955210ad473d49dbccd37938823c8fc6a873f4e23"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:72 imports test/helpers/session-ledger.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"609767a23df99c1d8590ec2a99863ae6914ab732ea6385a8641bb94605acbcd7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:73 imports test/helpers/anthropic-preflight.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"97408bb731856ba406f29a4a76e5a40de06c3d17a5782a55313d13e6cf195706"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:75 imports test/helpers/touchfiles.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9d07735c61b05a3ba2833f3904f116272801518edf9a1604c8c870e1697267"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-paid-shards.ts:76 imports test/helpers/e2e-hosts.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"03151163a308d093dcfb767ab2f260d98222dabdaef2c2694a50b2dffe576278"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-pr-profile.ts:4 imports test/helpers/touchfiles-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de3314a03e8cafab677ebde5a8f2f1e4a0ed3554664066c993e2c84581d4313"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-pr-profile.ts:5 imports test/helpers/test-selection.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0108e85ca44caa1b5f2c4c0900c698cd119431d5c3f591ccc33f1143d787c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-pr-profile.ts:6 imports test/helpers/paid-test-set.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1ca850a02ce21c533742447b6dac0aefd96c2c292e709d48c9d9b3e8da238f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: scripts/test-pr-profile.ts:7 imports test/helpers/free-fixtures-data.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"730ab0ee4a3b0b517b87fbcaf026125c85bbe8a8aaea0ff72d2c1e77f425e911"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWriteCommand (cyclomatic 321, cognitive 607): handleWriteCommand has cyclomatic complexity 321 and cognitive complexity 607; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"03433fb80121988b6b28b8357d9fa1ef8f536df206b2e8081dc64c9449f192f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasStructuredStaleFillFinding (cyclomatic 178, cognitive 285): hasStructuredStaleFillFinding has cyclomatic complexity 178 and cognitive complexity 285; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051cd3943452178a0ad76ffb78f5023d20b82660cfcb38b0fd250cc81ee2779"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMetaCommand (cyclomatic 173, cognitive 323): handleMetaCommand has cyclomatic complexity 173 and cognitive complexity 323; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad323599c049f636148ee81e1a10f24b1a0445866bd283d34d57c4e608f664e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPlanSkillQuestions (cyclomatic 165, cognitive 265): readPlanSkillQuestions has cyclomatic complexity 165 and cognitive complexity 265; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0742d69d50be9c57a1b41d07e919e6845a7915126bc5f537b462846f51204b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRunManifest (cyclomatic 136, cognitive 137): parseRunManifest has cyclomatic complexity 136 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6162ceb5a11163d432765e948f3aa9575a7d909921b5a181033465c498a47881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLabelled (cyclomatic 134, cognitive 160): parseLabelled has cyclomatic complexity 134 and cognitive complexity 160; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e2fc6a62aed21397a8d152ff09520aa26534a6bd1124fdd51321a9db510e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSkillTest (cyclomatic 124, cognitive 187): runSkillTest has cyclomatic complexity 124 and cognitive complexity 187; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/session-runner.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb3787cf668f8f304a1cff809d540ee7c06c49b148025ce019e826fcd790076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePlanReviewDecisionResponse (cyclomatic 120, cognitive 196): validatePlanReviewDecisionResponse has cyclomatic complexity 120 and cognitive complexity 196; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-review-decisions.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"185ec432e98ef7f2b779f4ecac6d27fcc4f2ea5d3d1e1d3936918f275f60c3f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPaidReport (cyclomatic 114, cognitive 166): runPaidReport has cyclomatic complexity 114 and cognitive complexity 166; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d28d7be27bca9dac17589b42e16da6750ffd1ca430e4474fcf0dccd330b51f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCallerEvidence (cyclomatic 114, cognitive 142): validateCallerEvidence has cyclomatic complexity 114 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6b8204cec895e57a119d36760c47ec2330d2920fba82bf547a99c99a4d4485"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSnapshot (cyclomatic 113, cognitive 209): handleSnapshot has cyclomatic complexity 113 and cognitive complexity 209; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37891611cf3575cba2e9918733b16684584cf4bb651742a01ee017280827679"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRepairBundle (cyclomatic 110, cognitive 85): validateRepairBundle has cyclomatic complexity 110 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b546b30aa60ec882f8e66dff43b9707cece26f4a445c76f043ad84960944483"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 102, cognitive 182): verify has cyclomatic complexity 102 and cognitive complexity 182; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5834ddd202f1b7b3d8a2f019b1a1148997dd538563b52cd234915497c2f3e469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordedBatchingIssue (cyclomatic 98, cognitive 96): recordedBatchingIssue has cyclomatic complexity 98 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eng-seeded-coverage.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f9a967239bb0327bf713283f2b481e1c657ecb9e70562bf16566427b3db8de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 95, cognitive 144): main has cyclomatic complexity 95 and cognitive complexity 144; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bea7fb0c8ad763f0d08bfd5dea744452fa1aab6f431856e1182a674f9f1f25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsAtomicSources (cyclomatic 95, cognitive 123): docsAtomicSources has cyclomatic complexity 95 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"92adede4b555136139010f4a11d236cf5a83817196be97307fbe9121f1eeb6b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engCacheWriterDecision (cyclomatic 95, cognitive 75): engCacheWriterDecision has cyclomatic complexity 95 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eng-cache-writer-decision.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9890d4c77120b21849dea44bfe302b8e8d1dd81e0fcc9a22663c721d6fe66c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoplanDualVoiceEvidence (cyclomatic 94, cognitive 149): autoplanDualVoiceEvidence has cyclomatic complexity 94 and cognitive complexity 149; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-dual-voice-evidence.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57db5859d5948dd0febf991247bcadf44ae8bb6fbbd529979986d367fc028fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateResult (cyclomatic 94, cognitive 106): validateResult has cyclomatic complexity 94 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4f697396987173ca45866696a0e03b02c868c631d98d411dd5321da61c4f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function land (cyclomatic 93, cognitive 142): land has cyclomatic complexity 93 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac8d3ee52bf786e22e0d46247f3120394778ba1afcdf769df5b560ee26f71eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function register (cyclomatic 92, cognitive 115): register has cyclomatic complexity 92 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c2f40c73781a3715af0e6b89ae4e0b7e4790b0f3e11733182d7192b0fbca99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function version (cyclomatic 91, cognitive 97): version has cyclomatic complexity 91 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bee59a339f5798889ffb47dac6eaff5744cb12c564c0fb069b00105508da90d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPlanCountTranscript (cyclomatic 90, cognitive 178): readPlanCountTranscript has cyclomatic complexity 90 and cognitive complexity 178; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-public-transcript.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1b04b5a64522fefbdb0322c32db1e6dfa0d1d1810732a72a31fc6622091b5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateQACheckpoints (cyclomatic 90, cognitive 124): validateQACheckpoints has cyclomatic complexity 90 and cognitive complexity 124; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-checkpoint-evidence.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7399e8aeb835d046043060b4bf7adf8ae3827f7ccd2c56e4ca0fc3b52ea52808"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleReadCommand (cyclomatic 89, cognitive 137): handleReadCommand has cyclomatic complexity 89 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e6abf03a9f64239ff7747e23efc2e57c2ca56eb4437d08cd79d3152ee3e49d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRuntimeCatalog (cyclomatic 89, cognitive 92): validateRuntimeCatalog has cyclomatic complexity 89 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/runtime-catalog.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c311536c67fe6cdc2fa5e2bfd7af2e618ace1b1a623ae1ed9e8f5ae0b64a0fdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanBash32CaseInSubstitution (cyclomatic 88, cognitive 143): scanBash32CaseInSubstitution has cyclomatic complexity 88 and cognitive complexity 143; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bash32-case-scan.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd9a21e79cb96b39ff282389cb7b17bddd2283870e12c7a66bd02d0c17c6152"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySliceResults (cyclomatic 86, cognitive 148): verifySliceResults has cyclomatic complexity 86 and cognitive complexity 148; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"96153797c30643ec6ff7aaf1fcd613948229b4860960168037bb6b839e237839"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engLibraryHooksFinding (cyclomatic 86, cognitive 79): engLibraryHooksFinding has cyclomatic complexity 86 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce8e5bd97ae4a4ae27ca67eb51f8244060d3083b633595fc123829e5900ce7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCapturedEvents (cyclomatic 86, cognitive 58): readCapturedEvents has cyclomatic complexity 86 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c4e1e7596842426945022aab0075037f9630ed17287dc5a7274a560c9ab050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertQaBrowserDeadline (cyclomatic 85, cognitive 98): assertQaBrowserDeadline has cyclomatic complexity 85 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-browser-deadline-evidence.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0d8a6665730f677ee8066e688030f18909488c8b553bad4ad8366d6f2d02c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyRun (cyclomatic 84, cognitive 110): verifyRun has cyclomatic complexity 84 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/run-evidence.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dff045453d734d61ace770d633c1ebcf975dcc1df8f045dc8377518ee51a69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePolicy (cyclomatic 83, cognitive 101): validatePolicy has cyclomatic complexity 83 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":"lib/ship-policy.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c59a68c303ed11d3c53f915402d7542bd8031841e2bd095eb3abd2850f8f00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function route (cyclomatic 79, cognitive 103): route has cyclomatic complexity 79 and cognitive complexity 103; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e10fc0ed21fa982377d803eee0859404fc09223097c20107f54d6e31a26ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPaidShard (cyclomatic 79, cognitive 86): runPaidShard has cyclomatic complexity 79 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9737bb8159a76293b4c119ec533e874219722b58d6b23909e1c774530f67c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializePreparedExport (cyclomatic 79, cognitive 83): materializePreparedExport has cyclomatic complexity 79 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c517f365a2eaa8ffcd847b590382c1800740d872e076dfa53ce3d9a42ff440fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 79, cognitive 58): (anonymous) has cyclomatic complexity 79 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd507fc4347846acdb0daef502ed6c16562b249bbe08925e9110d9559a1996f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createContainer (cyclomatic 78, cognitive 69): createContainer has cyclomatic complexity 78 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6892d0292f6352c461ac559eabb0a490f176c8e69cad787c6529dde05092f58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 77, cognitive 130): main has cyclomatic complexity 77 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f63edf358fc5d4742737e12db6b2068c2c22fac0506023c4af4f424a9e148a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateConfig (cyclomatic 77, cognitive 128): validateConfig has cyclomatic complexity 77 and cognitive complexity 128; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e140067fb0047910c52c8132291ed940b04233c73cbe93bd0bbbce05895a33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectLanes (cyclomatic 77, cognitive 126): selectLanes has cyclomatic complexity 77 and cognitive complexity 126; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d30d7b6fde84c454f62b3cf8f5bef95652149ca2be93c78aed9ec5fcdc7b35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStrace (cyclomatic 77, cognitive 114): parseStrace has cyclomatic complexity 77 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-impact/trace.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fc0e3aacdef9c7ede80548b7be3a98f2c008e97e470a4d51f0cfc3e69051f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRelease (cyclomatic 75, cognitive 91): planRelease has cyclomatic complexity 75 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f164c696f076fd8c9711cefed38270ee13a3a4cdc91eb1ab5727d9b5c831b4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeReviewLoop (cyclomatic 74, cognitive 111): summarizeReviewLoop has cyclomatic complexity 74 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-scope.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c3949c097e66c968490568c109fe3c721296a043e1cb0325b225a33286cad8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyRepair (cyclomatic 74, cognitive 84): verifyRepair has cyclomatic complexity 74 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27a1e3a510f1fa50d2bafc3944103f7246b2893ba59717267ad4aac77a5fe61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 73, cognitive 122): capture has cyclomatic complexity 73 and cognitive complexity 122; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc744506d92de72f031b18068f5d6e29e8f05bb6c2a81e65690c3d8fb27dba1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planReview (cyclomatic 72, cognitive 107): planReview has cyclomatic complexity 72 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee462378a757adf0b9e47a6c60631fe743019c82622ce3ba8482835931d7212"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glThin (cyclomatic 70, cognitive 135): glThin has cyclomatic complexity 70 and cognitive complexity 135; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbb47e9bb7c05692d7a5c2467e2fe5635c9b2ebd46e77c72ddd7933579f6254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 70, cognitive 85): (anonymous) has cyclomatic complexity 70 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-observer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"137bc4af909acd6d0b29050eaaae7eae2d85661aea8bc3dfc33c49c010daf7d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeOutsideExecutions (cyclomatic 69, cognitive 154): claudeOutsideExecutions has cyclomatic complexity 69 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":"test/helpers/outside-voice-evidence.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb412e7eba906e855228b7d61a3983d86090bf55e4ad9194935e14519811f45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFields (cyclomatic 69, cognitive 121): parseFields has cyclomatic complexity 69 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa61ae21890002798687f0a2274208011cc070589b34c1ff56e86ae14b3e135"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanRunLeases (cyclomatic 68, cognitive 159): scanRunLeases has cyclomatic complexity 68 and cognitive complexity 159; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80a7c6573027d93cf9b7f4f36a6338afe718b58d6408719bfa51d20597f8700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectsFile (cyclomatic 68, cognitive 130): inspectsFile has cyclomatic complexity 68 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8432f8ff556e4f01098a15782c62046e3a823b26fc4f6ba5907613779207deee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCookiePickerRoute (cyclomatic 68, cognitive 86): handleCookiePickerRoute has cyclomatic complexity 68 and cognitive complexity 86; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"34046043013903a28497764679f400781036110b402ff7e2d44d6a2e636cee22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGeneration (cyclomatic 67, cognitive 131): runGeneration has cyclomatic complexity 67 and cognitive complexity 131; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc7c48693d220f838e2836ba235d83c6cf5da7ddafac81dd6f03cfbd525b8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stagePieces (cyclomatic 67, cognitive 78): stagePieces has cyclomatic complexity 67 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1b6451bf1af855893b7854f219cf0b5ab1efd3d832c6d6c743ebee779d0ce7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function landDirect (cyclomatic 67, cognitive 76): landDirect has cyclomatic complexity 67 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land-direct.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c774ad2b1ae1387e601e0ab18d7b06a4912a73a85a50e236f736692782267edd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answerGate (cyclomatic 67, cognitive 69): answerGate has cyclomatic complexity 67 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e20e3a34ccf025fdd5b2ffa8277af06cf0a4ecab669f5282201792e5ba3c6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProfileErrors (cyclomatic 66, cognitive 119): runProfileErrors has cyclomatic complexity 66 and cognitive complexity 119; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/run-evidence.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fad385c377a2bdb05f01a2c2583f3f1ab9454a9621e7a1ef8d3d40532c8a32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaProbeClassification (cyclomatic 66, cognitive 66): qaProbeClassification has cyclomatic complexity 66 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-evidence.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16e722871aa87b505183e226fb92c7e1b6b3c267262b463d25c3ff9467d3933"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findReusableGate (cyclomatic 65, cognitive 89): findReusableGate has cyclomatic complexity 65 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"28941d1b18c72c9d681982a668a47e94355a92312e7c1478abb7fbf514fcdf7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaFunctionalVerdict (cyclomatic 65, cognitive 84): qaFunctionalVerdict has cyclomatic complexity 65 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-evidence.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdcccdcd64f64609f902dc8e63d6e4edfa6e32b173f9cc2209f08dadffc1f24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twReadSurface (cyclomatic 65, cognitive 82): twReadSurface has cyclomatic complexity 65 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8fa28ca7c352fc9b18d8fccdc7c3baf9ed85d98129a98af1fe1c03d3fd2161"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function literalDocsCommandAllowed (cyclomatic 65, cognitive 70): literalDocsCommandAllowed has cyclomatic complexity 65 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d2713e2dbd47698771d43bbf5f01f3301be871213dd0f0a640d2b4a1cf57b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviseRun (cyclomatic 65, cognitive 68): reviseRun has cyclomatic complexity 65 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-revise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"46657af23b5e3502d2a6057159145fc8b747d02624da9dad77ae274e88719cd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordAutoplanArtifact (cyclomatic 65, cognitive 67): recordAutoplanArtifact has cyclomatic complexity 65 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-recorder.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9653db0eaea760cecbb540a9d8291db4abb31b85067d7f265a81995dd8edff5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzePassRates (cyclomatic 65, cognitive 59): analyzePassRates has cyclomatic complexity 65 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b075f0c2290ebdf6f4b01f8f81159904d2bbe6852f54dabc2e5c5e99eabd84f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateClaudeCodeSkills (cyclomatic 64, cognitive 106): migrateClaudeCodeSkills has cyclomatic complexity 64 and cognitive complexity 106; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"979eda5b3b3efd4c22500e6d6a25f81b169b9e7b811624d00f583c00ab8efa84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearDecision (cyclomatic 64, cognitive 102): clearDecision has cyclomatic complexity 64 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"507c73d445bfe936270de1e24c560117d9774bc07e3cdd9d858751b35df2ed75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ready (cyclomatic 64, cognitive 73): ready has cyclomatic complexity 64 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7372e39e0c48d26060333cb07e0fa5ec682cec48e7123a264bde14dd4fca065"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settleOwnedBrowser (cyclomatic 63, cognitive 83): settleOwnedBrowser has cyclomatic complexity 63 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-only-cleanup.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb769fec42bb1b44bcab774a969878a1ba6a95caeb8b129e5af1f818a4924fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 62, cognitive 101): (anonymous) has cyclomatic complexity 62 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":"test/helpers/docsync-fault-actor.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ac385056cab486dabc5b776114e4d7ec54651f1e8308dff7fdbb590e7dbf0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectElement (cyclomatic 61, cognitive 115): inspectElement has cyclomatic complexity 61 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"79edb2dd34d4c628b0d28a5f99265d2c9f6e2a0e0b691578caaa35e868e863c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCommandInternalImpl (cyclomatic 61, cognitive 89): handleCommandInternalImpl has cyclomatic complexity 61 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"529e529ab79888a9e0a8d7992af6bba1a9db0153d12292e706e4b4e91bb14a09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function certify (cyclomatic 61, cognitive 51): certify has cyclomatic complexity 61 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fc198d75cf507c44a1490760af2337dc540851798142341486d5359a603c70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasNativePlanTerminal (cyclomatic 61, cognitive 47): hasNativePlanTerminal has cyclomatic complexity 61 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6161b1968e7f979d7e83c64945b90f47ffcbe2fababf65cf79610e5c31172"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planCountPrerequisitePick (cyclomatic 61, cognitive 42): planCountPrerequisitePick has cyclomatic complexity 61 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"630f62fbbb59664d353bf491ca5a924ef049165ae2682f63d9a885dccde03517"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assess (cyclomatic 59, cognitive 70): assess has cyclomatic complexity 59 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e67ad5e7834f8f6e1aee41a4fe0c7748bfb449c675d1669e861db62a4cd9436"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextCeoPostureContinuation (cyclomatic 59, cognitive 70): nextCeoPostureContinuation has cyclomatic complexity 59 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"9666fb26aa17fe6117a4d609633e0049ff3fa13c00f97dd54de04f6488b597ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasTrustedSharedLibsCheck (cyclomatic 58, cognitive 45): hasTrustedSharedLibsCheck has cyclomatic complexity 58 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"970abd8b340a1df4fa043e0914334afa1e9010b438f21a0e3f6d3b3a7c361545"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCompletedDxHandoff (cyclomatic 57, cognitive 50): isCompletedDxHandoff has cyclomatic complexity 57 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"79da3126edea9aa36f459d9dfd63a8ad7c163e70c156138a19892aab4316ff8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testExecutionSummary (cyclomatic 57, cognitive 37): testExecutionSummary has cyclomatic complexity 57 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bc335416bbad85520d630549a2bed34fb1027ba2a60dd15fd162874ab8de89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 56, cognitive 79): main has cyclomatic complexity 56 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"523f086021d6fc27d5e24abaf33a7deae5fa8b56921fedf4642109f976e4efac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 56, cognitive 70): classify has cyclomatic complexity 56 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/version-gate-train.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab36144e08fac7ed251282ab844414b833d510102fae13232dbfa427f7470989"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordFilePermission (cyclomatic 56, cognitive 70): recordFilePermission has cyclomatic complexity 56 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2995cd6e0a8a988d04178674e580e68a9c603d0bd88c4dd264d7d59917b363e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReceipt (cyclomatic 56, cognitive 65): buildReceipt has cyclomatic complexity 56 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"229241b8d0163254e5e974874c16b7497ea529aafc6f7a10f3d84e49ab6d8873"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 56, cognitive 64): (anonymous) has cyclomatic complexity 56 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ios-stub-state-server.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98eb9ec083243d8896e096592695e608269b17964c01589c7b92a15649d34d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixtureRemovalEvidence (cyclomatic 56, cognitive 54): fixtureRemovalEvidence has cyclomatic complexity 56 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed605356c80c65c2c56a050c7368014cf2114160d4f3fa16b862a23af0dba783"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearByRuns (cyclomatic 55, cognitive 77): clearByRuns has cyclomatic complexity 55 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"924e3ee0fc11a57a46dc4c897bd195997a8e5ade375cd1af29d5c219e7c60cd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectPrProfile (cyclomatic 55, cognitive 66): selectPrProfile has cyclomatic complexity 55 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8d3c0729aacd71c82b0798ce6fcb6215cbacfaed4d0c5c93cae4bb30974623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCookieImport (cyclomatic 55, cognitive 56): runCookieImport has cyclomatic complexity 55 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-operation.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea43b5af44720000402f47c08a6adae60840d4b721bf8f9bfe258fed022c19a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGate (cyclomatic 55, cognitive 56): runGate has cyclomatic complexity 55 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fa9c1d0c4e6a848dacaae62557c33b97fb1ecfefec879f993117c6d8f4f4d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanWords (cyclomatic 54, cognitive 84): scanWords has cyclomatic complexity 54 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab13a17f99817b81ab92a80cbe6900ab3197d0c813ce92d03e560e3b88be4e28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function previewQuestionOptions (cyclomatic 54, cognitive 81): previewQuestionOptions has cyclomatic complexity 54 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5391f9adb4291d2cd7999614a003cd8fc59db559a13a3cc12671a90da9f5c595"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishStages (cyclomatic 54, cognitive 80): finishStages has cyclomatic complexity 54 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bdcd153c55af78d2ced216f29cba0c79daff9797d8668d4d587d6199502a38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipSkipFailures (cyclomatic 54, cognitive 68): shipSkipFailures has cyclomatic complexity 54 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-skip-actor.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6461477caa304548cdd42406055bb2445fd38534282520d6ed5590ae91c6b9b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeSeededPlanSelection (cyclomatic 54, cognitive 66): nativeSeededPlanSelection has cyclomatic complexity 54 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-scope-selection.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2366fbc5190d8cb72fc5c24f87b94c468d439a7382d38e19e44fb5e9d1c0536e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquire (cyclomatic 54, cognitive 65): acquire has cyclomatic complexity 54 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b782738097b4463947a28cbe8ee6ca686bb0476d715d643169ceeda59b63d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindReview (cyclomatic 54, cognitive 63): bindReview has cyclomatic complexity 54 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"156c562c640d31f41084a026a9e63c32ce452a6c889b27bac2370bb5321b7b68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentFilePermissionEpoch (cyclomatic 53, cognitive 35): currentFilePermissionEpoch has cyclomatic complexity 53 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8e648529fe4b14f48cfb0fa5514b11fb9b483ef142f24d0d0a993bcdeb0f2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatComparison (cyclomatic 52, cognitive 85): formatComparison has cyclomatic complexity 52 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac8b3d7947c183b979b8aade0b55d893e342c89df37b19aa764162be8ea59e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainReady (cyclomatic 52, cognitive 66): trainReady has cyclomatic complexity 52 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae08c932b27765ed40006790164d3b934b506fc5fa211b2103d1be1a61ec2e85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelected (cyclomatic 52, cognitive 65): runSelected has cyclomatic complexity 52 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b238008acb81b888ab5ed3a5013da54d722d4adba9d811c4be3c942fb918b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 51, cognitive 100): send has cyclomatic complexity 51 and cognitive complexity 100; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-floor-permission.test.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cef2115dd0f81d98378ac9e594061119fda1245e56b482e29c03be2f0d5b0a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertLegacy (cyclomatic 51, cognitive 87): convertLegacy has cyclomatic complexity 51 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eb833af7525bdd1b2491b475a90587ca74e574610949e849f1c1f30609fe5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glLayout (cyclomatic 51, cognitive 77): glLayout has cyclomatic complexity 51 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34eacf4a0b334c36cabf9884b3549fd11ebc25c762ae14c6d547146c9929402"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkDocsResult (cyclomatic 51, cognitive 69): checkDocsResult has cyclomatic complexity 51 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-docs-result.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3136ed963fa4c7803449d7316f301d5c2f85f51ab6e201402f42ba171a8d01a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditAutoplanMethodReads (cyclomatic 51, cognitive 68): auditAutoplanMethodReads has cyclomatic complexity 51 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-method-read-audit.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f46424820b381145c4c6f6e5ff0688eba1774375b003d82794e13999e98bd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assessFreshness (cyclomatic 51, cognitive 67): assessFreshness has cyclomatic complexity 51 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-freshness.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab47c7cf6a13b49e61703be92abca4e31166d472d1625d66c1a660a23e8b3e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRunFailures (cyclomatic 51, cognitive 53): readRunFailures has cyclomatic complexity 51 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2ac8bf4affe2a57587180f91f8094959bcca0df8c81021b6b1ac980b2662ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 50, cognitive 92): main has cyclomatic complexity 50 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f37a1998f87a4bbaae821def66579d49d6c0b9e218ae02732742194468034f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsActorVerdict (cyclomatic 50, cognitive 73): docsActorVerdict has cyclomatic complexity 50 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-fault-eval.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7fd119d36c6cf8a4387d9a10f6365885253a4fa501cca61696b62782a4d69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modulesMain (cyclomatic 50, cognitive 70): modulesMain has cyclomatic complexity 50 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-cli.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e545d06016c701b6acdde57836670d34e8df0c3036214a0525ea0d888d9437"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdStart (cyclomatic 50, cognitive 44): cmdStart has cyclomatic complexity 50 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8408a9bb26f9d970589785a3fb60b60c59b39bdb91b4a7541994ab1f74607f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function junitCensus (cyclomatic 49, cognitive 128): junitCensus has cyclomatic complexity 49 and cognitive complexity 128; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddfeb6b341150b8706e9210f7119ec60f43b4fbe5749420d5a773ec9d703eb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSarif (cyclomatic 49, cognitive 105): parseSarif has cyclomatic complexity 49 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a561e0dfeda3d770ffaa4cfddef41d5532cced7004c3431396cbf2160b7e621b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseResults (cyclomatic 49, cognitive 89): parseResults has cyclomatic complexity 49 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd832ef4468ad530d80d385650bd822fa1ea3488cf37cfc3182efbe71d3d37a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFlaky (cyclomatic 49, cognitive 65): runFlaky has cyclomatic complexity 49 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"58118d7f60262c534cfc0b195ae3a8c68889a413acbc8ed5e4cb56275c7734f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glHeroSpace (cyclomatic 49, cognitive 64): glHeroSpace has cyclomatic complexity 49 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"12afaf043ab32875747918e89c2b0d0ddc88d2291c8eedb2ee7f6bf36b955b6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandRejection (cyclomatic 49, cognitive 64): commandRejection has cyclomatic complexity 49 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/read-only-commands.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b419ae2b0aa3b118b19091ec50e52a657f5254e825a631783db0bffa3b62c4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 48, cognitive 109): run has cyclomatic complexity 48 and cognitive complexity 109; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/copy.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee0ccbe74f1b65267b001118dbde849ceb2eb9a8304bff7a473925e09b79c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelsMain (cyclomatic 48, cognitive 66): modelsMain has cyclomatic complexity 48 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-cli.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11a1a8857757219e5bf87256e3bf26d21b11cad0cfff3f36f59f94910eab46b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficeHoursReview (cyclomatic 48, cognitive 58): validateOfficeHoursReview has cyclomatic complexity 48 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ebe513337eec04a986d6ace083cf36da2cd699c7ecd6fd405203a25fae9e1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEntry (cyclomatic 48, cognitive 55): validateEntry has cyclomatic complexity 48 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inventory.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c702269059b70e1ec7d44d6878c6d4191a71627c049971ec95dcc9a1bb9db80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 48, cognitive 42): read has cyclomatic complexity 48 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-seed-submission.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"76add6306d6904a44c68996dfb9e5f01654348054aa7858c6519c9ade4b895dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventFromInput (cyclomatic 48, cognitive 41): eventFromInput has cyclomatic complexity 48 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d41b906915cf92212d567768fe6a30c4d80327cb60333f8b3c83e54177c6327"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 47, cognitive 70): tokenize has cyclomatic complexity 47 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/read-only-commands.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"befa8360c017377c290da2c6b653557e00ff2f682c460afc3e16212a3add15e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficeHoursReviewArtifacts (cyclomatic 47, cognitive 65): validateOfficeHoursReviewArtifacts has cyclomatic complexity 47 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/office-hours-completion.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7234649899d0abf167b3a1aada9ddb1475e6a29b4aadcd59fd45868785a4af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRunManifest (cyclomatic 47, cognitive 62): buildRunManifest has cyclomatic complexity 47 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff0f287c26e4129572aff1d78d121d21bb3e68236cb724b5a692ce6ede236c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoveryJson (cyclomatic 47, cognitive 57): recoveryJson has cyclomatic complexity 47 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"20800bea2221f28ff566a123ab71d7cef5df94fe8e5e08ea765c24f35aea3714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initRun (cyclomatic 47, cognitive 55): initRun has cyclomatic complexity 47 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c87da993bfb0ccf91a47376e420ad0c938d90dd37c0e20aa9d41cbb2d09883"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitResult (cyclomatic 47, cognitive 50): submitResult has cyclomatic complexity 47 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa827baf072c2538d08d41438b1374fdc4135e164ab98a16d54c10e08e4ac212"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assess (cyclomatic 47, cognitive 44): assess has cyclomatic complexity 47 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-carry.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffbfaa9109709338ed576bc0c665bd9582abadd232644f28dc9695586b3a54a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectPython (cyclomatic 46, cognitive 111): inspectPython has cyclomatic complexity 46 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4840b54d4bac8f25525230a07e4b9e15448a5244cc128f755200959388360939"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateCommentary (cyclomatic 46, cognitive 104): generateCommentary has cyclomatic complexity 46 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b333fbbf4253a75c2ca9c49baf9989e9684e7b477c3b35c5631423dd44ece5f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAgentSdkTest (cyclomatic 46, cognitive 93): runAgentSdkTest has cyclomatic complexity 46 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/agent-sdk-runner.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0450f8080ba28fc26f7bd77ca8b68d7ad63cd30fc55afb0d024c113fbdf96153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCarry (cyclomatic 46, cognitive 68): findCarry has cyclomatic complexity 46 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-carry.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0354d48f58c7adbb9f8e38f789959593d7c8d9e51af291f3ccba412de9a15a35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchRisk (cyclomatic 46, cognitive 66): matchRisk has cyclomatic complexity 46 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-risk.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3abf0e38b252927f930a01d3327125c760606ea06222110d67e7b3aa4435772"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 46, cognitive 65): parseArgs has cyclomatic complexity 46 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb882df523ede7a34fd74ab6324cb687b5c62e768f4a4ec7b2cec26f9fb8e7c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildContext (cyclomatic 46, cognitive 52): buildContext has cyclomatic complexity 46 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/context.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4393479f6f9025c3c635b181ed35caff31b6bb72222985f54301e7d84881bb63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportItem (cyclomatic 46, cognitive 49): reportItem has cyclomatic complexity 46 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/component.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"475daa82f7ddef561f92f321379aece0570d2b4d54804b9cbb79e66039115403"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFreeShard (cyclomatic 46, cognitive 48): runFreeShard has cyclomatic complexity 46 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8d814a4df29d2c46adc757fc59f1d86bdd836c4041763b358a477c950b4911"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeTargets (cyclomatic 45, cognitive 71): writeTargets has cyclomatic complexity 45 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shell-writes.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe356df45466b19be3e580e24b7f864f3b3940290848e5fe3a8b2b8e58c80bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 45, cognitive 61): (anonymous) has cyclomatic complexity 45 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad0fe334043a0defce911fe4327dc06823d262cf08aa87930cf115d8202710c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureServer (cyclomatic 45, cognitive 57): ensureServer has cyclomatic complexity 45 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"927bde609eb22add7361f4a17e5a48602ac88653a3a4c7fa4964bf55e25550d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 45, cognitive 50): capture has cyclomatic complexity 45 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"009e0ff01fe310a4b966da05fa5640ff3334693e2a1bf9df6f38b5ee14a43581"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativePermissionKey (cyclomatic 45, cognitive 47): nativePermissionKey has cyclomatic complexity 45 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b299cb615adad3f65087760531dd2c0269eee317ea6e52ac5a102f16164e1fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaEvidenceCommand (cyclomatic 45, cognitive 41): qaEvidenceCommand has cyclomatic complexity 45 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-evidence-producer.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad23f9499c5efa2d2e0f63396381533cce1f6625046abcbf3568be9a9e6edc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 79): (anonymous) has cyclomatic complexity 44 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-exploratory-callers.test.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"8718985d04c8192e2a57387a550622a9a55970a90fe8f43edcee38b5b4c7428b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 44, cognitive 75): start has cyclomatic complexity 44 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cd62ee7e2aecbe835b523426f0e97142852eb833e3498211ba8936fec417d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordEvents (cyclomatic 44, cognitive 72): recordEvents has cyclomatic complexity 44 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ad41c488699e677524155ed143b4d370efb20ffc9edeab4063b6f2268c431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildManifest (cyclomatic 44, cognitive 62): buildManifest has cyclomatic complexity 44 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c6c69ae1cb9a8ca0e94b1ceb19a903536f9770b265ff8d0bd9511deb823efd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeCalls (cyclomatic 44, cognitive 62): nativeCalls has cyclomatic complexity 44 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-checkpoint-evidence.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a51ac4356927729ad2ac89b850afe8a9f2157190c376c6e9346737b5200be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importAutoplan (cyclomatic 44, cognitive 61): importAutoplan has cyclomatic complexity 44 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5dbee1e9bf071ad4cb915c883eaa725bdb1da7b04304c5b55a789785907b9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeDispatch (cyclomatic 44, cognitive 60): routeDispatch has cyclomatic complexity 44 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c22043986ffe7679de858203ed6afd01a0558c0d4bda3634b93cc92aae30666"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFile (cyclomatic 44, cognitive 56): classifyFile has cyclomatic complexity 44 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bf84abf48aff9f1f972049afaa402e84fbf851d338cf4322aede0c63712ddf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOwnedClaudePublicTranscript (cyclomatic 44, cognitive 51): readOwnedClaudePublicTranscript has cyclomatic complexity 44 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-owned-journal.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0361ebf862c4d1dceffd69ad19107b801e5528f4108a7b1f865afdf3f1b5e55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeScanner (cyclomatic 44, cognitive 50): executeScanner has cyclomatic complexity 44 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55ca10a0c9b9b590607de1fd11d5031fffb1014fa5aeff2239a8007efdaa9f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reserveNativePermissionGrant (cyclomatic 44, cognitive 38): reserveNativePermissionGrant has cyclomatic complexity 44 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c1f5f1b5df663f34185d7f38eb5b231c4c83e7644156ea2711ac01978733de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateQualifiedScanner (cyclomatic 44, cognitive 27): validateQualifiedScanner has cyclomatic complexity 44 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-catalog.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f2b0b9f170b6e8299056111f54b545de066e83011ce447a76707a71f56a860"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanInternal (cyclomatic 43, cognitive 73): scanInternal has cyclomatic complexity 43 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f537c57e10eb34d3576e273820c134e76bd4b763e9bf232e3eace369c865d19a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glOcclusion (cyclomatic 43, cognitive 68): glOcclusion has cyclomatic complexity 43 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aecc44c323f4193abee8830abfc3e9cb246ff2e3bdcb2a29929f083cd1a42c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeClaudeStreamLine (cyclomatic 43, cognitive 62): consumeClaudeStreamLine has cyclomatic complexity 43 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude-stream.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cea6d191aa000b7fc8f20952b931deececb6e3c176765d55b001ad0ad07489"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check67 (cyclomatic 43, cognitive 58): check67 has cyclomatic complexity 43 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"13391b41692c0e12d6ea11ecca0848930b8b830ea7748aa6ff6a31ff9bef47b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli (cyclomatic 43, cognitive 51): cli has cyclomatic complexity 43 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4690ae53f937617b58ee858adce9ab28aeb928d9e2106cbe5425bba958bde25e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureSectionReads (cyclomatic 43, cognitive 50): captureSectionReads has cyclomatic complexity 43 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-sdk-capture.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8614b168ff1c3a05aa9d560c3eeca83945d8776989d536c1d672cb475f2878"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProducerCell (cyclomatic 43, cognitive 47): runProducerCell has cyclomatic complexity 43 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"87656f9ee3367edd824c0982352840752b7ff30557d223013542974adcf7f8fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function batchingIssueNumber (cyclomatic 43, cognitive 44): batchingIssueNumber has cyclomatic complexity 43 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eng-seeded-coverage.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab419737096c872c0ad6c2d213c1e8e967877504590d1489e7d0d51c32deaa6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eyebrowHit (cyclomatic 43, cognitive 41): eyebrowHit has cyclomatic complexity 43 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome-eyebrow.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5afbcf8507ca0c1d03d881d4f1e8a577ef98782f25ae93924d4d6bf234adc23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trialRecordProblems (cyclomatic 43, cognitive 37): trialRecordProblems has cyclomatic complexity 43 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddbaabf00664a6daacf54753488e8295c25bbfbaa0a56ea0bf31464952f940d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 43, cognitive 25): read has cyclomatic complexity 43 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/outside-voice-receipt.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"402b3c6af0999c676bae88ab8ae1e60fd5210f5702c7bf5dacd5ecf4ca817ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGate (cyclomatic 42, cognitive 81): buildGate has cyclomatic complexity 42 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa4617da41faf25a51ce19b76f146ee2d572b9c8eb0fcecb26cdb27e4df1f97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function landUpdate (cyclomatic 42, cognitive 70): landUpdate has cyclomatic complexity 42 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6173815d779860aa947bad937eb9f3c1612e5664782d2215854e63ed7c60c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admitSlots (cyclomatic 42, cognitive 70): admitSlots has cyclomatic complexity 42 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c777dfa5c685bee06e0e7b968baf0068db3cd8f45bfa25c80563a789dc803c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficeHoursReviewerHandoffs (cyclomatic 42, cognitive 70): validateOfficeHoursReviewerHandoffs has cyclomatic complexity 42 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/office-hours-completion.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f422087f38b594c97bfb5de8543f5f2e514a9a8775772b38df67f992b03078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownedCausalOrder (cyclomatic 42, cognitive 67): ownedCausalOrder has cyclomatic complexity 42 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66901db4c711abd9cf3810c84d7394fef4a5bb1e8f0f5e1b3b8ae841ccec550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLoadouts (cyclomatic 42, cognitive 67): validateLoadouts has cyclomatic complexity 42 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0442ce81800350f679545b726fbb036165a7e00c235c6e5492abc3f081c0ec9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 42, cognitive 64): (anonymous) has cyclomatic complexity 42 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8517977bef205eca2ab48f40def27ed8dc8341e7f13fbf929371227a92457"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverAtomicNoReplaceJson (cyclomatic 42, cognitive 62): recoverAtomicNoReplaceJson has cyclomatic complexity 42 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd6cc763242cbd164e86b278620f3393b01e8b7b08a8c256c501a849112f617"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTrainNotes (cyclomatic 42, cognitive 61): readTrainNotes has cyclomatic complexity 42 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2894f9a619b26f8db1a9dbdb496ce2ef313a1d323910dabb7473690302cb976e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function priceGate (cyclomatic 42, cognitive 59): priceGate has cyclomatic complexity 42 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd129cf3828e8b6ce8d32e043e410c04e4d5ad24c8cd7e01ee0a4787834e95de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredModeDecision (cyclomatic 42, cognitive 57): structuredModeDecision has cyclomatic complexity 42 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c09dc29116df2bd506771079803e6e86f1e07d4f121ec16cf66e6ce0e4fa2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPost (cyclomatic 42, cognitive 53): runPost has cyclomatic complexity 42 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3de0ebab7dc557b8c49729c86fee685db848ea0a704b77defc294dc087860"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restamp (cyclomatic 42, cognitive 50): restamp has cyclomatic complexity 42 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba42544ae29c1f5e37b640e567884e085195e2312c41d31705638195010bfeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCaptainBrief (cyclomatic 42, cognitive 48): renderCaptainBrief has cyclomatic complexity 42 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/captain-brief.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c617175d52239ce8b50239f3ce118c14c00e8dcd5b3d1106654a0d2ddf942d3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function panelVerdict (cyclomatic 42, cognitive 33): panelVerdict has cyclomatic complexity 42 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d817001d76e83fa705b7b5336dfa2ffb9ca014f2ae43bda01f96714342bd6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engNumberedFindingAUQ (cyclomatic 42, cognitive 31): engNumberedFindingAUQ has cyclomatic complexity 42 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a248950eae88bb40a85de0aae797eede9da20ebd069c50150c23a970796c2d23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 41, cognitive 84): tokenize has cyclomatic complexity 41 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shell-writes.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4e9497b658f4dcc6da8dbefcae5ba2a03d0a2d627feb9fd57b40b7c8e3a06e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalStartPlan (cyclomatic 41, cognitive 82): canonicalStartPlan has cyclomatic complexity 41 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8d5dae6cf302373130a901e2fe9c0131c3e8db2c8a626479bfc57f5c5686db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 82): (anonymous) has cyclomatic complexity 41 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-count-fixture.test.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"81060aad70d9473b26f2b6a7014cce49afe84205a980b266bf05665ba838b543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainStatus (cyclomatic 41, cognitive 79): trainStatus has cyclomatic complexity 41 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34cc55da4b8e0f4efe77b8dc92631ee113da491217e35a3b00344b66fadb4c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRuns (cyclomatic 41, cognitive 72): planRuns has cyclomatic complexity 41 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8400aae7b219b80c9d39052477e5e0de1bf2aae3b9e2d6a777633942a69f3490"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 41, cognitive 65): observe has cyclomatic complexity 41 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/session-ledger.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23c129ae381533feeb6dcdea35d98b0fff9deff61718364274da1a00d0173e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsScan (cyclomatic 41, cognitive 63): jsScan has cyclomatic complexity 41 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"099800f009fbe385ec214a83f196dd9c8e1a64e67751bbe64c657464bbb1e8ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function slugFromEnvironment (cyclomatic 41, cognitive 59): slugFromEnvironment has cyclomatic complexity 41 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a2f499f29931c90c20e83bb7054762e8abf1a3f164d4fd233dd48ea67930e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractUserChoices (cyclomatic 41, cognitive 56): extractUserChoices has cyclomatic complexity 41 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c432da4ba5b16b33979dc6fe3e72aece3b129eff5ee6c857812c97de53a6494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainMain (cyclomatic 41, cognitive 55): trainMain has cyclomatic complexity 41 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11cc9db77fa046b0c47c07054a691bed9b4c4cbf497cb3c60fa0c09a343c6ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsFresh (cyclomatic 41, cognitive 52): docsFresh has cyclomatic complexity 41 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb6f57707fc39fc95f06e30174d832b465d8a2bf688ea5753b8bb1657518ce5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 41, cognitive 47): main has cyclomatic complexity 41 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d8e1a42b919c3423113106277a193e12e25c8f133a4daabfdd65908402f89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentBashPermissionCard (cyclomatic 41, cognitive 46): currentBashPermissionCard has cyclomatic complexity 41 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd720be7c28222e435e9402240d679578a6d1aa2536262046bbdba1ab9b15218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retention (cyclomatic 41, cognitive 45): retention has cyclomatic complexity 41 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"725eebf8aac688a3e4e95c2a4e199a4bcbb430193027bcc21d0f54ec40bd4c1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glPictures (cyclomatic 41, cognitive 44): glPictures has cyclomatic complexity 41 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1453018a62c945bc4cab041757d53ce8d92f3ba4a32dadc3d38cfc83f3cfda2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receipt (cyclomatic 41, cognitive 41): receipt has cyclomatic complexity 41 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95819f22e92f5812fa685d961b21d291263c88a5b7423a4381f7281b7022d3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columnarStaleFillTrace (cyclomatic 41, cognitive 39): columnarStaleFillTrace has cyclomatic complexity 41 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a29637a9c80440dcaa62e4ecd0bfe3daaf42468408b1c848e9b2a495f99673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasCompletePlanReport (cyclomatic 41, cognitive 34): hasCompletePlanReport has cyclomatic complexity 41 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f0f07b5f43cd181d3060fe32c2c09a86bf3a503eff6f15843aca7002bbc823"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOwner (cyclomatic 41, cognitive 25): readOwner has cyclomatic complexity 41 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"018bfb57407244638dbfdb3b828a641c0b803bcf13a714e4402cfae53ceea1db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overwritePreviewMatches (cyclomatic 40, cognitive 69): overwritePreviewMatches has cyclomatic complexity 40 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e234d2379d925b04c5f773d7839f276586f5798b4705a37e135d6ebd779a7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectRecovery (cyclomatic 40, cognitive 57): collectRecovery has cyclomatic complexity 40 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/recover-receipts.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"097f82ff20141fd231313e49850b7a070b4d20b90e3c7304558d6a7814016fab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumeRun (cyclomatic 40, cognitive 54): resumeRun has cyclomatic complexity 40 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cee8779d8d23a97bbae14e07d9b000eeace08c0c3b80a2d20baca653e751dd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accept (cyclomatic 40, cognitive 49): accept has cyclomatic complexity 40 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5349cf5732f2df2bf2d490d2b0a11b93305a5e8c1ea5b7f9fbe8bcb89766c2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 40, cognitive 48): main has cyclomatic complexity 40 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdba9dab1ecba0d1ba91b71b21bab75b011824fcfcedda71d9d40b09dfd2f7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planVersions (cyclomatic 40, cognitive 47): planVersions has cyclomatic complexity 40 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8030bb283d0e67e3b3a4853a4956f0030f11a7a98b235717e5f92a2185c4b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureNativeFirstAuq (cyclomatic 40, cognitive 45): captureNativeFirstAuq has cyclomatic complexity 40 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-native-capture.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d601594d91093a2f6a86f2419239aad7313d4672b3843b8f19122adda9ab70f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 40, cognitive 39): main has cyclomatic complexity 40 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49ca7d44372c742fc28f267f10d7a7e393c3139acaa33fca2aca6b47a8a1778"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 40, cognitive 28): main has cyclomatic complexity 40 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/garry-output-comparison.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dea64dda485e1790b89794bb680de19d13f6f88ca483428b6c08a8c491b0d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRecordedDxManualNavigation (cyclomatic 40, cognitive 23): isRecordedDxManualNavigation has cyclomatic complexity 40 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/dx-selected-navigation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a178151cfdfab81101818819e4a9c52b230acacc0fa578fb7b122892205e90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPendingWriteInput (cyclomatic 40, cognitive 20): readPendingWriteInput has cyclomatic complexity 40 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"55be363b724a9135ece5750df5b4c87dc58a2780dc8a67c96fba26acc2385b16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lex (cyclomatic 39, cognitive 99): lex has cyclomatic complexity 39 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/generated-bash-lint.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8f1a3fc3beb1018377e0a77d20c1155445dad7edca95a3e52b8aef2532fdcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 76): (anonymous) has cyclomatic complexity 39 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-ceo-mode-routing.test.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aab4e405326b9ba5fd8dec0722b7603d95e0e16a1c9ec570b73ae473e9f8696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskSource (cyclomatic 39, cognitive 75): maskSource has cyclomatic complexity 39 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/module-size.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7885b8e4ec9a20dacb180f0a9b1f2bcd56be9d92f2da55729857191afd953c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendCommand (cyclomatic 39, cognitive 68): sendCommand has cyclomatic complexity 39 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"05097c82afe3a5f90ba9ff54df24168128df58fa08ae411979b8e747cc79564a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 39, cognitive 66): reconcile has cyclomatic complexity 39 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06dc8984499ef30716a9319b99740b164ed88b65f1c525360fd96ed9be18786"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glPadding (cyclomatic 39, cognitive 61): glPadding has cyclomatic complexity 39 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e60e0e6636e448724e76b1d7623d395b43ac6fe00e11d09de30d24d37383bb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function imageBuildMatrix (cyclomatic 39, cognitive 53): imageBuildMatrix has cyclomatic complexity 39 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-image-matrix.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aae973d96fc5d959ba560eec729462af70804fa33f5bcb688afdc2c3a3384a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waveSettle (cyclomatic 39, cognitive 51): waveSettle has cyclomatic complexity 39 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"65181160752db1595d3e37f49510a5b7a461607689d65bd468b481691fc4d4a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextStep (cyclomatic 39, cognitive 49): nextStep has cyclomatic complexity 39 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"721a9ef75544f7e15e5d458973d79aafb633050dd1c92a77f1bf4119ac7d772a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 49): (anonymous) has cyclomatic complexity 39 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/community-pulse/index.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcd69925a90677c7dbd77015c7c0c6361403605c081d0310c659c4d1b4edc09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureModeSelectionAuq (cyclomatic 39, cognitive 40): captureModeSelectionAuq has cyclomatic complexity 39 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-sdk-capture.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d8c31a471fb8ba4bdb37e90f1691518cb9ffe286b4368551133243421eb785"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPlanFloorTarget (cyclomatic 39, cognitive 35): readPlanFloorTarget has cyclomatic complexity 39 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-floor-target.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2681bff19a6c66cd3df1f17f02218dc9f0cb4f09e9cd362b8050b56b52a559b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateClosure (cyclomatic 39, cognitive 28): validateClosure has cyclomatic complexity 39 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfda4261211cc7ebb11a534e9a8321fd542a25ce5082eeed2904094b799005d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provisionCatalogImages (cyclomatic 38, cognitive 72): provisionCatalogImages has cyclomatic complexity 38 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/image-provisioning.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"728c8454df560fadf445757ce9feff4121cb0e20c651944f7c657aebe3b81e4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coverageAuditReadEvidence (cyclomatic 38, cognitive 67): coverageAuditReadEvidence has cyclomatic complexity 38 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"158cc58a2e818918714127c7b04f550370e3030f88d5d6d90abc75ed7eeedb18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check29Glow (cyclomatic 38, cognitive 60): check29Glow has cyclomatic complexity 38 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/color.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e63882b47ae35fc37640b7e5ecc23e70436226aecd041f3c8d69be9cd82419"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runawayMain (cyclomatic 38, cognitive 57): runawayMain has cyclomatic complexity 38 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cc21928bf4b11bcd120f55ccf40fc306b658dcf977c3b4fb3b5a6f5740687f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeCases (cyclomatic 38, cognitive 54): observeCases has cyclomatic complexity 38 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-rerun.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a61790f059e9eecea7ccbe5ad7488e2166b4e09ad925494ad000f0541544af8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 50): (anonymous) has cyclomatic complexity 38 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/free-owned-browser-settlement.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba510ee376f4904671f5944759e6f20f44f325c48b5ffc95087b9f8fec2d00d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newTrain (cyclomatic 38, cognitive 40): newTrain has cyclomatic complexity 38 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b40ce23088697182941277f93f3ba93703bcd98c09ba9fe5fca1a0690f77e06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 38, cognitive 37): prepare has cyclomatic complexity 38 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-review-decisions.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24f08dc7b020a920843d70f8298b71d6cc068a967ce50e2807f5f29504972ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertSnapshot (cyclomatic 38, cognitive 29): assertSnapshot has cyclomatic complexity 38 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"926025fae5cfc4736e3d45b557822e1b60d4fe8c6e364d6078ba0f80187dbb90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function successfulFinish (cyclomatic 38, cognitive 26): successfulFinish has cyclomatic complexity 38 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b7b83e49b69b5134bb519574314cbb34de4440bd1ac03ac74c073c08d1ea1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 67): (anonymous) has cyclomatic complexity 37 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de18291f1a4197efe69000954a1c48ff67d3f8b35b135ca5085e5ee403bdd75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 55): (anonymous) has cyclomatic complexity 37 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land-direct.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9239ed5a6fd74ae808b78893a30efeb668344389f4e4a7efa945c2a5ef98bbb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeLineStart (cyclomatic 37, cognitive 52): codeLineStart has cyclomatic complexity 37 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db6ee5d198b808360fc18816cefb366603985b1e4c8ec7a1b3f6b9efbf9b512"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shutdown (cyclomatic 37, cognitive 49): shutdown has cyclomatic complexity 37 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b5005b6dd8407a144943d2b2e1288229a8a121865adc41d70358eb63760ca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doctor (cyclomatic 37, cognitive 47): doctor has cyclomatic complexity 37 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5f64fb3fbe41aeb8af827137efb8768af565e9f3ebce7349125148ce56a4dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCaptureArgs (cyclomatic 37, cognitive 43): parseCaptureArgs has cyclomatic complexity 37 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/motion-capture.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"793e3a9fd210f79c8f120aaa554b04d8dd3c4b88617c64d6db7e0cae7389a9da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 37, cognitive 40): main has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/skill-contract-stop-hook.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb223a799f700039b47b54b1d542c6d1c1d00c49d0e6fa85d04e2841f81fcc5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function push (cyclomatic 37, cognitive 40): push has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c94b83de21b3061d3e917366983def22ba723317a35cc3f2195fe4bd95fa9b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 37, cognitive 37): run has cyclomatic complexity 37 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/greptile-early.test.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fbebf1a1cd03ac1b79476191db5ca8542f237ac1fa412ac2a24bf9620be9bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordPendingQuestion (cyclomatic 37, cognitive 37): recordPendingQuestion has cyclomatic complexity 37 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-question.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"00237e8f3bdcede64d48eca70bf628e400ca7334c9924ea815adf52c6def54ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandPieces (cyclomatic 37, cognitive 35): commandPieces has cyclomatic complexity 37 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d950d3feeb88fafe1d947f31834602f9f48c81d090b595bb83cfc88622c34d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function originalOrderAStaleFillTrace (cyclomatic 37, cognitive 21): originalOrderAStaleFillTrace has cyclomatic complexity 37 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9682c5765874eab7db935cfa9696fd25df1436c9fa10784a3b6c0f86263342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLeaseDecision (cyclomatic 37, cognitive 20): validateLeaseDecision has cyclomatic complexity 37 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0e479eb744ec6f6a7c7caeec200734145adb7c8cd422744b0cc54a7f2bfa4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTranscript (cyclomatic 36, cognitive 67): parseTranscript has cyclomatic complexity 36 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"406625650a59d6e5b0ce53ce0655fb88a5a1a3ef0262bdf3382fa5997646a6c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportShadow (cyclomatic 36, cognitive 61): exportShadow has cyclomatic complexity 36 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fab5e21059ae0418d1a69ddcd726163171aeb345863351afb04596c9abf13a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prematureAutoplanPhaseEntry (cyclomatic 36, cognitive 59): prematureAutoplanPhaseEntry has cyclomatic complexity 36 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-method-read-audit.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b834f987b3e02eb86b176609087e243200e7b409859fd28ec349bce4aa7d93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectorError (cyclomatic 36, cognitive 58): selectorError has cyclomatic complexity 36 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/app-input.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a141a07594ef2d32ec07f9fc8b7d7254eaa6594bab933ba8999ce113788d5c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkEvalTasks (cyclomatic 36, cognitive 57): checkEvalTasks has cyclomatic complexity 36 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-bill.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbf6afad6ee84687f3f77a3053e68c68519dfeaa5b57b22f3ecad044c3ab7ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEvalMatrix (cyclomatic 36, cognitive 55): buildEvalMatrix has cyclomatic complexity 36 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ed45c9003fc6654bc134a9fad53bd9060c9d52475674bb58bf7d6b6fb68e1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 36, cognitive 51): verify has cyclomatic complexity 36 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44f331aa67794f4fc5da629e201543bece2e5a48ae0f770d02597f9f96b4b99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNumberedOptions (cyclomatic 36, cognitive 49): parseNumberedOptions has cyclomatic complexity 36 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/classify.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"926274ee8df890b7a799d373495f450d41bb7226067c6eaa79a7e5e33c825140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 46): (anonymous) has cyclomatic complexity 36 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"92091fbfc62e045cb13ceaac91cec598f50a671b1ea4501448ac70572c2ee55f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leanPlan (cyclomatic 36, cognitive 46): leanPlan has cyclomatic complexity 36 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"042416b000fa2dd89a0e8e5d21b6f290aea6ee3a7b37d66c48e1e05694b490ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 41): (anonymous) has cyclomatic complexity 36 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-only-fixture.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99e4899a349385f1d37d590080fe98fd07df68b44a6d7f734b634683ea57ef1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreEval (cyclomatic 36, cognitive 40): scoreEval has cyclomatic complexity 36 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"e775bc29426f82cf0bd2286ad40eaf65b350218a33494b21a514780db5f895bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function superviseRegistrySocket (cyclomatic 36, cognitive 35): superviseRegistrySocket has cyclomatic complexity 36 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"095a50d94d75bc938631c6f38ce9141f17605a3a303c978ac9304c18f0a30fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesTruncatedNativeQuestion (cyclomatic 36, cognitive 35): matchesTruncatedNativeQuestion has cyclomatic complexity 36 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d327e21d3cf8d09923a77756754738007dbc66e8cfa9e796781b949e9d86c4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twEyebrow (cyclomatic 36, cognitive 31): twEyebrow has cyclomatic complexity 36 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"51293732ef7d2f47aa29166884d9f90c7c4bf45b76c7e9272d6564fc61a12490"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCliOptions (cyclomatic 36, cognitive 27): parseCliOptions has cyclomatic complexity 36 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc00bf53c31b2d221e8f56d1f38be6732524126730dda4630ad1ec065166816c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReceipt (cyclomatic 36, cognitive 25): validateReceipt has cyclomatic complexity 36 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b814617d123a6b1a1a0d71da856ce09e8401dc8a0d41c978a4389b25e94c979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 66): (anonymous) has cyclomatic complexity 35 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/css.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8c7db8aa434a9dc6e690bac8601560b706c1c65a164014c681016152308d2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipLanesErrors (cyclomatic 35, cognitive 56): shipLanesErrors has cyclomatic complexity 35 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-carry.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b4df0bf31d21cf5f446f2108c648ada3bade54689815863a9916813f3a710"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 49): (anonymous) has cyclomatic complexity 35 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f0e4a8df041f518250b2a156b23398f910f0ef0bfb3e5bc59c302d977b9e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activateRunLease (cyclomatic 35, cognitive 47): activateRunLease has cyclomatic complexity 35 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"352292ab4b056b6ee0fbeee3d194a89b9e2a46b365e15627443dddd647497146"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 35, cognitive 45): run has cyclomatic complexity 35 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/secrets.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"84afc2663b25799ce1857c96089f9957d6d10fdeac6da2da1b1cc26eb2522a31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loopStep (cyclomatic 35, cognitive 40): loopStep has cyclomatic complexity 35 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"070c31ffd7cab89570e09f99f01e5be9489179bf3c678e090bd5d3da217182da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedMode (cyclomatic 35, cognitive 39): selectedMode has cyclomatic complexity 35 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4f6ea11f1a6f308ad6e3ce61720fd353cfe26e2ef19790fcadb6c649736c99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countingRespond (cyclomatic 35, cognitive 38): countingRespond has cyclomatic complexity 35 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/counting.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a6c7e3974aaa8eb73acf0724df78ec40c16efdced955e915572e6e828e6eb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countingTerminal (cyclomatic 35, cognitive 35): countingTerminal has cyclomatic complexity 35 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/counting.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d84f6c3f92e82f3c3690ba4f0ff453bdd8ed9198208e1864442c3d4560f63f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reclaimPublicationLock (cyclomatic 35, cognitive 34): reclaimPublicationLock has cyclomatic complexity 35 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9727a9e8eacd711b1d533beac240f06b852e6f6729f43ca210b1a5204711e94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 32): (anonymous) has cyclomatic complexity 35 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-review-start-evidence.test.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae99e9b773b2ef6c0cc2bc7363b9199cb578679a8ec26a12d199541afac39b82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readState (cyclomatic 35, cognitive 19): readState has cyclomatic complexity 35 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-recorder.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0516b1805159073231e17b82455e720d4609faceb56903b743a629a348d8fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureLockProtocol (cyclomatic 34, cognitive 61): ensureLockProtocol has cyclomatic complexity 34 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bf2540929e810d2c357047adf63f369a179417cd08a42bc0235ddc2bc0f733"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkTemplatePunctuation (cyclomatic 34, cognitive 56): checkTemplatePunctuation has cyclomatic complexity 34 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cfb2cde325b37c27878ae9db4a272d5b3983058767b6e79e3fd5961101fdc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function poll (cyclomatic 34, cognitive 51): poll has cyclomatic complexity 34 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b58fad3bc140769d48dd94bbaf8c049a07a878c9f0c22a4301e1f7993d4ee9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDiff (cyclomatic 34, cognitive 46): classifyDiff has cyclomatic complexity 34 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ff4cdd1099291de863fdb315f64875dc73d60efa7d725f1dc0b37e3b57a15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 44): (anonymous) has cyclomatic complexity 34 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bf55b702ad1151ff048f607ad00f07b9fe2927ef28a0e3c49423c8743112d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixChecked (cyclomatic 34, cognitive 43): fixChecked has cyclomatic complexity 34 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f344e38b8a693d74731f498d12619a8b9c9c341d4e2297ad225fd5dd8b228b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 34, cognitive 41): fetch has cyclomatic complexity 34 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-bots.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9973d452957435f8545d4e00fdb6c7ab3884b0489d760f1617dd17987d2e215d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function integrate (cyclomatic 34, cognitive 39): integrate has cyclomatic complexity 34 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a487ad97476f750ca0d3152623fe7bed7a312a4913bccd9858a303c8f8b8300"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePdfArgs (cyclomatic 34, cognitive 37): parsePdfArgs has cyclomatic complexity 34 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95635f44428fdc7edaf6c4b0e3efbce3f40e98c4aee68a1edae265279821b75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCodexHostSkillTest (cyclomatic 34, cognitive 37): runCodexHostSkillTest has cyclomatic complexity 34 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-host-runner.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f41ea1784467eef08ca30ceab465171c008baa85d2a7b741d4a35dd469f6d0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatePlanFileReviewReport (cyclomatic 34, cognitive 33): generatePlanFileReviewReport has cyclomatic complexity 34 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/review-dashboard.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57aef0921a496b4741de3fa44f124caa3dbbdad630ff26bbdf385da79d8dda7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 33): (anonymous) has cyclomatic complexity 34 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-checker-interface-evidence.test.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac1b677f125448537bac1522ee3f26841c25461c972bd740c4b318b63cf87ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decide (cyclomatic 34, cognitive 32): decide has cyclomatic complexity 34 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5999a08d145d519fc90075f3952b29eefe40f45a01d0772dca2437ac3e48d58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function questionResponse (cyclomatic 34, cognitive 30): questionResponse has cyclomatic complexity 34 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3228f5fec7a89f52c877ce2ad6a3ffb289b02b2e0f5090003d60cc10786e1380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectScope (cyclomatic 34, cognitive 29): detectScope has cyclomatic complexity 34 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-prompts.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"990074403f0e14a864304aa16b59f4e1be80a123dacfe21605451901def7f09b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertedAnnotation (cyclomatic 34, cognitive 27): assertedAnnotation has cyclomatic complexity 34 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb08cfaa88fec3a93d3ae56b58c3aacf689d35bb324a0ae2ed92113257886db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLegacyOwner (cyclomatic 34, cognitive 23): readLegacyOwner has cyclomatic complexity 34 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c45ad255979138027cf9543582426708c75005d8739cd93267c6230c2b037c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 20): (anonymous) has cyclomatic complexity 34 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6a4ec9a6aad010e431a33e7962445d9445578c774a8c9f89620c9a341912e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitCarryCheck (cyclomatic 33, cognitive 53): submitCarryCheck has cyclomatic complexity 33 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-carry.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22abbad14fafa6adaf1f21cc16f64f46f2c692cc589cdabf7fbdfde201d70b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStages (cyclomatic 33, cognitive 51): runStages has cyclomatic complexity 33 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d1ae12cc083e42cb84b52e55ee155fe730f5412b4bcac61fcb1e5af490480"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function promoteToHeaded (cyclomatic 33, cognitive 45): promoteToHeaded has cyclomatic complexity 33 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59a08a6414858dca212395b4cab0e8be2f66966ad56681a6c0fa4bbdec8fa62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contextBillMain (cyclomatic 33, cognitive 45): contextBillMain has cyclomatic complexity 33 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5b4ae630ebe2cc07739a7019b24add566cb38f8311c3de4eb34808f25d8e9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodePng (cyclomatic 33, cognitive 45): decodePng has cyclomatic complexity 33 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-png.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b702d19eee467484385636994c83e2cf0453f0bca3ce8808f892e71a29c2ad70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSplit (cyclomatic 33, cognitive 44): mergeSplit has cyclomatic complexity 33 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"18006140a4620fbc06cff1397f2cb9695dcee8fc76ffadb867b7041b53e52260"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withoutAttributedPriorRecordData (cyclomatic 33, cognitive 43): withoutAttributedPriorRecordData has cyclomatic complexity 33 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/disabled-plan-review-fixture.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cb4dbaa9edf7b651b484b59b8c03a5874e79c6e23137beecdcce4ee482bb19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintPage (cyclomatic 33, cognitive 41): lintPage has cyclomatic complexity 33 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cce31e071413969c2f24e0394d77d0565cb1ef9cddbbede73ed23f52409e91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainErrors (cyclomatic 33, cognitive 41): trainErrors has cyclomatic complexity 33 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef150bc18e18bd7f40f1c1940a24d9090685b9577d8190d6a00a4e98a51a81a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyRelease (cyclomatic 33, cognitive 40): classifyRelease has cyclomatic complexity 33 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/release-stamp.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc418a4ea4e27b2acb2884675f86d5cac8ce6cf38d259569401070c0b9185f51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sectionToFile (cyclomatic 33, cognitive 39): sectionToFile has cyclomatic complexity 33 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84632e90bc8473fc77d57f389de99a3a1ec7c7a6c9e8d471c224076d23de7be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReviewLoopException (cyclomatic 33, cognitive 39): parseReviewLoopException has cyclomatic complexity 33 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1502f22f98fe666612f75a046bc1f705a035da0688ee462764a8cedd904f4a30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTrain (cyclomatic 33, cognitive 38): buildTrain has cyclomatic complexity 33 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0626bb7b529dfdc39c99f1eb716a0d14fd40317db07b259d5a28388b9221dd43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseScannerOutput (cyclomatic 33, cognitive 37): parseScannerOutput has cyclomatic complexity 33 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"c394190eb31ecfd61a75bea3e0a94243a6987224b2ba571132c05023683a8578"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 36): (anonymous) has cyclomatic complexity 33 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dom-dump.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5af74b8469e92fa564aed0d5a9208cb70ef05c81495925b3a93790ffff3c969"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preflight (cyclomatic 33, cognitive 36): preflight has cyclomatic complexity 33 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d26eeffc35b9c5545271092d01293f8416466345e1ef9b1a3990a251be4d8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertQaBrowserCheckpoints (cyclomatic 33, cognitive 36): assertQaBrowserCheckpoints has cyclomatic complexity 33 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-browser-deadline-evidence.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ff6f31c23ab686296dba844710e7bf2f51fe86068b579b28a4ce7bcb39abb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyTrain (cyclomatic 33, cognitive 35): verifyTrain has cyclomatic complexity 33 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2013da083dc5d3a47c24aa240f561f49265ee665b032bb79c6f72a9e02e1f2e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verdictFileProblem (cyclomatic 33, cognitive 34): verdictFileProblem has cyclomatic complexity 33 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/install-verdict.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3849cad8d3abf15f11565a6b759ba95f8013969068f3b2bece56e227476638"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCeoHoldPostureReview (cyclomatic 33, cognitive 27): buildCeoHoldPostureReview has cyclomatic complexity 33 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-hold-posture-review.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2acb5a3d369b8397649f0101ecb8ddc20273b1daf6123eebb7140b34a87fca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twTrackedCaps (cyclomatic 33, cognitive 26): twTrackedCaps has cyclomatic complexity 33 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8ea6ff8d590f4447517e5f882faa13d74eee2231a71aebaa6ac671c50c2990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ceoModeSubmissionInput (cyclomatic 33, cognitive 26): ceoModeSubmissionInput has cyclomatic complexity 33 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6294f7fe13756b2cb23a6329fb623fcfc88784b50769a598f94906d26d97c9f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callerDeadlineCommand (cyclomatic 33, cognitive 26): callerDeadlineCommand has cyclomatic complexity 33 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0291db0b2c6bc36376d911bfd9d5e35e8926f977ec9b0ab850f1d4c23d2887cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentFilePermissionDetails (cyclomatic 33, cognitive 25): currentFilePermissionDetails has cyclomatic complexity 33 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"19498ec3d4618dada438edf0dad08d5d95f2b9d3905ca5af6bf13dcc6c922737"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disabledPlanReviewEvidence (cyclomatic 33, cognitive 14): disabledPlanReviewEvidence has cyclomatic complexity 33 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/disabled-plan-review-fixture.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"81882de414504dc02b0756270b1c6c7cb9819e88253b12d7dcaf1f0768ef0cca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function carryWith (cyclomatic 32, cognitive 55): carryWith has cyclomatic complexity 32 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cc823dde825b8d11a88e5ef5c4161a561c83d550b8ee69d031ca52b70d2151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sharedCurlRequest (cyclomatic 32, cognitive 50): sharedCurlRequest has cyclomatic complexity 32 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"343519c69d7738bc95810a0ec67fb0603481df78cdc776174ecce4f5964663c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchCi (cyclomatic 32, cognitive 49): dispatchCi has cyclomatic complexity 32 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-dispatch-ci.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"145e420fc8b6aa7056247ea50ee7f6eec7b0b3005a6531b1335ec8f60461b117"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mechanicalPaths (cyclomatic 32, cognitive 47): mechanicalPaths has cyclomatic complexity 32 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-mechanical.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddf73ec78bd3fff9bd01483bdc3c702145bc7b8fbe478965df798747fb1e1bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bisectRecord (cyclomatic 32, cognitive 45): bisectRecord has cyclomatic complexity 32 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c47776437c216e8304a8b26251f4c5e5e8638515610839cbe3cb91fc4246bf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glRhythm (cyclomatic 32, cognitive 44): glRhythm has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"69833a67bdf4d174087d3a1b548354927da41e257805883566fb9cad7786bbcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redactCommandArgs (cyclomatic 32, cognitive 43): redactCommandArgs has cyclomatic complexity 32 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/audit.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"11de97316024a2bcafb28a398cfc0213691446d01e721d1b3c47c0d6440cc663"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchHandler (cyclomatic 32, cognitive 38): fetchHandler has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b657ee5da562d55f438cbccd26e2450466521be21b40937255cae889c29af4c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitSections (cyclomatic 32, cognitive 38): splitSections has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc43f6c8594b93994dd91fa26c40d331c577d52498b4ebd03d3d7a9990a08e8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 38): (anonymous) has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bfb1ad1f8e94175e5e69ed82bc38aecf170afb4218c07940c19510dba5cc4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReply (cyclomatic 32, cognitive 37): parseReply has cyclomatic complexity 32 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-list.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"033af09ff141e27e0910efc8e1bf2f9ae053b4f5c0040bbe23497e6f7bab6a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retain (cyclomatic 32, cognitive 37): retain has cyclomatic complexity 32 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bootstrap-retention.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a080b2977cb4e4310632b0b498d53fbcda0340eff4a18150389140dc9f8e33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function entryProblems (cyclomatic 32, cognitive 35): entryProblems has cyclomatic complexity 32 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583402fa4939ea82971e483e06d6b93ed78a92ce8bf347e17e635e9a9bb1f32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 35): (anonymous) has cyclomatic complexity 32 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-artifact-recorder.test.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d7526c828dae125c5731f9bd9370a24ed9861dde2493422c3a10a2da06d5cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 34): (anonymous) has cyclomatic complexity 32 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/pr-wait.test.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d78d0f5839c2198828369af5aba737392445a83c9c9211efc474c650290d208"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRecordedCodexEval (cyclomatic 32, cognitive 32): runRecordedCodexEval has cyclomatic complexity 32 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-eval.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3d361548b05b1341426c9ff4d66843e1e4c63ab12b5dca9a8330dc9c80fd47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateScannerCatalog (cyclomatic 32, cognitive 31): validateScannerCatalog has cyclomatic complexity 32 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-catalog.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebee555df180146eb8ac2e3bc5eb4606c0b87b40f48a6c776f8d8e724e28ec62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReuse (cyclomatic 32, cognitive 27): parseReuse has cyclomatic complexity 32 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3f267a37699531daf480ed2f49b9754ce93870e21515fe39c87e1c4698c3d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manualDxTaskNavigation (cyclomatic 32, cognitive 23): manualDxTaskNavigation has cyclomatic complexity 32 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd8fae69ef3d5719b3c14b239a401abc3156229fae1326b74c94b7adf0a6946"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 22): (anonymous) has cyclomatic complexity 32 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-review-board-feedback.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afe4bdd182780aa96d0af1ba4d8ffdbaf73ad225c66921f893f6d42ad69db70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundPath (cyclomatic 32, cognitive 20): boundPath has cyclomatic complexity 32 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb7906679058dacf513aa8fb65712c3b3b636dc3895824e9145a019b25e2bea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engInjectedExportFinding (cyclomatic 32, cognitive 18): engInjectedExportFinding has cyclomatic complexity 32 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a15c427c469660675b41c79fc341900541fce48b4972f043abffd4a7072709c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canReuseSharedLibsAdvisory (cyclomatic 32, cognitive 13): canReuseSharedLibsAdvisory has cyclomatic complexity 32 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85e9f73b32d42326133486753b11ea70508843330c0eb4b976ecf511a5162c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEvalCalls (cyclomatic 31, cognitive 59): parseEvalCalls has cyclomatic complexity 31 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2019a011fc76ed3f2ed928f4419eca6609f6b5b3948bc37576dc9ad4be1c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commands (cyclomatic 31, cognitive 55): commands has cyclomatic complexity 31 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d4e08105a7ae4a32c2bcbd56642167072c9c4a2b065a350ae0b7cb68729b14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeStep (cyclomatic 31, cognitive 52): mergeStep has cyclomatic complexity 31 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ebc580e9d863a6a92a089938e30fa8534d2c2cc89ed6e42316996a74d3ff66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformFrontmatter (cyclomatic 31, cognitive 48): transformFrontmatter has cyclomatic complexity 31 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1f4b7c2c9f2b903c24584cf2a041670bbac21db257a0c99e129dbf947afcec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkItem (cyclomatic 31, cognitive 45): checkItem has cyclomatic complexity 31 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecdadf60129d1827c9c6ac596368c35b611e472bde5e9898e85e62b7b89b4d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRole (cyclomatic 31, cognitive 42): renderRole has cyclomatic complexity 31 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-brief.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade836d03c5533db5932ca069af4896f7dd056b11760226fe87531c9c69fffdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stamp (cyclomatic 31, cognitive 39): stamp has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4e2bf9fd236a7a9f8e39a08e3290ca845c55d2cdada73f72358e25def0296a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dockerEndpoint (cyclomatic 31, cognitive 37): dockerEndpoint has cyclomatic complexity 31 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cd2f745b4ca99e78e676e7e912e4067ac1daf3f50557f774185661a014c10e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 36): (anonymous) has cyclomatic complexity 31 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b314faaa0b273c6c0aebebdec0545c0b8a20d6b056bcca2fcc4a3051c8dc71cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPrReuse (cyclomatic 31, cognitive 36): findPrReuse has cyclomatic complexity 31 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-tree-reuse.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8ab1f4808b02a0d0f40e03fce7e930f12acf0e1e8ca6afe06ca93e9d3ecc31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeMetadata (cyclomatic 31, cognitive 30): safeMetadata has cyclomatic complexity 31 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a0374a02a99986ec45be4db0560accdc4c44fea113697d673899e5c3ec000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 30): (anonymous) has cyclomatic complexity 31 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-evidence.test.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bbf84227262a83c478604d2f864a3108bd37bb4751e16efad2bcdf2bdd4d8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsCompletedRead (cyclomatic 31, cognitive 30): docsCompletedRead has cyclomatic complexity 31 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c18ae9273d931ceb92d4fdc28c21b54145cc2450a4d79c1e78118ae1df2fff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseKnownLease (cyclomatic 31, cognitive 29): releaseKnownLease has cyclomatic complexity 31 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c5be84c79d7da1f1f658bfbccf4cdb8567d7f9a4f5af2e78225b8d8d22eb8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 28): (anonymous) has cyclomatic complexity 31 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f26c0c6848adf2a025fa24f43c10759e4c4eee4277156fd85aa7950c3892c13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProxyConfig (cyclomatic 31, cognitive 27): parseProxyConfig has cyclomatic complexity 31 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"204028fd165e0db077e9b3cf56237ba8310e79f03252913e393843b1f0ece8b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materialize (cyclomatic 31, cognitive 27): materialize has cyclomatic complexity 31 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc715d49326021cf46fc73b450d9e00074ad8930573e336c5cd90d2581299f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function healthDimensions (cyclomatic 31, cognitive 23): healthDimensions has cyclomatic complexity 31 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41ab999bf9d9d390b2e20eaf8f456712618bce016da02c42d86c6d2a4688303"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 19): (anonymous) has cyclomatic complexity 31 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"17212c154e661fd2909d05edb702bccc89c3d5b522836a3e7facddd420e2073e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedStable (cyclomatic 31, cognitive 18): readBoundedStable has cyclomatic complexity 31 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/bounded-file.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb3aeda8d64e3f48ce5dd956c764c3847f4e55e5daa5384ecc30c81f8d5c85d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateOwnedNativePlanTerminal (cyclomatic 31, cognitive 15): evaluateOwnedNativePlanTerminal has cyclomatic complexity 31 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74c1f1ac1fa8460ab1774773a34cbede1f6eb7117e55d526c4b056a92cb882e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchCsoCommand (cyclomatic 31, cognitive 10): dispatchCsoCommand has cyclomatic complexity 31 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb28293bdc93163be5dfd572546ceb8635487f8c6b6afc102d4d831b538cffa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanConsumers (cyclomatic 30, cognitive 83): scanConsumers has cyclomatic complexity 30 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14d52cdcf0ceb8c913349736e3371c6fdb19ed3a6e3f2d85428a7bcf0c29752"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consume (cyclomatic 30, cognitive 62): consume has cyclomatic complexity 30 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"e149635bc5d1379263cc70cd5ea1713c84d7c3dc9277423c78a59c815a31e050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneTrains (cyclomatic 30, cognitive 60): pruneTrains has cyclomatic complexity 30 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56746a64415a983b084dff81c0cb08cdb8c8ae27bb8a74fafd072ea00cfc389"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateVerdict (cyclomatic 30, cognitive 52): gateVerdict has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9264d85bad7c5b7ca85e30acf44378041eee35aa2931780d1127d4d4d3de1852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStage (cyclomatic 30, cognitive 50): renderStage has cyclomatic complexity 30 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c81a2e39ed2b239ac8ebf1d0de7cd863184f3a6e597962611d9c662f8735b06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureBasicData (cyclomatic 30, cognitive 47): captureBasicData has cyclomatic complexity 30 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0353ea8010c15070bd5425c2467025b9de6e5744607b843e805315c7f194e568"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureBasicData (cyclomatic 30, cognitive 47): captureBasicData has cyclomatic complexity 30 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cdb90dd6975668b49a6bafa480d3a9039443697c68b0356776f68cb2fba7ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function svgDrawing (cyclomatic 30, cognitive 46): svgDrawing has cyclomatic complexity 30 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"afef157f57c644ffb089b54ba326f98de263d6dd99a78ffd252e154ab2ac936d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binaryContent (cyclomatic 30, cognitive 45): binaryContent has cyclomatic complexity 30 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2737cfe34bdf5612934fa207fd9f0eab281bc518f2ef9bb06f3b488549dfae4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainVerdict (cyclomatic 30, cognitive 43): trainVerdict has cyclomatic complexity 30 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b40857625a1ff88b9fd57dbc915fd2f75d6fb7e697dadb2a0b31be315d0d024"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callJudge (cyclomatic 30, cognitive 42): callJudge has cyclomatic complexity 30 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/llm-judge.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f3d8581c64f2df1bbe70fed50c3d080816b7edbdc7a0245740e819f6d82d23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 30, cognitive 40): observe has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2093aa78c136f84e96078a2d0254889fbdec19357df8278d4274a46f04db94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editPreviewMatches (cyclomatic 30, cognitive 40): editPreviewMatches has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee3ff2ac5be6a8b06a13ffca23f04fd68420dee279fd555be9bdb8921749998"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 40): (anonymous) has cyclomatic complexity 30 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-seed-submission.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb679b7827c433747ff189cfc9efa5f9e003d8763f8f0fc27493e32e164d92fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quarantineMain (cyclomatic 30, cognitive 36): quarantineMain has cyclomatic complexity 30 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e4c5e9d44638a91d04c4c33e4c19a80f1a885c69e4003ef4814bc343a87a35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function option (cyclomatic 30, cognitive 36): option has cyclomatic complexity 30 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c832a630cf25b20548d0851335b6b32f83429787cce730918dbd92e5171c1817"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBundle (cyclomatic 30, cognitive 31): buildBundle has cyclomatic complexity 30 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6970f77ac78dd2fede3b83b2b8a750d904c762f0c9ddca6eb7107ad7bd3349bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFreeCiResults (cyclomatic 30, cognitive 26): verifyFreeCiResults has cyclomatic complexity 30 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"216118f13141f5430f168c4d6c97c50fb01a16eff81b0929e6d32369fe83bda9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completeCandidateSplit (cyclomatic 30, cognitive 23): completeCandidateSplit has cyclomatic complexity 30 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab695cbf403167ef40db755dd88f942f9777859a6180bfe8145619c148c9c44b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertBaselineBinding (cyclomatic 30, cognitive 10): assertBaselineBinding has cyclomatic complexity 30 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f95067e1768d56b402fa06be415b8b3cb1cc063e181e2fea21f2865f0b6ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sharedShellTokens (cyclomatic 29, cognitive 73): sharedShellTokens has cyclomatic complexity 29 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cdcb2ce00fb000a6cadb64ab4f500e6220a5d20d03207a2ea6d7080e52ae53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulateArrivalTrains (cyclomatic 29, cognitive 63): simulateArrivalTrains has cyclomatic complexity 29 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost-history.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e48b59f32b7a8ba8a78a557458fdbec7eece9b8f911d8beea12470a5013870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasTrustedReviewStartRead (cyclomatic 29, cognitive 58): hasTrustedReviewStartRead has cyclomatic complexity 29 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed660627b81fcca1623cd19384c47bcb78d400dea362a2ce4e80a402efbfe10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withoutHereDocBodies (cyclomatic 29, cognitive 57): withoutHereDocBodies has cyclomatic complexity 29 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb29453bf86081f8db9112fa2a60243add40ee28d48681fbcaa1e4a16bc42c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 53): (anonymous) has cyclomatic complexity 29 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-exploratory-callers.test.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7729c572f8fa42757bd1117642beeb4fc65d8f5e59b2d0cc371d248035082ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoplanPhaseCompletions (cyclomatic 29, cognitive 51): autoplanPhaseCompletions has cyclomatic complexity 29 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-phase-publication.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c759005606c6b17ac2c0faad3df00b44352239b03c64ebcaed142c569738b3e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifest (cyclomatic 29, cognitive 51): manifest has cyclomatic complexity 29 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"787d127bb17bde3038167c47880be4148a9104414e0545db9af53337d0ac6957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discardAtomicNoReplaceTemp (cyclomatic 29, cognitive 49): discardAtomicNoReplaceTemp has cyclomatic complexity 29 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb0d5f32565845d103382defcc39e10941a8d15c1281e38b55feca7464446af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function versionStampOnly (cyclomatic 29, cognitive 47): versionStampOnly has cyclomatic complexity 29 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/stamp-only.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd222c419fdbfe81bc7d1e62de6b5f45aab21cd83ec48cedae2369ddadcbe037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectRails (cyclomatic 29, cognitive 45): inspectRails has cyclomatic complexity 29 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e1c0a26f21d2b00f870888727d2c48b7810f26e3760837b3d05f67688a7910"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glFocus (cyclomatic 29, cognitive 45): glFocus has cyclomatic complexity 29 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2f4deab38d1b72389c781392c5493db82966956b7730d45a099cc410520729"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overflowX (cyclomatic 29, cognitive 41): overflowX has cyclomatic complexity 29 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbbec9ae87f27d9b67842880924edde04484845d69261f768099fe9131ff36f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function frictionBySkill (cyclomatic 29, cognitive 41): frictionBySkill has cyclomatic complexity 29 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/retro-friction.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29257c1554957cf8a5ae59dcd4098adf37a038f8285ffa65126e77554dd9ba2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 39): (anonymous) has cyclomatic complexity 29 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"supabase/functions/telemetry-ingest/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54275d4c1e429d57d3c917286c04f5f85cad3b8d8b7cb4de260234d3e39cd8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyOutsideReview (cyclomatic 29, cognitive 35): classifyOutsideReview has cyclomatic complexity 29 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-review-result.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9442c6ae3a3fef183709fc4018620149ce6f4fb1c38190e97872cdafc40472"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBackstop (cyclomatic 29, cognitive 34): runBackstop has cyclomatic complexity 29 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"612723b99c26a7f3b0bbfa0912adb9bcfabe4c65487742ccc56b4d7bf2bec250"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 29, cognitive 34): main has cyclomatic complexity 29 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"529fb597a50ea74eb6921d6915fc189213d21e7cdbc0998ef5f26a0d0e2f510e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesNativePlanQuestion (cyclomatic 29, cognitive 33): matchesNativePlanQuestion has cyclomatic complexity 29 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca2d719c83082af91865decd923acb3268d02614ba0ef787f9f0c9bf6d52435"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 29, cognitive 31): evaluate has cyclomatic complexity 29 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4938faef158c46284d9c3847d586d26ea53252e3c0a0a8c603fd22620ea3beed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeExcludeBinds (cyclomatic 29, cognitive 31): writeExcludeBinds has cyclomatic complexity 29 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f244a63b84bf644bf99777cd4de256171dd8ae4cb3bb3c2968a2c52872065dc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSummary (cyclomatic 29, cognitive 30): parseSummary has cyclomatic complexity 29 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bf13577297df36dc2433fc8d260880a29cfae90fb91fb741b5ff5dbe1bd77e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function freePhase (cyclomatic 29, cognitive 27): freePhase has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d44c8830f85698e18c271560eec1b5afe97efecc31db2e53177ef91596bf6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function directPackageTest (cyclomatic 29, cognitive 27): directPackageTest has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"276aa68b657034185c1f018d7f40b805c31821aa3f522d0a5fc2504ad24a7e54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickCeoSplitQuestion (cyclomatic 29, cognitive 27): pickCeoSplitQuestion has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-split-question-policy.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d4fc8519e95c19fc8568055cfcfcb028d5a87b3015eafbb41fe537b652a798"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runsCheck (cyclomatic 29, cognitive 23): runsCheck has cyclomatic complexity 29 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a756f9778c67c2cdf0fc940c94cee31785a38217124c6f43b4f85cc63ee14d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipFrozenScopeFailures (cyclomatic 29, cognitive 23): shipFrozenScopeFailures has cyclomatic complexity 29 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-frozen-scope-actor.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"046371add8d71b1251a8fa53a6750e2906aadde0f00e80d22fb03a3963bf08b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCollectedBatch (cyclomatic 29, cognitive 21): validateCollectedBatch has cyclomatic complexity 29 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f4b37f6c0b12fa070c92bc97bebc7b0fbcac5b41106ec484499aa92ee0231"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasPendingAutoplanArtifactHistory (cyclomatic 29, cognitive 20): hasPendingAutoplanArtifactHistory has cyclomatic complexity 29 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-permission.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac346bd79dcb2ae2986a7b30cc0ba116f944e78df55699bd44aeab89afbe8586"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ceoExpansionPacingChoice (cyclomatic 29, cognitive 19): ceoExpansionPacingChoice has cyclomatic complexity 29 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e4f2b12860a2dae09952e402a863d4c38abfbfacf0d6f808ee3715a25dd43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engSharedMutableCacheAUQ (cyclomatic 29, cognitive 18): engSharedMutableCacheAUQ has cyclomatic complexity 29 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dba6dcc1a2f53b4054fd19770448f606ccb90b2247f23b7b1bb3fb3ab8ab81c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReceiptIndex (cyclomatic 29, cognitive 14): validateReceiptIndex has cyclomatic complexity 29 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"724cedbc0f38e69647792e2e617cb44a1567ba6125158b8e5182ba697de6821a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engInjectedSingletonFinding (cyclomatic 29, cognitive 13): engInjectedSingletonFinding has cyclomatic complexity 29 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e439da1a4ded4a467ecad758ae3caea6b898663325a9831942a4f1c0b5d4f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function djangoEdges (cyclomatic 28, cognitive 51): djangoEdges has cyclomatic complexity 28 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/django.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda1db4f045cc5f6bbefcb73d66979ff6805f78308f8fd3910f3e4a9f114c17c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glHero (cyclomatic 28, cognitive 47): glHero has cyclomatic complexity 28 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f730ecc5bfd315f138a193f32f1b0c6fb07ca2ad8708a1584585099767460efd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContract (cyclomatic 28, cognitive 46): validateContract has cyclomatic complexity 28 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ef7837b34853e8a1dfe99ee844194510d837e9e93b523f7a44cb1a517b07b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twReadType (cyclomatic 28, cognitive 44): twReadType has cyclomatic complexity 28 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"70de32a30399b522a1407fca10ba5c012f5ce7c1aaf41405db1883f4869f8b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGraph (cyclomatic 28, cognitive 44): buildGraph has cyclomatic complexity 28 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330c8a50c1716e41832505d56b560e2b5d917b0bae444f2d73052928165aaab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePairAgent (cyclomatic 28, cognitive 43): handlePairAgent has cyclomatic complexity 28 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"5781d61d7d18a586ceb078821a22a4d2fdc0b386951772648c96a888c21c108e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLoopback (cyclomatic 28, cognitive 40): handleLoopback has cyclomatic complexity 28 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f7772ff169acbe6696106591e93e9e572b800f90e3412128fa024793ec6c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function landSlot (cyclomatic 28, cognitive 37): landSlot has cyclomatic complexity 28 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc04c73e77cb7bb3da14a9b49c637d12b6fce349895609e30f7414aae06d2cc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellWords (cyclomatic 28, cognitive 37): shellWords has cyclomatic complexity 28 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e1d25827412c8ae3406015a4841e037d45cf5bb60f86aa50fe586709a2b150"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 36): (anonymous) has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"11996c236d64d35c8ae8ebabf209a3a16a1df607baf4dbee5636b0ebd1b4d774"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedLines (cyclomatic 28, cognitive 36): addedLines has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/secrets.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd05ff32e8a09598836c49295e9f32265f2ab6eb045d8097534350290558b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 28, cognitive 36): judge has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2340be6c06e34905e198426d874eed250e4d951f19ebd77c29b09efe30e24fda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 35): (anonymous) has cyclomatic complexity 28 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-ceo-floor-interactive-boundary.test.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0668fd61e57552ebcde182b34edd889cb5251d63d93ed64c2eada36eb4ad0a16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsBash (cyclomatic 28, cognitive 34): resolveWindowsBash has cyclomatic complexity 28 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/script-invocation.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1752b21dfd37471cffdc47dbb059c566e8b297728346689f735c0d458408de8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 28, cognitive 33): parseArgs has cyclomatic complexity 28 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3116fc7b064f1b110ad96898825afdb4b23dafad0a64548e087801d72604cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClaudeCodeResult (cyclomatic 28, cognitive 33): parseClaudeCodeResult has cyclomatic complexity 28 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afade0e99c582003214fbd9a3cc63b924c0574edd9d7d0b8764874f44e295da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 28, cognitive 32): main has cyclomatic complexity 28 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"569849dfa58e575dd07078c0edffe06f8e435288ee3ebe2bcc9930c9c3370345"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainBisect (cyclomatic 28, cognitive 32): trainBisect has cyclomatic complexity 28 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7773ec0ebe1ccf5b3e40364e110d38262a6e4917f1a2b24ff0618d4b48027bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rewriteStampPaths (cyclomatic 28, cognitive 31): rewriteStampPaths has cyclomatic complexity 28 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6294facabf9d211146e956a7e14f3edd610828c44214f97bd54e59da6ba30228"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 28, cognitive 30): (computed) has cyclomatic complexity 28 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-stage-actor.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8158dface62dc6ba5ce572bcfccf75cac7adb79e62124dfe03e158d3cf15989"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateDesignOutsideVoices (cyclomatic 28, cognitive 28): generateDesignOutsideVoices has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/design.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d730a72ff6284e7ebbc65c4ec650ca9ed7d497ac0219482aeb594cf5ef6b6ee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasCurrentHoldScopePosture (cyclomatic 28, cognitive 28): hasCurrentHoldScopePosture has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec420a997115634dd0273269afd7077ad1f82b779d2d7d77508c4af7fe73be8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaCallerCommandAllowed (cyclomatic 28, cognitive 28): qaCallerCommandAllowed has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a79bb76425250eabfeff371ceed79b9e8bbf879b8ac5f9337b7074e5cac359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function superviseNativeCookieImport (cyclomatic 28, cognitive 27): superviseNativeCookieImport has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5520669552fbfda21b18b06c8669643d2582f1c229c9c8e4484995b561a1958"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shardFailures (cyclomatic 28, cognitive 27): shardFailures has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1432975e5a2d92a10eabd565cf4c93c008d2cbcea0543e390171a0fc298cd3de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGenerationArgs (cyclomatic 28, cognitive 27): parseGenerationArgs has cyclomatic complexity 28 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"762d94ffa739c10225dc1b47cbd17938c4db230d6d58b15918f9850b5eb7e021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePlan (cyclomatic 28, cognitive 25): validatePlan has cyclomatic complexity 28 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4a0f4144f5f785af237e1cd42c1a3014dad34ab3c7fd8fed9213cb765513cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 28, cognitive 25): run has cyclomatic complexity 28 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/review-bots.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe085e8adc3f58d49c4f9263f76f513d4d6d8d59f34524689d8bf9f791e8552"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGate (cyclomatic 28, cognitive 24): classifyGate has cyclomatic complexity 28 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a0d807254361cecbfc164d530ca3a6208bc4ce1d98c1c8fcfa080a491bea6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedMetadataFile (cyclomatic 28, cognitive 23): boundedMetadataFile has cyclomatic complexity 28 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5acb323fa1055d7dee216e26a607fc910f77c55121a56125b9b057e50a0bc39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stagedFileHashes (cyclomatic 28, cognitive 22): stagedFileHashes has cyclomatic complexity 28 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7c403899537502fdb724d9e8c4a2c7568a312e275fda6904ba55df77aa2dcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentEditPreview (cyclomatic 28, cognitive 22): currentEditPreview has cyclomatic complexity 28 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d255403d5eaaaf084671c62244827c55dc5d47b58be238246807969ad4825b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 22): (anonymous) has cyclomatic complexity 28 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-review.test.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77a86fc0c43d7a1b0dc44bd34fb8c479e300bf6a28dd21c4ad447c26a9c139d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewFreshness (cyclomatic 28, cognitive 21): reviewFreshness has cyclomatic complexity 28 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a80976c3eec8863919822d38b1ce5fa930b6b12a6b0214b1608659462cf3c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNote (cyclomatic 28, cognitive 19): parseNote has cyclomatic complexity 28 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-record.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59766829b23f2c990ed22562848223c3665c4e62c67b875b0296c1a690b27ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 18): (anonymous) has cyclomatic complexity 28 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ce9263ee8ff3f8d4552220b1de07d59d6f3b7c2432ff20f3decb6bcfaa580c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasCompletedScopePreservation (cyclomatic 28, cognitive 17): hasCompletedScopePreservation has cyclomatic complexity 28 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c081566a05a168bec4c29accff945beb2803766d1cf6effa72f546a7fe062bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completed (cyclomatic 28, cognitive 12): completed has cyclomatic complexity 28 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-hold-posture-review.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd912d7697962332805de9c227c19d338b9ed31bdb62b167a7f91929106fe69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focusRingFade (cyclomatic 27, cognitive 57): focusRingFade has cyclomatic complexity 27 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95b6c688d9d74c33875cd7a71d0d08ed1bfe156a70d62c97013f9292b817524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRegen (cyclomatic 27, cognitive 51): runRegen has cyclomatic complexity 27 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03b83bfa755292b1115c0545e316b7fb95d582c3b3288614273e49246cd801e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateMask (cyclomatic 27, cognitive 50): templateMask has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f96c2852b118fbaed278f97fe912994d7c097d02fa9b800e1145f19eefd161b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDiff (cyclomatic 27, cognitive 47): readDiff has cyclomatic complexity 27 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d582b7d3dc6e71f3c8cfef6ec2a94c19c73cd95d27807db21f94ff24106e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 45): (anonymous) has cyclomatic complexity 27 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0987b313617ad429e5f50466de1c4ffd30b5f0e4992c69e7a2d34848e57933d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkContrastPairs (cyclomatic 27, cognitive 43): checkContrastPairs has cyclomatic complexity 27 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"157efd0015db15f46f0c3a141d0f5bac2e4a22bd455233c9dcf1b23cfc4aae28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inputStates (cyclomatic 27, cognitive 40): inputStates has cyclomatic complexity 27 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a486cee4503948cdff013950182d67576e24cc25c2baa2e2618d033a510890"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 27, cognitive 40): verify has cyclomatic complexity 27 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-path-fixture.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5999792e8b3dd930bab58fb863e3a9bc0aac85d0437f488144fcd2577eef5b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waveMain (cyclomatic 27, cognitive 35): waveMain has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2717a3ab6167957a101fb36b94e968cc6777e117e003b0c5651ca6c488315f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMergedChecks (cyclomatic 27, cognitive 34): runMergedChecks has cyclomatic complexity 27 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/land-merged-checks.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc466a077b5f0ebadd01c0476dce7e75b24b1bde0197a24993e1f2472fb36f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 27, cognitive 33): record has cyclomatic complexity 27 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-impact/trace.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5c847465f6118b6c29a4ce956c730199608a98b75e169e4b2b7fd74192579"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSweep (cyclomatic 27, cognitive 32): runSweep has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"643c5991298d011af1b9707e9ee0f0a0e51e41772df531a80ab14c823d1ceeb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateChecks (cyclomatic 27, cognitive 31): evaluateChecks has cyclomatic complexity 27 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5287ca5e2fd9bd49b1749c97bf8046446ed7a625ca6995b1c43c201ad204f66c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callModel (cyclomatic 27, cognitive 31): callModel has cyclomatic complexity 27 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-api.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e42243056af98f24e66b76f0b8f39afa8248cacc1a5d69238b4c2e54bb181b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createQaCallerFixture (cyclomatic 27, cognitive 31): createQaCallerFixture has cyclomatic complexity 27 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"2570d838576cbad5998cd006429687d1729658b440ef1f739e552d72d24a32eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 30): (anonymous) has cyclomatic complexity 27 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"956274b412a29f0f0c88814be9274a7c7385d44d37621af8004f4aaa67f3a00d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReviewTargeted (cyclomatic 27, cognitive 30): parseReviewTargeted has cyclomatic complexity 27 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c46d48def8e6a38420247b13ee6b4bd533219a35d7a160c0d4ce4bcfb5d1c19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectHook (cyclomatic 27, cognitive 28): inspectHook has cyclomatic complexity 27 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e72537cb92ba700707383eedb9c58882bc93379ded869a3e99ff2d81348baca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepushGuards (cyclomatic 27, cognitive 27): prepushGuards has cyclomatic complexity 27 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a9ba74863773cca686215643fd5781a385da8ae39c06faa2f342e9798cb3ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectPreparation (cyclomatic 27, cognitive 26): inspectPreparation has cyclomatic complexity 27 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42142ff43e698abcba3d007bb4314dd57c91a0cee192e5406916b3d178be81c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 26): (anonymous) has cyclomatic complexity 27 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"50248b624b26848c48b38caa2be8ea09be65b25120e23c6d1c9b463661a8168b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countingAnswer (cyclomatic 27, cognitive 25): countingAnswer has cyclomatic complexity 27 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/counting.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3364af3cb1f13d1b81e55b260c2a3ce4ccd870c0aa9258bb812e766fbcd126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShipFrozenScopeActor (cyclomatic 27, cognitive 25): runShipFrozenScopeActor has cyclomatic complexity 27 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-frozen-scope-actor.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce552600ae53cecee828bbdf83f021410e499f9d2f2307e3407392d430faedd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCase (cyclomatic 27, cognitive 24): readCase has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/junit.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3662ad401fefa82839a6228b886c2ac0aeba3384fa8324e1a3a85032763b97bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCliOptions (cyclomatic 27, cognitive 24): parseCliOptions has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b2e3e8d55fef8c5ac59447f01e6c3e2e15da9276af9095deb83e92fe69502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalid (cyclomatic 27, cognitive 24): invalid has cyclomatic complexity 27 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-skip-actor.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f863ada0d34a3498a50219019385cec14bab31323639e9dd7c3e585482dfb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNativeAutoDecision (cyclomatic 27, cognitive 23): findNativeAutoDecision has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8357501c417b595693033a28e933be7d4b95bf95101f0f62790a546981015fd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBinding (cyclomatic 27, cognitive 19): parseBinding has cyclomatic complexity 27 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ce5058e05da050e811c84d8b0b82bec8a752a93ce90fd9d4235e776767ef08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engWholePlanSetupAUQ (cyclomatic 27, cognitive 17): engWholePlanSetupAUQ has cyclomatic complexity 27 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d5ac69654c4c98dfb642c5a12dbe685c725612302ea138c057e8becaffd8e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentReadPermissionCard (cyclomatic 27, cognitive 16): currentReadPermissionCard has cyclomatic complexity 27 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32d656ef6e6ba4392f46cc3f219fc6fb025d3b7cb6da50e4ad0e8b0e43d1d61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validAutoplanEditDigest (cyclomatic 27, cognitive 15): validAutoplanEditDigest has cyclomatic complexity 27 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-digest.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcbd7f5e86ab7fa047ed60cc71ff9e46a4ff471da70be34b28449c38c5b96b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function originalSketchStaleFillTrace (cyclomatic 27, cognitive 15): originalSketchStaleFillTrace has cyclomatic complexity 27 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b04d84b2a518f3b69876b5d230ba4904c1e1c88999db5fdcdb347c72d2763f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function artifactIdentity (cyclomatic 27, cognitive 13): artifactIdentity has cyclomatic complexity 27 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e1b08d89b3d224745660ac5471e9a2a5159f8b627a0c70e3b059df2b353eb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accentedHeads (cyclomatic 26, cognitive 72): accentedHeads has cyclomatic complexity 26 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7caa64ce5dad6f4583e77f99be54d2a58973d84907fe315b5c46398d787b99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestVariantImage (cyclomatic 26, cognitive 69): requestVariantImage has cyclomatic complexity 26 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b452279473239e6041a6518fefdc861d77a46f6030a967b3efc7e8d53ac489"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskSwiftSource (cyclomatic 26, cognitive 51): maskSwiftSource has cyclomatic complexity 26 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9320e527aee88942916a2ab462092917f1c3add5ebaded937752e41aba119e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 49): (anonymous) has cyclomatic complexity 26 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-mode-routing-fixture.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b952dce4e53c3c1343946e1f1061124b7952a3b71ec3a9fc226c7f91c89bacc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 47): (anonymous) has cyclomatic complexity 26 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/content-security.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9261e3b72df87256d75b6225d5a83c2b6e5cd4abb417d70503f22d37ce1021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 47): (anonymous) has cyclomatic complexity 26 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa804c9c64104755e740f7ea2ae225ff20da01497cc79ffb9fe850c551ce8258"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 26, cognitive 45): scan has cyclomatic complexity 26 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8004cc0c209924f072b6f3df5025243f83838204d943514dff29915300a3b2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellEdges (cyclomatic 26, cognitive 45): shellEdges has cyclomatic complexity 26 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a74c3f59c2c31abb1d8164a2f7df5ff47af067e221acd9a27c4f9c0933f4119"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sharedReadOnlyViolations (cyclomatic 26, cognitive 44): sharedReadOnlyViolations has cyclomatic complexity 26 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c129dfa6065ced698ad9a1b2e190e9bd056181e8a57664917915a4ba353b733"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveApproved (cyclomatic 26, cognitive 42): resolveApproved has cyclomatic complexity 26 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b58bd833e52a4cb4d90de87a14db13e7de2439c73ac4dbfe137bbdfbd73513"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSetup (cyclomatic 26, cognitive 41): runSetup has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ca7a4cdf4022cab819776fa5ca8e085a507026f04b0cb2f697a3f93987375d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalTestPlan (cyclomatic 26, cognitive 41): canonicalTestPlan has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b4e8572e3ccc58c9cf5c15ff9b704c6e000b3ba7252af2d708d61844222071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLine (cyclomatic 26, cognitive 41): handleLine has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3e8ccc88a9b2feed87f4c976d296fe679429bfed0e8413779f2d9f144a19b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 40): (anonymous) has cyclomatic complexity 26 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"da36ebbdc206f2290e7f7c0164fd6678464e5e315f10960d9442c570ca9a23e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 26, cognitive 39): close has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c72ac57fa8cfdb9d967a3516b5088227eaa35833479dfc1945d2da5d2fde80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 26, cognitive 39): parseArgs has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d5040b005edd7defb4e5dc5f17fe4568fbe715e400fac8a577e7ff621d00cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshHermeticSkillRuntime (cyclomatic 26, cognitive 36): refreshHermeticSkillRuntime has cyclomatic complexity 26 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/hermetic-skill-runtime.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7ba9fd1da5e4d08e1f80ce81740719a55150510801c833f76a93b7ff8c935"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringAt (cyclomatic 26, cognitive 35): stringAt has cyclomatic complexity 26 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"353f59acaa7664e0c785074d2cb80a6c929d306e437846f0c2b2cd708d23fc36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withdrawsPlanSelection (cyclomatic 26, cognitive 35): withdrawsPlanSelection has cyclomatic complexity 26 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-scope-selection.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd640aa1233be31ea6473edbc778f8baf8f5b6b39b9d9063c496782b31b93dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrapTunnel (cyclomatic 26, cognitive 34): bootstrapTunnel has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa8f15935a3db9089f851dec932c5d6339210fd0057538260f6a8f1a4622db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotTypeIssue (cyclomatic 26, cognitive 33): snapshotTypeIssue has cyclomatic complexity 26 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee7072d098cdbd0c09f3f83d0f589fa005c5a9a988217aba9248d79c75c2c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listWorkflowRuns (cyclomatic 26, cognitive 33): listWorkflowRuns has cyclomatic complexity 26 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/ci-history.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52f67992b4c54a0a3fc2d8a41a59392678ec0c7ae37c676c2ecca2a3f96fe82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function combineVerdict (cyclomatic 26, cognitive 32): combineVerdict has cyclomatic complexity 26 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a901ae7fe169e73872f2b352e6d7227170f43257b30c72f6679232583cea17f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLog (cyclomatic 26, cognitive 31): runLog has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-export.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32e699810b230295a64d426a68a3119370e2f6b37eff71babba12a242232dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathSides (cyclomatic 26, cognitive 31): pathSides has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fba309bd6dd4d2e50683eed64019711546e4c74c8f2efe63eba776105c8f9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 26, cognitive 30): generate has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc6e7e64ab1476a87c3d16be02e27817ee98a497a5adb2123d3b877f313a62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createLaunchRecorders (cyclomatic 26, cognitive 30): createLaunchRecorders has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/launch.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6471305d932c2e9a58e7aa5ece8bdf88684771a8201d819cf814d056ba11a65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 28): (anonymous) has cyclomatic complexity 26 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a17fa1b9b787b4e5096cb8ce2a0de34854ace14976ec67531fd4f61da50e282"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyTrialShard (cyclomatic 26, cognitive 28): classifyTrialShard has cyclomatic complexity 26 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"50505a32a6163e86fe5aca28876376f40f078f2fb4e0705c5b0f0e012fd24bb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSkillTest (cyclomatic 26, cognitive 28): runSkillTest has cyclomatic complexity 26 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/design-detector-source-fixture.test.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b232e17c35733ee7014644dc679c0d656cd11d2104e6afb0cc8804cdaee96a79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficeHoursCompletion (cyclomatic 26, cognitive 28): validateOfficeHoursCompletion has cyclomatic complexity 26 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/office-hours-completion.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e47b6c79a77af582e8cdf4e3263ee5f4ef980942647b830757f7f47ed58d9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 27): (anonymous) has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff22459a35da05706daecc2dc5788ae3243c0bf4b847c874ed41c8bfb2bb63a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function screenVerdict (cyclomatic 26, cognitive 26): screenVerdict has cyclomatic complexity 26 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-screen.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d126c1bbc644f6337e0d938a27ddae391c290432387b479c4318eda5d6d5345"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShipSkipActor (cyclomatic 26, cognitive 26): runShipSkipActor has cyclomatic complexity 26 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-skip-actor.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfead366ad1e789cdfbf4fd2a33efbdc8fe46a0407e620f6346210d9a8310570"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function find (cyclomatic 26, cognitive 25): find has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-tree-reuse.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1be65970ccf096c4d2b6403398a2298e01cd0e376c9473f147147e506330e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 25): (anonymous) has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-review-start-evidence.test.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"593aa60e2a7819aa085319c2c48e454c39c779073b9d59b8b11ad768b4efd4aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function release (cyclomatic 26, cognitive 22): release has cyclomatic complexity 26 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d72e5ab81f73004a6e81ead62c82827d7731dab6b2ef0b5e3f3e2aac3ba2c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordMeta (cyclomatic 26, cognitive 20): recordMeta has cyclomatic complexity 26 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f801701b18f537ef720a02dc655cac03022e985b50fbd0729c43f5170b8a6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateVerificationRequest (cyclomatic 26, cognitive 20): validateVerificationRequest has cyclomatic complexity 26 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"da97440bc87dd21c94560cabb74397b3a880f0ed30532cc80315a11d31765311"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glStrain (cyclomatic 26, cognitive 20): glStrain has cyclomatic complexity 26 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa12095248cf6bb8c47a26f09f616d067564a0937a8f2f016f4305a2eff6b19a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optionalFieldProblems (cyclomatic 26, cognitive 19): optionalFieldProblems has cyclomatic complexity 26 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a7decee538c0c728c2930bf089e28c3b823ee55bb6c03801655dea87546bd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 18): (anonymous) has cyclomatic complexity 26 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"338a39130740b2073a224b4e991685019b93765adb7ae36f1f69ea36d3bc1af4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePlanFloorAssessment (cyclomatic 26, cognitive 18): validatePlanFloorAssessment has cyclomatic complexity 26 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-floor-review.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7915f3cbeb43fcc100b0b836b1a54cab51d6ac22d9636304de3ce367cfa8f66e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFloorDXReplyInput (cyclomatic 26, cognitive 18): planFloorDXReplyInput has cyclomatic complexity 26 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"581c44fa2a5d0ae95f1b57f6c1e99242fcb5d8fc8ab33640ce2c282788f87e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validProof (cyclomatic 26, cognitive 16): validProof has cyclomatic complexity 26 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab4818f73ba703f6993a96aee0d9cdcd0c4ce3d5c6c6443933ce910dc5ffd50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readQaCaptureRecord (cyclomatic 26, cognitive 13): readQaCaptureRecord has cyclomatic complexity 26 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5d826fa5b2170cb35a5e7cc0712dc15e1347bb331c2854eae5ed945bfd6e10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAutoplanMethodologyBinding (cyclomatic 26, cognitive 10): loadAutoplanMethodologyBinding has cyclomatic complexity 26 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-method-read-audit.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"acde9a776d98f81232c10e7be40ff93c414fc04e1cdbd20f0876bbf874ce82fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkWireframeSlots (cyclomatic 25, cognitive 55): checkWireframeSlots has cyclomatic complexity 25 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd268299dae9934ed093b8cf1d4588ecf3198c15f555b5a77e64e2df2c255f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function policy (cyclomatic 25, cognitive 50): policy has cyclomatic complexity 25 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-hook-scope.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"90548e14468f003a95edc867e89a0ff914701cde4f253c764e487fd9c15f6d4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apiCall (cyclomatic 25, cognitive 45): apiCall has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"71536db69aed2e85e0b6efb8379f24cbdc51e842677fd7589150f5ca08327581"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePrWaitArgs (cyclomatic 25, cognitive 44): parsePrWaitArgs has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"521a9162d18d1bc473902d1ce0172e48eafc49b6cc4510086d3ccc5acd427d1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check67Html (cyclomatic 25, cognitive 42): check67Html has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"df82a06c9a6c6e0a8a9242cb64d861017fb07011a26424ebce652df72a1abbb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTranscriptConsent (cyclomatic 25, cognitive 42): readTranscriptConsent has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/transcript-consent.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef604c0cab8a66f033e6196af8fcf74af560371f0402b86f7fa4c0490ee11349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintFence (cyclomatic 25, cognitive 42): lintFence has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/generated-bash-lint.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"686c50fa6bfc51565eacdd35ca78d2bd30bfe2cb2c261e872e4a4055488ae631"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceReadTrace (cyclomatic 25, cognitive 42): sourceReadTrace has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-shared-libs-paths.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b4f7637b4acc66caf138ea31f9f539262a52daec1ac44a08c9404127446369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainDoctor (cyclomatic 25, cognitive 41): trainDoctor has cyclomatic complexity 25 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-init.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8bd3a6bf7ae5c6c6d9d34dd7abd7117d05d95b82e133cac8870b6ab105c16e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonDiff (cyclomatic 25, cognitive 40): jsonDiff has cyclomatic complexity 25 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/stamp-only.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be962b6ed4f6e3246b0347f41b22bdada181cfa1db7e2ecebc291b6875da6cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 25, cognitive 39): walk has cyclomatic complexity 25 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"234b306ff4ac0cc24d89412d0b3836758649199fd959e3962a740ce603883963"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripMessages (cyclomatic 25, cognitive 39): stripMessages has cyclomatic complexity 25 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac55a0792f74ecafecc43316f823aad67d323a2396017d34c5860c597d55d20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ledgerBlockers (cyclomatic 25, cognitive 37): ledgerBlockers has cyclomatic complexity 25 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7c601af107938dd0afbb946c162151d2eed5f5614d944ff421d2efc5808885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 25, cognitive 36): fetch has cyclomatic complexity 25 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"de654816313dfc70ebd5123e60d49c065f387c7ddbd401ed1cbfe0d1bb175c0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairTimeline (cyclomatic 25, cognitive 35): repairTimeline has cyclomatic complexity 25 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7c28f3a1bb89d8579cb4d5b8fd18288ea1280e7589cc337bb0155c2176dce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wavePlan (cyclomatic 25, cognitive 34): wavePlan has cyclomatic complexity 25 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1291a5aff538e1c4d9d6b99a0e03372e84e4e8f8bc8a22aceba5347258a7bb70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHostConfig (cyclomatic 25, cognitive 34): validateHostConfig has cyclomatic complexity 25 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/host-config.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb483b913d23dc28abe1f8b47d21de6c72506a43937d63ef0bb61f3fc3c7aae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glMarks (cyclomatic 25, cognitive 33): glMarks has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"600e756ca355e615c6a6be3cef3d5358d0784cb3825fb0baa56ac5ed8f7163cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 25, cognitive 33): execute has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ship-skip-actor.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b71cab29df07444a98e0ba12e0902490f2ec62acd0e1d9cf6bac62cd6a029f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 32): (anonymous) has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0b82221aa78d6736745bd8bd8b8021bc5b025dba990d13f07e0150ba9edebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTailnet (cyclomatic 25, cognitive 31): handleTailnet has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf73515fa8b553024fde69b9e7d51fabbca1b18e2a68590de9651b77c052a9c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewExclude (cyclomatic 25, cognitive 31): reviewExclude has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed730dab617adbd99d4aa078eb31e8eac1ab3e4bc63a54329eccc787db54911"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 25, cognitive 30): exercise has cyclomatic complexity 25 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-shared-libs-paths.test.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0d0f86f5fdfe8d0d9ef3ae68d11e1f944f13675c506ee10ba195aaf31d17fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forceRestart (cyclomatic 25, cognitive 29): forceRestart has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c31ac77ac449786cabcbb32bf8996f30d02c2a08847efb489d5c12e8b8e90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectModules (cyclomatic 25, cognitive 29): selectModules has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"65abc4b46933464bfc6909e784560cafe73e0f5c71fe84bbd0b83c0f06434acc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueOrderCheck (cyclomatic 25, cognitive 28): queueOrderCheck has cyclomatic complexity 25 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"367e80e6ed65131124bb8f481d5c4951ce6d647a48bbfbacd5625028a7067c35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tagHunk (cyclomatic 25, cognitive 27): tagHunk has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/tags.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"342fe136a5d38f0725e7dbcd4a69d9b750dffce844291d10d78893f133ae4af5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLoadout (cyclomatic 25, cognitive 27): renderLoadout has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-render.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b68ff3ac755a47a5ced3a0bac18f43dd656fbbb028bf21be58a609cce2e839"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 27): (anonymous) has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-plan-actor.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2c6358d88022c33530737e93c6ca49f53a50a631c4c157fd8b9bb9646015a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 27): (anonymous) has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b30b6b736d3c731eb6040274d528c45ceef44e13f7941c85888a6a2c5d7de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 25, cognitive 26): observe has cyclomatic complexity 25 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"443832a6f5c316f72bc765f17182d5d097a757f0c96c04453e7217dd0c2f21cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 26): (anonymous) has cyclomatic complexity 25 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a363a85c30b9426f1ae19270631c62f0a23d61c2b63d161d21a270fb69b8e46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importNativeCookies (cyclomatic 25, cognitive 25): importNativeCookies has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7846110d48eac5dc8e3858cb51b6c97471aab3e95638dc2bc27d32e5ff0dfc25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowProblem (cyclomatic 25, cognitive 25): rowProblem has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa8cb17ef6284c6f026d6438b1e0309e2143fb91faa45315abba137e98f4f50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openRelease (cyclomatic 25, cognitive 25): openRelease has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/release-stamp.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773628677f9e24410975c04cb4d265436e1be916a4ab8ba226ca2b1ae677067"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDocsCompletion (cyclomatic 25, cognitive 25): parseDocsCompletion has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-contract.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"af99861428d4cfe58da30dddc9069aff25daa0031b17651d63654b6cc99ac871"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 25, cognitive 25): (computed) has cyclomatic complexity 25 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ship-skip-actor.test.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1cf926b260c82db6c989130cd63bd296ba2f74dffa007e7fcf8cda6cf6275e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdVerifyHandoff (cyclomatic 25, cognitive 24): cmdVerifyHandoff has cyclomatic complexity 25 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c7e31eb9b6c544338457a4edf3723d484e0db0f0f864a7dcdda98af649c3e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePortableSkillPayload (cyclomatic 25, cognitive 24): validatePortableSkillPayload has cyclomatic complexity 25 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22b13e5d1ee10d3168fba8834a7c7e13ebaef39e0b4852a52ce80186cabb5f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainInit (cyclomatic 25, cognitive 23): trainInit has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-init.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e878359ad79dc0c28d9dcf7b8b57a2e3635529759a80af0ec2e08d0f831f3444"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countLoggedCalls (cyclomatic 25, cognitive 23): countLoggedCalls has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-call-log.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c602a4f89404478e24a1fe307f336103fa22fd21561402e77123279693a5bca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareLaunch (cyclomatic 25, cognitive 23): prepareLaunch has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/launch.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"958ac9115ef00825e8b12e44f432b47ff00bfd5b20698da1889a22714973ecec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishArtifacts (cyclomatic 25, cognitive 22): publishArtifacts has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64cae254ba64ec0c6d1bd7fa75111bc2c72900f96d783c81bc795b2a27e8d9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 22): (anonymous) has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"61164bd37297587da4f0287d48e817c0be74f4ff95c9a01909eaffc63200144b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startTokenOutput (cyclomatic 25, cognitive 21): startTokenOutput has cyclomatic complexity 25 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8889db489720163c9fb0598b2c28a508ed33f52a0320070ed713b8955a03c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countedPerItemChoice (cyclomatic 25, cognitive 18): countedPerItemChoice has cyclomatic complexity 25 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbff4363a01788bd2d827da4e7a6fb4a61e8d3f0d04d33b393b302d21088c6d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStatement (cyclomatic 25, cognitive 17): validateStatement has cyclomatic complexity 25 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-runtime-promotion.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a02212884b2c939882301f00c1e04dbc1ac808ef9aa5c11eb796c7aaa1245"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alternateOrderStaleFillTrace (cyclomatic 25, cognitive 16): alternateOrderStaleFillTrace has cyclomatic complexity 25 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e878c3795de33ac9b4b3f5ef07e2d7cb9c2a74466e6e58839e48401910216e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfflineReceipt (cyclomatic 25, cognitive 13): validateOfflineReceipt has cyclomatic complexity 25 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1890049265c98efa6c4afeb166d69ecf4946197a75553d453aab35a4261374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focusAndStates (cyclomatic 25, cognitive 13): focusAndStates has cyclomatic complexity 25 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b731f0e2e54d84864e923b069be1d4e7bc76d51f8b5c0d7785009581f30c06a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStableWith (cyclomatic 25, cognitive 12): readStableWith has cyclomatic complexity 25 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"57025b34602189c7ac8102238e2d62db12f05a1a656f35eebbf5a54ea80dab76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateInput (cyclomatic 25, cognitive 11): validateInput has cyclomatic complexity 25 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c1503d3060b40a4829a81f3ea8be553db1ce01639b4ef7780eb4511975f892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 71): (anonymous) has cyclomatic complexity 24 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/review-depth.test.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef408928bfbb5f3a9df2c5476ae778b2d64f6e0826b8357e6cab3ab42cd8b48a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packByRecordedDuration (cyclomatic 24, cognitive 58): packByRecordedDuration has cyclomatic complexity 24 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-plan.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f742a8fbe10da6b653ba2e4a09bad3b9a1d6c5c36ab65c1f4c7dcc3aa415a772"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grepFixed (cyclomatic 24, cognitive 52): grepFixed has cyclomatic complexity 24 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95f07de1f03cb053078a5128bbf64e09aa4c72bb60d086baa5c8ab3fcc7d451"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanTags (cyclomatic 24, cognitive 49): scanTags has cyclomatic complexity 24 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d1e2cfe1fcd2f09ff878705a27fc8ebbc48cbb0a93bcb6ad0b782ce8f0b22c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quiet (cyclomatic 24, cognitive 47): quiet has cyclomatic complexity 24 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bootstrap-retention.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc0a6b605b460cdd8a3c7ffd04d6a07f7db0cee2d887cb9cdacc1d57fb4c93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sameCallStartRead (cyclomatic 24, cognitive 45): sameCallStartRead has cyclomatic complexity 24 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"885cce5d84c57ed50bc6204d1ba20ceed4411159bdeb065e0614f0c07176d00b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateAhead (cyclomatic 24, cognitive 44): gateAhead has cyclomatic complexity 24 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe4fb16909a17f4078df588cd0ed1339102440b2ff770decc2994e22d13ff30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedPaths (cyclomatic 24, cognitive 42): boundedPaths has cyclomatic complexity 24 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0b49433480b3f4ffc4377d847c1e72e157de91668309482833f3f79ad59d72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulateTrains (cyclomatic 24, cognitive 40): simulateTrains has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b0ac8f270ea95fcb045b1a7da19f2f6cfdefd35e045beb7eb71b96bcc418d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitBots (cyclomatic 24, cognitive 40): emitBots has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"904ce89b81ad45c7eadfe4fdc3edf94ed6e4612d004d2d3c39257b87b614f2d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderWithBrowse (cyclomatic 24, cognitive 38): renderWithBrowse has cyclomatic complexity 24 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c9bb5f3efc58de70d81f1de46a03f987b44f4335a29d7a698c01301aa596a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanIncoming (cyclomatic 24, cognitive 37): cleanIncoming has cyclomatic complexity 24 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"979870c03a5a3fc8a5edddaf542595e26c67f9bba4bda204759de5cce1e280a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareEvalResults (cyclomatic 24, cognitive 37): compareEvalResults has cyclomatic complexity 24 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba18e86eabeb6ea407aa3e53264e87285c750813eae9b78142a073dd276484e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRecordFindings (cyclomatic 24, cognitive 36): parseRecordFindings has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea3f86c60cb5da29997897eabf70455b7f341b01ad6cb168ffa6f1d8d311d27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEvalModels (cyclomatic 24, cognitive 36): parseEvalModels has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-models.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa374ebda77742020707498b6bf28f7482ba6b570c5d65550d4e8a03616180b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRun (cyclomatic 24, cognitive 33): checkRun has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-stop-gate.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"129c830a673764bba596a9b3e75b215f6f06f5f1d6e408a3f3a31293bc76c29a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateAcceptance (cyclomatic 24, cognitive 33): gateAcceptance has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d316f32633537014c5a722318ae91c47222730b1d4e4430854f56d215e62f913"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCodexJSONL (cyclomatic 24, cognitive 32): parseCodexJSONL has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-session-runner.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac6b7d5e601f6b7fd7dff42aa2474331d1dd398419fc1e14ffaec2d65b5606c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOverlayTrial (cyclomatic 24, cognitive 32): runOverlayTrial has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/overlay-attempt.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c875038fad2bfbdae52f412850d9fb0ebf0e79215dcd17c66e3bcd958033701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 31): (anonymous) has cyclomatic complexity 24 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c8cd6a572d26938613ec5c63d55ac75e13077a4a77da729dafa3b406766872"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 30): (anonymous) has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8330ea975fc1db3f80343b249ba861bf88ba3522ba514eff389c67b2b1929d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uidSidecars (cyclomatic 24, cognitive 30): uidSidecars has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-sidecar.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa12dada3afa859e385c6da8728e3ac2273d10f6119dc2bf7629c7c7efaa01d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalize (cyclomatic 24, cognitive 30): finalize has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ad9cbed1dfcb3608d780fc5063e10eed512d0677878bd81d91caa6f035c945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 24, cognitive 29): record has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-owned-journal.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef3b4896c458f4fb1993589fe679222e6855a6912d11f509b5009cafd4545ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyMerge (cyclomatic 24, cognitive 29): verifyMerge has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land-direct.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02c2c875d77f11e56bf4313a1ccdda8ec912f000b5a9208acab2d1ffe2eaee2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replay (cyclomatic 24, cognitive 29): replay has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/eng-test-plan-edit-approval.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb3536c463d2b12c72804435e3e77bccc775ddf86cfee53ca73c0a4d7448156"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOffline (cyclomatic 24, cognitive 27): prepareOffline has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e78e81184d0dc5b8b6413b59a1a685730482c5045f02ad2766cfea161c64c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateScannerRequest (cyclomatic 24, cognitive 27): validateScannerRequest has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f970b9981be0c5bbdeae6c6f6c5c139480ce8a5ac5e4bde2c3cd9ab112ed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPreregDiagnostics (cyclomatic 24, cognitive 27): runPreregDiagnostics has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1bb5c15766adad8bf52014824a13f47477bb767f4eb2050ce3fba00272028a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGeminiStreamJson (cyclomatic 24, cognitive 27): parseGeminiStreamJson has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/gemini.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8822baecd8db6c3c7e2f88566b2647a155ba58da4f08d96c6dc6b1b182a259"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gh (cyclomatic 24, cognitive 25): gh has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/train-backstop.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4bdb75992b44e59f52785125e295f71341d4f03045ad25a2ea9d21ad64a4f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planCarry (cyclomatic 24, cognitive 25): planCarry has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1bc31d7c9b9fa5acbc49664d467cd555e710eddd362df00d146e463745bc11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resultFromClaudeOutput (cyclomatic 24, cognitive 25): resultFromClaudeOutput has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ec1a82446949f3d3433b18cb9b065a981869e36ef2f3d90993a42f1c3c6c13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiptDepthVerdict (cyclomatic 24, cognitive 24): receiptDepthVerdict has cyclomatic complexity 24 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dca81916273a1e12d9f97d79facbe42d68a94e3335c4680d8528e063b7f558"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dryRun (cyclomatic 24, cognitive 23): dryRun has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b180b8d1ec306ff3f11a5ecc6e7fa8e31ceaf63cdbe80ca09398ab85e7c2e0e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function floorQuestion (cyclomatic 24, cognitive 23): floorQuestion has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed643ff660ad24632b36cd619aa0e1a729228b29053f64f59e443bc29341d84a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderOfficeHoursReview (cyclomatic 24, cognitive 22): renderOfficeHoursReview has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f291c00cd5a0e8bc3240145f7a1a04b46e63ea02ac454a2a4caec1aec47e2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repair (cyclomatic 24, cognitive 20): repair has cyclomatic complexity 24 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed3e50d06c52f7094204f3ff6172694efa92befbe83eb00cd2ba3688bf6fa0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPublicGhcrImage (cyclomatic 24, cognitive 20): verifyPublicGhcrImage has cyclomatic complexity 24 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa62d4ee7fa403759a47641fa48f7ae258bc3ae309a72c25396341c7a8c9d1ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextStep (cyclomatic 24, cognitive 19): nextStep has cyclomatic complexity 24 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aa00ebaf30879d5184ee24c4676985d52215dd24ff285d52a6f05fb5d67fd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 17): (anonymous) has cyclomatic complexity 24 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab7d535e31888e39d5fa372981ba7ee447cab517833cc5c2005f453ebf940aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engDependencyBindingAUQ (cyclomatic 24, cognitive 16): engDependencyBindingAUQ has cyclomatic complexity 24 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c91fcc2d8c42686cf81318f31ed8bfee0ba726106b9518a974199c98c99bb8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 15): (anonymous) has cyclomatic complexity 24 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7b27ef1b005a5d2bcc7c58d7564219ed16d1d7a549e2bb5e91127de4dad125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ceoModePacketTabAnswer (cyclomatic 24, cognitive 12): ceoModePacketTabAnswer has cyclomatic complexity 24 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adb071516cf1043d1026be8261c2935554de56a77a894634db8dab0ef31b33e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePassRatesArgs (cyclomatic 24, cognitive 11): parsePassRatesArgs has cyclomatic complexity 24 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f217c05ae40a5c81da7926233b0ab1300e65062d50d28c7b0e29a46367b5a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 11): (anonymous) has cyclomatic complexity 24 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-hold-posture-review.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca8f3cc37b4275727a19e0d51266f3415cea93b3001db52788f651bd20a4dad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownerSpans (cyclomatic 23, cognitive 48): ownerSpans has cyclomatic complexity 23 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc94cd6cc69ee04be1a067afd6308012740264e069b74f8ba39d98c8d42ba69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNDJSON (cyclomatic 23, cognitive 48): parseNDJSON has cyclomatic complexity 23 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/session-runner.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee2e11966e895831cfe6794fcd34792da44b7b1fb4be2f595f5fdda1972ee6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSet (cyclomatic 23, cognitive 44): runSet has cyclomatic complexity 23 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dcc85788d8e7c78b323dc327ebca9be6d04249918569bafe554eb5ca2b49a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paneRows (cyclomatic 23, cognitive 42): paneRows has cyclomatic complexity 23 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e618c7cd55491f9111d84c24500ad67792c6b4460f4ac8e72165dd015a1d1c6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function referencesIn (cyclomatic 23, cognitive 40): referencesIn has cyclomatic complexity 23 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc422cc6dc411db03e05fb2d5db75fae193888e28860235e676377122298967"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumersOf (cyclomatic 23, cognitive 34): consumersOf has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/literals.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a343e2fe929b23c17cc4210c21f08401e5c29353c950f03514ccd3313135a27e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function census (cyclomatic 23, cognitive 34): census has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a78684f38ed5e3e8131dd6f9ec8bb5a5af4506decb2930561fd1eb6435cbfdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadInput (cyclomatic 23, cognitive 33): loadInput has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"503e59a4e2abc5ce0e826a5e0bab42d796b80209d0e859e1791fc4d37cdf6e6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 23, cognitive 33): run has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/guards.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cf208716d41bf6230cffc72dc1efff41dc9fb3dbd1b0e612c678c68528fd2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOwnedClaudeTranscript (cyclomatic 23, cognitive 33): readOwnedClaudeTranscript has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/owned-claude-transcript.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc947c5611c6d8773bd0d2f36af3e37e149427049fc61574c46c4bacf9c1213"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSkillParity (cyclomatic 23, cognitive 33): checkSkillParity has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/parity-harness.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4b6707028cf6365b21f5f13944295d2e932f686d47b269e826ffa9dc4563c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startPilot (cyclomatic 23, cognitive 32): startPilot has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab585e7848ec23318dcc8cd6b29a16b9c3f7c79634f25b18a1d20a880875186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function message (cyclomatic 23, cognitive 31): message has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"0676e76efca76bccfd9da19199f77ec6261384fccec3dcbfb48d0a7da8d3e60e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execution (cyclomatic 23, cognitive 31): execution has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-review-result.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79bb318845f046291e912e997ce7a69755b409cc8d463f7c88604cb79d7104e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrationReport (cyclomatic 23, cognitive 31): migrationReport has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/regate.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea4d1ac945bcd411eafbc6bc47c4a5f9c9e8e14ecd58292c617263c87e72d8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsToolFailures (cyclomatic 23, cognitive 30): docsToolFailures has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f9f2d2cfe31ea7a116a4bdd61bb11cae8288e5298704e48acbe45d710315f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyVisible (cyclomatic 23, cognitive 30): classifyVisible has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/classify.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12be8561ef48c0670408104dcccc94f629c1c728468fa3e8c4fac99eb6c69a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSchema (cyclomatic 23, cognitive 29): checkSchema has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6588f54f38d3196365faeda91e3b92f98eda0adc6b98ca05268283a257c09d65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCaseDiagnosis (cyclomatic 23, cognitive 29): runCaseDiagnosis has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"287eacf37703778aacc78239b95d7353305c64ba0894fea8475761427b2e6cc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectRound (cyclomatic 23, cognitive 27): collectRound has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdac3acb333eb34e11a97c71d811d3c092a333877eeaf4f487f131304153b44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStamp (cyclomatic 23, cognitive 27): buildStamp has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a234fcb3668d2e118ec71627edba95d1cadffa61f1bdef54a672a5fd98374c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function croppedEditTarget (cyclomatic 23, cognitive 27): croppedEditTarget has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb67fefe8ce5a44b86dbf11f734fb0f00db5669c585584440b9f14a3ecbc812"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureDraft (cyclomatic 23, cognitive 26): captureDraft has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-lean.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"522ba22fa97a3b069a09af6a33a0db00882e106d6cb3d97e9795bd80ebc8ca89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preparePathEligibilityFixture (cyclomatic 23, cognitive 26): preparePathEligibilityFixture has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-path-fixture.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ac932ea2fdfa5ce80f6732417b3881670f30b8a66d9efbbaf3b38a3aa3a345"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 23, cognitive 25): handler has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/pairing.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"385c4032871a390c2b9f2978e720d48639f39ce91d3e9dd6f4d9c959245b13de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 25): (anonymous) has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-deadline.test.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfad4be8c2206f269b885e54625e4d1d92665ef09d0e65630b7163ca72437a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCiGateArgs (cyclomatic 23, cognitive 24): parseCiGateArgs has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c85598b72fac2743474b8baf207856b2957265532e758bd5663fb8c6c597cf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStart (cyclomatic 23, cognitive 24): parseStart has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"354bc6c44444b4241059a503a7f41725dded271b82a3a776c495ea981cc4c897"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatErrors (cyclomatic 23, cognitive 24): compatErrors has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7519637af322e711267febb2b37eb7ade421fc04e5ad6e847fa61bc4642cbc36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 23, cognitive 24): run has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gstack-post.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a66e1395f2d37dbfe353bbbedad989e7f965b16874e5a48b3fcfb61ae5900a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCodexSkill (cyclomatic 23, cognitive 24): runCodexSkill has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-session-runner.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e4d4869af396ac62378d56a41bdaf03f30c0e5c7aa1e318cb70980bdac5740"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failureCauseOf (cyclomatic 23, cognitive 24): failureCauseOf has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"77213ac69f16f6607df283dd7aeb3a64c82d45f572343ac3fdc883adc4fae97e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeFileUrl (cyclomatic 23, cognitive 23): normalizeFileUrl has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/url-validation.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3f437d387079f98918326e498ce006587cf22ec0fc8aa56b2d53869fd4cf53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideDaily (cyclomatic 23, cognitive 23): decideDaily has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cadence.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aa57d7c4fd0d24e71d7784ccfbc34a2a8da1df3ee06a7c0a5b0b9abff536a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 23): (anonymous) has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"991785693dbf189dab4de04d58fde1e48c7219c42f97809b69a7ac622bd5e93c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hookPlan (cyclomatic 23, cognitive 23): hookPlan has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"14986518745e8b1863a9883779e86e6b2e1089a96958fb12b4ac86263dfcb537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShipDocsFault (cyclomatic 23, cognitive 23): runShipDocsFault has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-fault-eval.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"02645b07e8fa319076ee64a24b4be1cd7a563974997214c2f9c2d9b62a589c11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function landedIssues (cyclomatic 23, cognitive 22): landedIssues has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdd387834124c1b0dd42282785d7536187e974ce7cbcaecc0253dfe9ee78b14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPlanSkillCounting (cyclomatic 23, cognitive 22): runPlanSkillCounting has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/counting.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ae19420f226fefd4c1d13fa5a61b846bfa0a37a814730ebba19b26ee0ab89d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderReport (cyclomatic 23, cognitive 21): renderReport has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e43138974e18569b7b38c5284bf68eb3c2cdb9d6f59bfb3a5bea17a50e37710"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAcquisitionOutput (cyclomatic 23, cognitive 20): validateAcquisitionOutput has cyclomatic complexity 23 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4806131cb374d80c9bb6452e710b568b34e269ad74998e032cb350c3bd2734d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentWebFetchPermissionCard (cyclomatic 23, cognitive 17): currentWebFetchPermissionCard has cyclomatic complexity 23 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"10730230718198617d9438cbe1d0ba15c1aa13f5464b1c84e4f303dea3b237fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stop (cyclomatic 23, cognitive 16): stop has cyclomatic complexity 23 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-observer.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8d85397daf1112d06b8219e05f54a73775151613daf31e7d1ca1d3557008fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createPreparedExport (cyclomatic 23, cognitive 15): createPreparedExport has cyclomatic complexity 23 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c639879031c3a10984af3396987517713d08be8d9a0249b8b326a1470490711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canApproveEdit (cyclomatic 23, cognitive 13): canApproveEdit has cyclomatic complexity 23 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-recorder.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8a28ca5ec22851355ba14224afad93bf2faf2239d9aec7f55dbf2393cae89e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateArtifactInventory (cyclomatic 23, cognitive 9): validateArtifactInventory has cyclomatic complexity 23 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d24b341f90b3233a27f74cb0e0e22c1ab9cddd7242cc5f2371cde138d3eda5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listProfiles (cyclomatic 22, cognitive 49): listProfiles has cyclomatic complexity 22 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"496569d5e06bd8929c1221e51481ff36268d609410a6ebf72f2eff08960ffbdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractGbrainBlock (cyclomatic 22, cognitive 44): extractGbrainBlock has cyclomatic complexity 22 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ac4f71a6281803b02525e6575add9425df6d2c9c6027363cb5e494ffc014fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateRegate (cyclomatic 22, cognitive 43): evaluateRegate has cyclomatic complexity 22 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/regate.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b6e2104b27d5fca83d2fda2435cf753653a644d2380ff189389dca0271a5c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redactJsonFindingSpans (cyclomatic 22, cognitive 42): redactJsonFindingSpans has cyclomatic complexity 22 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed205d021b320e1e37684c6225dd00eb8ee0b5cbac98913ffe6d61a9ef161ee4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clsLits (cyclomatic 22, cognitive 41): clsLits has cyclomatic complexity 22 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a81a23eceb72a1d24ecc140ed6e48fee73d58897218e3ebd6bc5d67e4eeca3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 22, cognitive 37): start has cyclomatic complexity 22 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2729c770f9402438b0437eb8311fdf8315649db5bb0a5623ef8b84db538fd65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tag (cyclomatic 22, cognitive 36): tag has cyclomatic complexity 22 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4680ed99b049ff4d9e16b7a47ae1472c039358046c0d80155489fc1fc673cb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanCandidate (cyclomatic 22, cognitive 36): scanCandidate has cyclomatic complexity 22 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c241c6eb79abdc41be26c7fe926510fe65a3bc89cee26458c45d5c39b2ec2b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyBundle (cyclomatic 22, cognitive 35): verifyBundle has cyclomatic complexity 22 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc13bb76e24b012f910242c333f32a47b181699680c256c3306a4efda53af72c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatReport (cyclomatic 22, cognitive 34): formatReport has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"274a27b6b0f55f5471b9e2808d1ad8738dd96eb474799ce70a5b18d0b5d97b6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundKind (cyclomatic 22, cognitive 33): boundKind has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e54004b71f878a2ca1e27d8686ffe33f639e4853d03b84568ccf9eb682ef9f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 22, cognitive 33): report has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc3066773244de496ed988d554c4fbaf52aa326994b79ceb3ddb3684dd0a89c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watchGeneric (cyclomatic 22, cognitive 32): watchGeneric has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-watch.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4594606ca04d50e979159ae8a899b056d97e32da9633de1846edde3b36bf271f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalRemote (cyclomatic 22, cognitive 32): canonicalRemote has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/remote-identity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"53472b7d19c2a7fca9588d7bf2acd9d1d4327efd0a3517de29e69bbabfcd3aaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 22, cognitive 32): capture has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01d37fda51bf8ddb2ae880542c4fbead664df739dadb35bfa4972cffeb675a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseQuestionPrompt (cyclomatic 22, cognitive 32): parseQuestionPrompt has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"827d8d634fe54e7fd42f918605c918766e9da79d04f76f11b1d75850b0af6d08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startServer (cyclomatic 22, cognitive 30): startServer has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0f7dd5d2b092f63175a3c6931dc5ae48ef52dbb4cedbb2512e590978a51983"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseScreenshotArgs (cyclomatic 22, cognitive 30): parseScreenshotArgs has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb7e7d5b079c48e885c27ea2eedbe5ccdc2bec463950ce4f1872ffc571e85fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearOwnedFixtureContents (cyclomatic 22, cognitive 30): clearOwnedFixtureContents has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fff67e2bdb55d6915457724826118e91ec4f82a774642fdeff8b3dd15a36b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareOffline (cyclomatic 22, cognitive 30): prepareOffline has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"105ded30427e472be78301de475b72cf1f3345ee7bea44c0347105b9a2106e93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeCensus (cyclomatic 22, cognitive 30): computeCensus has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949eb024cd481e328ad046fa86da92086cdb26a2fb7f0d76f96666240d1f7e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resultFromCodexStream (cyclomatic 22, cognitive 30): resultFromCodexStream has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/gpt.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc82eeb6bf607bb0931241025893e204616e9a088bb503095fad216f13822d93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalid (cyclomatic 22, cognitive 29): invalid has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-frozen-scope-actor.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de869f406c8703f9c1d237a661c5a16586911b5c44970e05f57b54231a02691"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestChecks (cyclomatic 22, cognitive 28): manifestChecks has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aef2697ac9d2748376a8008f121c3086461b4b50671aabaddcd4fc51d7483d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWaivers (cyclomatic 22, cognitive 28): resolveWaivers has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/waivers.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3445898bc1149bc34b8601f4cb2ce4238d2cb5f601cd92b1b9d51a36624a43f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSelection (cyclomatic 22, cognitive 28): readSelection has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"697e867aed0c84d7e1a6ac34b12893b67b6bf74fab8ad6636aee229ed268389d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkOrdering (cyclomatic 22, cognitive 28): checkOrdering has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/carve-guard-checks.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a7ff69363218a235de23e443293f830d0afc87b34a64b3bd9d700b0960ba28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainRebuild (cyclomatic 22, cognitive 27): trainRebuild has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8785d2ae87b43b6e49dba31916754e0f6a6d873278ba611c478a7b641bc50278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexSignals (cyclomatic 22, cognitive 27): codexSignals has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"95023d286c5e1d7c4143c66b9efc0786db7610ac5b407705a3bfe021f5807222"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 27): (anonymous) has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-ios-device.test.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984151b7be228f891cf0e1b23ef98503bd4bc672406391f3fd4f521075f2341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRealityRows (cyclomatic 22, cognitive 26): checkRealityRows has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"79728a01ab76f7a564f58da0223dfef0c35f3e55879595af921bd7487c548711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function floorTick (cyclomatic 22, cognitive 26): floorTick has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10ce684063de8a68388c2acabf93cce6fbb1dca23fcbcd3ccb8817c99ce7590"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIssueList (cyclomatic 22, cognitive 25): parseIssueList has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdc70d9080547d48afbd56a0f091e7afb2fec322221d51011e99863ad86e5b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJunitCounts (cyclomatic 22, cognitive 25): parseJunitCounts has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-jobs.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48766b0502b9b7f0f15f8ac624967d2b77f1a10a1534d66ab770d6419291d85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planDaily (cyclomatic 22, cognitive 24): planDaily has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6589066fa7d495c6bf814d0e8a63c24e2afe501b3900a95b2cb098e39a2711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquire (cyclomatic 22, cognitive 24): acquire has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de31757215461c6f87f01f8002cefb068628434db1227b0ab09ac52ab7c9af9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyImport (cyclomatic 22, cognitive 24): classifyImport has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec3b40c1d6b6c0b092712e5c8aae3345de84f3bff40c9990aca1cfc9312141f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPregate (cyclomatic 22, cognitive 24): verifyPregate has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf35ad1016843cfbe60c0c332db78582dc6c0adb5f97b5746942b69f99b04df4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiptSummaryLine (cyclomatic 22, cognitive 24): receiptSummaryLine has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce699f0758bb3b3aeb9e3b60652e42cc294d81194a9f3e0798f109ac2cd81f61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classErrors (cyclomatic 22, cognitive 23): classErrors has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef782dd48c35ab5d02d0fb2c0eaa2b292839a11513a4a7ffba00ac7866fea4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glPhotos (cyclomatic 22, cognitive 23): glPhotos has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff12cbf13ce90e5d937ad57459d06a041a5d1b6d408757a5529ef9d3360552b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffLines (cyclomatic 22, cognitive 23): diffLines has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b68df756b32042e41d275e2986f3dc898fea5986a0b2332eaf56c85f7b65201"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 23): (anonymous) has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-checkpoint-evidence.test.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd21a26d5743c8586b38e7491a899bfb850f4fd44172f4aebf0ae3c87e82eef4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 23): (anonymous) has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-qa-workflow.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc2f1707eb73a8d3a549fbc1082f1462a5dd83f51806316de94f646b1476813"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentStatus (cyclomatic 22, cognitive 22): agentStatus has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f94c028a0e55e5e40f650fec2c3746b09ccfa90c489e809a9dcbcb2cea91e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shareProjects (cyclomatic 22, cognitive 22): shareProjects has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/static.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc59192fdd44945338c558fd344aa549457ce4784fa78ed2750ecde86c6e7e77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function targetedDelta (cyclomatic 22, cognitive 22): targetedDelta has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-targeted-delta.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"da15a605d960060f0d39da149e98bdb5a746214ed93de60ad6126f9e665f4743"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInventory (cyclomatic 22, cognitive 21): parseInventory has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5038b2c6b0ff5544006ab6c7133edbda7059303ee5b77d118bf344a59f2eff1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 21): (anonymous) has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0f4e05e2e723d9507a13a253b82fd7b2891ff636ba95f8c983b4f5f4f461c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyScreen (cyclomatic 22, cognitive 20): verifyScreen has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6bd1136879d4bf7e1ecd4686707391b6fef41ca7a8d9adbfa19934a8ec9120"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function satisfiesOne (cyclomatic 22, cognitive 20): satisfiesOne has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68f3be127fce6944cd5e5be9372bd6b14dca5f10ca1c20a5362518ee2a81b87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rebuildLedger (cyclomatic 22, cognitive 20): rebuildLedger has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"847706e8153693d55a89a83ff206a2ec69428aaf277a8c5570acde4b16ee7f10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proxyMismatchLines (cyclomatic 22, cognitive 19): proxyMismatchLines has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0527a60c21443f640a76f815096ed66db10d490d8a8c77d6abd325e0bbd54451"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 19): (anonymous) has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91192259bb4535e3e7cbc85fdb79eda91ea3656283d6388fbd3a580ade8d683"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timeoutStageReceipt (cyclomatic 22, cognitive 16): timeoutStageReceipt has cyclomatic complexity 22 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/claude-code-runner.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3567f79c82fbdf403a7fed04de1ba4b1cbd2da1780f9dd469a5ab57f431854ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continuationStaleFillTrace (cyclomatic 22, cognitive 14): continuationStaleFillTrace has cyclomatic complexity 22 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"078191020430943e967b7454ac2832c8594601eba86a7ab8667fa89db3056934"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pendingOwnedWriteContent (cyclomatic 22, cognitive 14): pendingOwnedWriteContent has cyclomatic complexity 22 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871a0203bb36231aa64901bbfab3489409096547a7dd8075de4eb874a170316"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readState (cyclomatic 22, cognitive 10): readState has cyclomatic complexity 22 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-question.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9552638fcecf9d9e27e71d64136cc2ec626675192929cafab7d26198c4d7fdef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellReads (cyclomatic 21, cognitive 52): shellReads has cyclomatic complexity 21 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6e25bc62b25772143d1c09d3ec0e1ccd4d0ff2333d8d21321e5cab55c66048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 48): (anonymous) has cyclomatic complexity 21 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/exercised-map.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"654908ec53eaa316d3c2371befa50e9776c78985b93f7160c9b79ac78c7e6a24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withFileLock (cyclomatic 21, cognitive 46): withFileLock has cyclomatic complexity 21 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a052864e17e16e6c4f5633c9885b0524959b1de6c4ab0b532bc27537bcfa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withRunLock (cyclomatic 21, cognitive 44): withRunLock has cyclomatic complexity 21 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"799d8222672693833f7e815d1fcfe141c0b68a7aceda3a2671f33411b09f0de8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classCalls (cyclomatic 21, cognitive 44): classCalls has cyclomatic complexity 21 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ddaa824fa93882b01e1a5cf8ecd4795ea247e18d4b316721d509795a855494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandTestFiles (cyclomatic 21, cognitive 44): commandTestFiles has cyclomatic complexity 21 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/workflows.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"970fb75eaf899266b1fd448d4f7756300df0e90dd6997d13cefb7b566d9815ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupBootstrapRetentions (cyclomatic 21, cognitive 42): cleanupBootstrapRetentions has cyclomatic complexity 21 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bootstrap-retention.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ec15d491369df1d8c1636703081566d93c3ddd0f63e25dbab5dc10ca023d4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 41): (anonymous) has cyclomatic complexity 21 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2bd31afab9d16e30362df4db7c4aa5e919d647f4d97ae6cf7ed6bc00691efb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseRunLeaseTicket (cyclomatic 21, cognitive 39): chooseRunLeaseTicket has cyclomatic complexity 21 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"d705701abf28eebf376068d9f36de8218ca6c7a6ff6b18a03acd71f552a9e8c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeOf (cyclomatic 21, cognitive 38): treeOf has cyclomatic complexity 21 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbc83efaa2c3e6d981e0ce0e9e1d5150b45886d4640a03d10c44b730ed4a701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanH2Sections (cyclomatic 21, cognitive 38): scanH2Sections has cyclomatic complexity 21 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/skill-fixture.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca2a5009cfd4fe77b7daa3231d81c4db08b7496ca1fc7ee7fecb61ddafa1fd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkEmojiIcons (cyclomatic 21, cognitive 36): checkEmojiIcons has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac08648b4741d63247e6eb5228452cb75579faa56fad6ef030e4bd36f344f43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function backfillEvalFiles (cyclomatic 21, cognitive 36): backfillEvalFiles has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3240e514f4c6c1fbe5f02afe16428e5d3dcd2e1af92909cc43229eb2edb5c4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function release (cyclomatic 21, cognitive 34): release has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0bebc324a5b5f0124c631ea5d628354bb21f7891e46ac478f46027450a1e23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 33): (anonymous) has cyclomatic complexity 21 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/media-extract.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd64967626c703bb1948f37102b93a1bd6bf1d86309848b84f64deee4e58ae8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reader (cyclomatic 21, cognitive 32): reader has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d08d262607cab4813a47c49152b8a53fa4f71a3cc12fb279427225a7dc68a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attr (cyclomatic 21, cognitive 31): attr has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f61a3a6bc8fc72008b38e21d2c4056467d75d47ea028b73d04a55fe11c92fb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signalOwned (cyclomatic 21, cognitive 31): signalOwned has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e974fcd6d93e6d7bdc32b95ddd0ff45f4fd6f67fa077c986a406000e3feacb5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHermeticEnv (cyclomatic 21, cognitive 30): buildHermeticEnv has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/hermetic-env.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c6a825c9e175f933495772234fca815574a43abd89b2a5b9ce5d09b450fee5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guardUnpublished (cyclomatic 21, cognitive 29): guardUnpublished has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/transcript-consent.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b14947f2a2e3e2804d7a04c39cc3dc83c102fdf9e4a3f3a23249a6866c57730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 28): (anonymous) has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-impact/key.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfaf18d6ba284c9cdaac5aae9ab4857c8e6ab5d4dacfeb04ac9d21a8684eed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 27): (anonymous) has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f94294112c21b3084d52c06eb9531170efc7ca8a9273d629fff94ff92281c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runModelPolicyFreshness (cyclomatic 21, cognitive 26): runModelPolicyFreshness has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/model-policy-freshness.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cbe3bfe25b7f0ccbb479a3320e8ad005e7b0b7d0b08f13c607ad5480e42f80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 26): (anonymous) has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-evidence.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc0691aa0a880f653482bb46f350b107aebdd471fb00583400227650399f9f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removedPath (cyclomatic 21, cognitive 24): removedPath has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e23a67ed77c0f7dd56b4f15a358c44918a9e9ba820ff2760695c0fd9c2e7ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newestStableRelease (cyclomatic 21, cognitive 24): newestStableRelease has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/stable-release.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"394f47c0d61811a41bd3e9c765baef373b67d686deddf77ea03dcef1bf3533f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPdfOptions (cyclomatic 21, cognitive 23): buildPdfOptions has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a1ff6ffdbe53e6bdbe199e686043c0f378afb7157acbcb7769098631eece3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function freshClassify (cyclomatic 21, cognitive 23): freshClassify has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1e3a36477cc06734315a5d9ad55de024ecf13c9a8a3a63e2e14dede6d368f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 23): (anonymous) has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"21abbf5a6d2d1bb34a3405a2d5594b15b322bd041a3ccaa9fa0e9700ca73fc78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 23): (anonymous) has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-deadline-publication-observer.test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b21b177498a6e2aa489299d39616ad858c83d9be5943bbfb2f897da2bd6855"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 22): (anonymous) has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/test/proxy-transport.test.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e70b5de861bc854cb7f80102e0a222c580c91dd7194e786c56777da74dae495"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lineOf (cyclomatic 21, cognitive 22): lineOf has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd204596dc1390311034172d7097f24b9749fab6dbe07178b066cdf8352317"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 21, cognitive 21): run has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1131f9bbe7cd707cfb1569aa8960a058e0939279d53d8bb02c8d92995f13cc9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flakyDecision (cyclomatic 21, cognitive 21): flakyDecision has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2a4ff0dac09f00bdcd955d6ea5167644d27837a77b966eeb589948127b34f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPropertyRead (cyclomatic 21, cognitive 21): isPropertyRead has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"731117c7e752b3fbf41b1c9eb78f2f0a3a75417388a38c982291e0d734d52c8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseUnifiedDiff (cyclomatic 21, cognitive 21): parseUnifiedDiff has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac94e4070dc28e8786025299f9efef20a6b8febee701617b99e8e97a0fa7733e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leanStep (cyclomatic 21, cognitive 21): leanStep has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b450b1eb682a036dcba915b5ba2b4fdc7b56b1bb43ad1a21e8db46c6e931a9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTestCoverageAuditInner (cyclomatic 21, cognitive 21): generateTestCoverageAuditInner has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/testing.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f5c3286c77b43404cc1a377b9089d4fcc4cbffd1073096ee7e266664e93fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"de74e051bbde5c7dedf4e981d4ecd94a1cf448e4aafe904e38b83dffdd0aed97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readyMain (cyclomatic 21, cognitive 20): readyMain has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-cli.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac310dfbbc2c953d6d090f3018ef4d25079b15c9e4ccc2698f89982b6e4796f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runClaudeCode (cyclomatic 21, cognitive 20): runClaudeCode has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"81be410a9bb321d9cf5df1cfd4a126a6c3e97e961644b9e3b644ae103120480d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-freshness-publication.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"85039380aa1b234ca7c521df637b79674403854f657d78647887b078c5f8f26d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReviewLoop (cyclomatic 21, cognitive 20): parseReviewLoop has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87b348e260326cf6264ff1c049420eec8da7c89d75c8dc73321351b10db679b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributeJUnitCase (cyclomatic 21, cognitive 20): attributeJUnitCase has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd77b257e2ee6698c04ed81a2c3b50cd49df3f9a67b57b86ce47413518864aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-split-collection.test.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8b5332626d7c757e9bb9fcd7797c0915cf37c3ac98c662e19b5f32df1ffb16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function croppedEditPane (cyclomatic 21, cognitive 20): croppedEditPane has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e11022fbc89c0462909934faeeebe8153b6d6b431ae31ce7f20ac90a26574e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beforeTool (cyclomatic 21, cognitive 20): beforeTool has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-path-fixture.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"15036b97a597455f65b99a49dfc60a2861b58ef8a2996d0af9f70f0c24e1ecb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateStatus (cyclomatic 21, cognitive 19): gateStatus has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768066136709525a2efaa95b2ecb806a8e2081e6862008ba24e6e1eb2698048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 21, cognitive 19): run has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb09ebc2e742e64515bafd6afeccbdad9d0d167495d602c82c3d5871f10b668"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 18): (anonymous) has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f4f072e37d98223e52149355b7416db573c2d99f3fe964ba697160d54e4fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPrivateJson (cyclomatic 21, cognitive 18): readPrivateJson has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4589f1014f6b6d0f7e16c3b6edc0ab1a1ae48605b4770721917f9aaa96436e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptedReceiptHeads (cyclomatic 21, cognitive 17): acceptedReceiptHeads has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"813879763740bf07a5b49f8c6908665c15d1fc9ee794c24d5733b2c9efc3c83c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributedCoordinationClaim (cyclomatic 21, cognitive 17): attributedCoordinationClaim has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"11344a69660a1d47d6b93acf06790bd91df0702fcd7b76da77d3cf3f8bee9f9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileResponse (cyclomatic 21, cognitive 17): fileResponse has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3664f5ee3c9211cf4e4a70111f5df4703f53a9694f801a6a05ba67e2cb5037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 17): (anonymous) has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb434726a856778ccd5e1de1662c38ec83a91b6ad210d68f6b1682c9eb2ff20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOfficeHoursReviewPreservation (cyclomatic 21, cognitive 16): validateOfficeHoursReviewPreservation has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/office-hours-completion.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7988dab62f76f4e061be6d0abdc5acaff0bf8c23cc1d03f35dba3ffffb8f464d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaProducerReceipt (cyclomatic 21, cognitive 16): qaProducerReceipt has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-evidence-producer.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f47a3ba016e99d8ee5e2e33c5205da2681eea0d21154998f560b24d130da5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engArchitectureChoiceAUQ (cyclomatic 21, cognitive 15): engArchitectureChoiceAUQ has cyclomatic complexity 21 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870863416b4eb51c673d1e3b3bdd1bf10cff33de6a939c0cde1f073ca11447b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 21, cognitive 14): parseArgs has cyclomatic complexity 21 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/cli-mint.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9d631ea12022c6881751a81f6e7d7dd50dbc4946186a8ef192e0398f3c0ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAcquisitionReceipt (cyclomatic 21, cognitive 12): validateAcquisitionReceipt has cyclomatic complexity 21 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"4535e9f44f2f93a3795f24dcf4fb30b0e34bba691ba976cc89b942be251b0f29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withPendingExit (cyclomatic 21, cognitive 12): withPendingExit has cyclomatic complexity 21 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-exit.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a241298ba484701020607c7f610407c3c7ae7b510c9c69244ee9f2904d2a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProvision (cyclomatic 21, cognitive 11): runProvision has cyclomatic complexity 21 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1610e88d22a0eb3cd7b81bbc89eda8905952b683e7658d38402dc84e4aeb93e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextFor (cyclomatic 21, cognitive 10): nextFor has cyclomatic complexity 21 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d2a0a78ad9b8eedf6ee7492270862d6eef101a83be3a6f5e977a81ca2d9673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 48): (anonymous) has cyclomatic complexity 20 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"74991b0064f11e4cde0ab1434e13a6b8bd2db1f0738228f504a26b50f781952f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchWorkflows (cyclomatic 20, cognitive 43): dispatchWorkflows has cyclomatic complexity 20 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf802e0a9f358142fe50c7f071ebf4c7609a2cd76407b2cb57322aa6360a31ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function media (cyclomatic 20, cognitive 42): media has cyclomatic complexity 20 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"56733474137b9528498b78fb6ab5d9e837f68055042f0970cd927f3f7a6a63cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 20, cognitive 40): scan has cyclomatic complexity 20 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-owned-journal.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"904ea64dd17bb035402918b0063020063b3617829fd192bbfa4b2425f0adee33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripCommentsAndStrings (cyclomatic 20, cognitive 39): stripCommentsAndStrings has cyclomatic complexity 20 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/touchfiles-facade.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dd4b323d101f1b277c78ee90497e2c395e0cbc8598d3657072e92fb350ef1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSteps (cyclomatic 20, cognitive 39): runSteps has cyclomatic complexity 20 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/workflow-shell-lint.test.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c576914e45823b1c3797f2b0b567fd2f92b8c0659f4c6c1320a50561c9ed910"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverLeasePublications (cyclomatic 20, cognitive 38): recoverLeasePublications has cyclomatic complexity 20 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"72822c017b4b53d2a4b9e797d3190847181d82345064580d5dae11d530e6107d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverDeadLease (cyclomatic 20, cognitive 37): recoverDeadLease has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3f1e6c6b73bbaf6e37db19429fe754c4c5cbc17955eae6917b09127867dbdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupContexts (cyclomatic 20, cognitive 37): groupContexts has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/static.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0d43998bc5f92ff6d25c713261cd5a572a40fa74b7d4b5c2d16a3a9dc9e1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rustEdges (cyclomatic 20, cognitive 37): rustEdges has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8656690d0195fb4af65379a4ea8a8fa13ed96d2b733bca20aa50b5a14f498ea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function browseNavigatedTo (cyclomatic 20, cognitive 37): browseNavigatedTo has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/session-runner.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce980684b8b3b637f070217e7a8d904518cb95b553b7c7dc03cd0cb85a97b5e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreState (cyclomatic 20, cognitive 35): restoreState has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bba610c9569f312460b7197e3891fdf5647664540548b28b84ace61ac717d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFragments (cyclomatic 20, cognitive 35): readFragments has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-fragments.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"00baad55ef74b8e2b55d9abf3c1dd8b7dba61640eedbce61a591ae48dc141398"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hoverTells (cyclomatic 20, cognitive 33): hoverTells has cyclomatic complexity 20 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"03af36f8fe689bed64d38657dde3eaffc7ffb076d48f19ecf63cefd0d274b286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bookkeepingJoin (cyclomatic 20, cognitive 33): bookkeepingJoin has cyclomatic complexity 20 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-browser-deadline-evidence.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"145cc1f6c7741c9308e4d3d9a15dfede71907d59b05e5546e2c624f07a7e2d50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectNode (cyclomatic 20, cognitive 32): inspectNode has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"78af03c3efd20601b7ffa86a28970951c58aa713c3c81ef4154a524a439d9103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laneCheck (cyclomatic 20, cognitive 30): laneCheck has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/lane-ownership.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a5958524b2241757b16f9c02fcbaaf8b270e67471c12be36242fa09b6d942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glAccent (cyclomatic 20, cognitive 30): glAccent has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed62cd06ac2157f0b60123e7e4c9c4f7082db8ebb872462b31851d5d0c7a5c76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkHeroActions (cyclomatic 20, cognitive 30): checkHeroActions has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome-copy.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a63a254cacefd7e72e36fdd7b7cfb2551475ee2b2078471eeffcbc5abe39acf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function key (cyclomatic 20, cognitive 30): key has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-impact.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb2d5b9111007e962a5eb871cb4656a2cb836f8d19cb6d6c24a6da60d4930ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glContrast (cyclomatic 20, cognitive 29): glContrast has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27ada6e93c1bb38eb2ce73365b4f55cc8b740f9c05607f869f7db5b6afef1cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 20, cognitive 28): generate has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/generate.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4246d867cc376d86abf4255967a037c4dd0beb49330ae773d9dea0488939e089"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectBun (cyclomatic 20, cognitive 28): inspectBun has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb68f3845bf5eecd65402e00bbf7b60c035ce565a51ffab0088914e64d33cb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hiddenAtRest (cyclomatic 20, cognitive 28): hiddenAtRest has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c49f9b993a0cc9af7acb4ff29e20479b9a82bd7aefd3b3bab20ac37b723f1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatReport (cyclomatic 20, cognitive 28): formatReport has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analytics.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b1a45d2853af0598f8ee922e1bc4104d593bbbe42f5ecd029b1909195b936e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPageInvariants (cyclomatic 20, cognitive 27): checkPageInvariants has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc1095c0aef989cf3630b4636ce222246bef35f1d3c757567a3486e4898cc8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wideContainer (cyclomatic 20, cognitive 27): wideContainer has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7723e4792406fcd0fb176a7f205d9e6aec2d0ea1d75ae0653917f7ec8fc2e1a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPostMerge (cyclomatic 20, cognitive 26): verifyPostMerge has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-post-merge.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ea16acb1d05f073192df4cad82446eb2cd833f6b41afaad552bd48b9199a55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatReport (cyclomatic 20, cognitive 26): formatReport has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cfa8a9e523cdca68c4f91f1b2bf21de09239c49be85c44e590b72e20f848c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 26): (anonymous) has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e5c599806e29c4d5585c7538ab26dc1b9b77bb0ddbb025e5eadd8ef4ed7e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 26): (anonymous) has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/contract-done-means.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb41e4e3958934fe74b4e3438b4b61adac6b56031330e5a3f45998cad07c004"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSingleParenOrIifeExpression (cyclomatic 20, cognitive 25): isSingleParenOrIifeExpression has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a01ad082e894ad3b51ba39d23b19f6f5b14f7b94a2bbf64835f1b59827c70b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 20, cognitive 25): walk has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d394a70be845957b5f23ee73fb37c654b57bcedc82e6a0406b67ff95d8af42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 24): (anonymous) has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/xvfb.test.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e70a1af7860b161f5b335e9661a5f7a0c909b67e2ebf298007cd40faa78a01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 20, cognitive 24): start has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d769680b67a6f01b86f41972beda8365f5021406ca99f554d2386cec2e7f052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 24): (anonymous) has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-autoplan-guard-pty.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae82fdff245e4bd232bad17f31481be84f242090854ba2a4973495a6f445353"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 24): (anonymous) has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-design.test.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"846a5b23b8c29977266c79c11d546c4f6c92faf1eb0acf0453b6489c30cb6e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnTerminalAgent (cyclomatic 20, cognitive 23): spawnTerminalAgent has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"808039c4ccefe830a723a56589a59945d99fcce4464c4766faeae7c817be5707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openPhase (cyclomatic 20, cognitive 23): openPhase has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5ab03f242be137908b34728196b6c5b49b2cffbfbf9081e3b1f52174a4b74e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ceilingContext (cyclomatic 20, cognitive 23): ceilingContext has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8767fb334af79cfa2e2f35a55b1ee99e025019d7f1fc304b492663e0d7fc6b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRunEpilogue (cyclomatic 20, cognitive 23): buildRunEpilogue has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10e1e68774f980b0bd9885b344eb0c3603e2cd0c660d60df4792dc30d858e90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glAppMeasure (cyclomatic 20, cognitive 22): glAppMeasure has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"af812aac3b43a4ec80d506018dc64544148aa4df91aad92ae34b81fd15df586b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSurfaceInk (cyclomatic 20, cognitive 22): checkSurfaceInk has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5330c88c609d0e7ac39f684eed0d8ba58d94351bf858312b6aafc9380fb1743"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkInstallAdmission (cyclomatic 20, cognitive 22): checkInstallAdmission has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/install-verdict.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a651ae4bd803a7e54c1f7410e740a326205a994c4a954a46456ca75d4922a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownChangeSince (cyclomatic 20, cognitive 22): ownChangeSince has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adaed20d6ab0afe9c76e4c3ae1da196c4e2265daf1d771a85a29541798eefee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findReuse (cyclomatic 20, cognitive 22): findReuse has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-tree-reuse.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"246d718bf3e9f283fe53e549d558af3af730adcd733e2a3f76502d162cec51c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyQANativeRegression (cyclomatic 20, cognitive 22): verifyQANativeRegression has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-evidence.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7fc316d9c9c7f93fb2929f16afcccd649f5190ef54a535ac165d407ca4e5bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 21): (anonymous) has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/xvfb.test.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0084ccde96dda6e8a091cb5f3779d3e98788e54f9d8ba5db6a634935d85343c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reheadChangelog (cyclomatic 20, cognitive 21): reheadChangelog has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cf1077bf625ae07c577946f0e5261768c563b5c5ac09cdffd5a717cac4ef36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 21): (anonymous) has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd542be1b44e8084288f3cb80c4a0b5c84b3d269eb2416e0bd0d0429737f5f26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outsideVoicePreflight (cyclomatic 20, cognitive 21): outsideVoicePreflight has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/outside-voice.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4d51e71b938748d3c46e2f3572e6383acc664b3d808ddf3a9c037f77647a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSkillTest (cyclomatic 20, cognitive 21): runSkillTest has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-design-sdk-fixture.test.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a623b0d5839517cb25b3fdda846b51ec0169975d366f640d5ad81f4ff3b627f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairBundleExpiry (cyclomatic 20, cognitive 20): repairBundleExpiry has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93d3ef3528ead502a0603b019533e5e43f54b82867b6ccd2ebdd63052f76e44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 20): (anonymous) has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c597b8cb3a17548b3484e83b95322ecba5dcc80ed6651aea06922cbda6ffb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 20): (anonymous) has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a2026aa161feaa8afc56c495b7532c6c111878d9d8361836589313a8c6e624"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 20): (anonymous) has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/codex-e2e-shared-libs.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcfb18dfbb86945934265207f52bde3b479725a97b8ea37c2ff89aa938e52e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shadowSwitch (cyclomatic 20, cognitive 19): shadowSwitch has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d7131afafb7e98ab393109b862a489afad5ea0e313e34ecbd85334da8f79d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDecide (cyclomatic 20, cognitive 19): validateDecide has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-decision.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99f20006d7a3ee3033f1e7d633781f7004bf6b4d6084ec4257674419229fcd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemote (cyclomatic 20, cognitive 19): runRemote has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2389c8dcf43ce1c6e6f51f10e9a7e2c64e702d9d85e396b043a943fc03736b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConfig (cyclomatic 20, cognitive 19): parseConfig has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc7548bbb137db0406f5df647c2c4df64d59c7c57bb9f8bc7c63c51893bea65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-deadline.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ab0f26b6b1b950c10ce8d88a87fa2afb8ff7d1443c50e582d047cb84a1ff97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeRecord (cyclomatic 20, cognitive 19): treeRecord has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-tree-reuse.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"393a18b061a4277b2dd30fffaf4bcb71d5a9c5f9ad9ef758300aa8c6220a9d5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyStagingRun (cyclomatic 20, cognitive 19): verifyStagingRun has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-staging-run.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"232e997a4b268a1a4f8b6ee8c104eb1c2be882993ba7dea1ecb896d6bdb97703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-evidence.test.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b7b83cedc213c120012e2fc1575d9034fe8e4ab18bae04286a2d86e8e584fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-method-read-audit.test.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3579812f275857d4c18c572cebc0d846d2049d2fd102fea26d18729b7d8835b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seed (cyclomatic 20, cognitive 18): seed has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fb2a883cf99b90a2ba7969e11d9413cd4ce4805dc67d2f66c605647e19bedb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 18): (anonymous) has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0682729a37decdcee328aa9329da4503a9ec522390b3c0d26be26db0b6861"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipParts (cyclomatic 20, cognitive 18): shipParts has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-parts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"119b73a04351ef768f9eab05d813979ef3d105c8cbdc128c624eb8aeca60b7a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 18): (anonymous) has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tasks-prior.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a5390b3bb2a53c8d94b2af004e4c37a1b598c540e9cc91271be15ea7313a14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callerTools (cyclomatic 20, cognitive 18): callerTools has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0ae238bf7e81a213831aef836c13ffc45351cd02efabfdb58ee91a12b01e89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveVisibility (cyclomatic 20, cognitive 17): resolveVisibility has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455095f67eecf7d170972a66e066e24a14e97f4786bba195ab22031346b9daa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparePath (cyclomatic 20, cognitive 17): comparePath has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"689ed7597ea4cfd121bcbd3109156ad490d2639725e67f81f06fc3c924e0add2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesClippedBashPermission (cyclomatic 20, cognitive 17): matchesClippedBashPermission has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c515eb484c13e67c9f5ac1c3717505f0475e1ab7b79eb1ea7ca53eb37f0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 16): main has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"38727ea9dcec1a517923ef64308a00c2853be35bc874f92dd06df278dcf0e348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePaidShardBudget (cyclomatic 20, cognitive 16): resolvePaidShardBudget has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62d1a826e294583e9da131d656ef59916eb8cc4558a8950ed07fa43973b85f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redLedger (cyclomatic 20, cognitive 15): redLedger has cyclomatic complexity 20 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ed73d13a7d7c0be45adf7e06af2e48a4dee9776becc86fd6f515c4e26b5bc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 15): (anonymous) has cyclomatic complexity 20 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2f3306fa7ef0f54bc787feabee41a6d70f323f4ae7de1f7ab63896b2cc86b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 15): (anonymous) has cyclomatic complexity 20 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/review-ledger-invariant.test.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f6b737cd79c76b1219da8eb796ad631c75f5351fef09f328bafd63464b5b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supervisePreparedCall (cyclomatic 20, cognitive 14): supervisePreparedCall has cyclomatic complexity 20 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82cddcd48b61790317206ad303467ca4b262ee47d3d3c4d82f6c89245f35889"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expansionDiscussionControl (cyclomatic 20, cognitive 14): expansionDiscussionControl has cyclomatic complexity 20 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9c52547f69c9cd219343d23e425fcd3eb2ca7767db41b25f367efb4a9ccd07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSharedLibsReuse (cyclomatic 20, cognitive 13): checkSharedLibsReuse has cyclomatic complexity 20 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5021d2cbf8323145a09f30c52be51772bb30738e0264809e9e3ac24d2e6a6571"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 13): (anonymous) has cyclomatic complexity 20 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d01202c50634af15029c8c44bef418dbdc02f6d8a1872ce300d7c2c7c98404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admit (cyclomatic 19, cognitive 49): admit has cyclomatic complexity 19 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03dfbdd49c795a865db9a7a997d818bd357c585931873c0e4b2c63ed0db7a8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 49): (anonymous) has cyclomatic complexity 19 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/auq-mode-capture.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d855b8898e6182d68af06a5c3f1ec6827d3dc75aff33d9d87f6bc9385bdb62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twGlow (cyclomatic 19, cognitive 43): twGlow has cyclomatic complexity 19 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3596b790ee054313a095457d25f4fa0e5237d75bb95be63cd3c6df890b3914f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 41): (anonymous) has cyclomatic complexity 19 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-review-discovery.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c086ba21ba1c3d6abb3beb6ff604e2d2543c46a090be05119c7bde18b91d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXml (cyclomatic 19, cognitive 37): parseXml has cyclomatic complexity 19 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/junit.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2327c76eb59049058286dcf520be1165d6db3c4cdbba67e4eb4f6c88db3a4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermeticSkillsConfigDir (cyclomatic 19, cognitive 36): hermeticSkillsConfigDir has cyclomatic complexity 19 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/hermetic-env.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"829e14c372d39d61ede330e45277f63c9d74c4a9c9f16cdfd06152e9e2e9004f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function depSpecs (cyclomatic 19, cognitive 35): depSpecs has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"da79266d2b4679953f83b808d46d03f372cf7886eb0034ac1bd3a102d0366d11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 35): (anonymous) has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-decision-classification.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f86344377d718b3b0fb8de873336d89aa1cf09240761573e7a46e15998d6f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 34): (anonymous) has cyclomatic complexity 19 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/hermetic-skill-runtime.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfa773953a4e44bc951915b9775e8006b8cb037ce59979442afb374ed7b0244"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function genericVerdict (cyclomatic 19, cognitive 33): genericVerdict has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d512e32bc260e45b1e60568c3c3ea696b60d9bca474232f644328d2cf795a640"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rawSpacing (cyclomatic 19, cognitive 33): rawSpacing has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae07a8be00ea99f46765c946a83c1892369365ec527264937ec5e642b3ac6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonFieldEnd (cyclomatic 19, cognitive 33): pythonFieldEnd has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b6abcef3f37bec3658f4cdbf84f255e28c3aaf3dcb50692a8dab9cc1ed82b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchHeaded (cyclomatic 19, cognitive 29): launchHeaded has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c634c6f36a2a4c4cf3d91678ddd0c6d41ad78c32abfb6ca959c131cbf1bc56e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recomputeMergeTree (cyclomatic 19, cognitive 29): recomputeMergeTree has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a9d09f4e3debf1b0a748956dd1418cc5c594834f545dd4030721a1b7d672f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkWrappingLabels (cyclomatic 19, cognitive 29): checkWrappingLabels has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c298a3fe37ab811fc742f9bc2c1b0e122d15ff33b15f6f384a9074fff951636"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triageLabels (cyclomatic 19, cognitive 29): triageLabels has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-triage-labels.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e4d58d517fb8d015932155ab6236d53e315c810ea503cc3283853f5854d3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function noProxyToChromiumRules (cyclomatic 19, cognitive 28): noProxyToChromiumRules has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8622a2612067da5720c8660541f8f6b24bf91f561bcb135c23e748b338d780b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeOwnedFixtureDirectory (cyclomatic 19, cognitive 28): removeOwnedFixtureDirectory has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"590a6ac6652b0f3155e085f5f4efba93559e973e90dc07e2fbffa1164ec496b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusLines (cyclomatic 19, cognitive 28): statusLines has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb8f3794c311bd309a4de70ba1fde3c08c0e0a274a204bcef0d5712c036e891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function componentMatch (cyclomatic 19, cognitive 28): componentMatch has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"81359f84288325bd971a138de837c477a47b2950e8fa7031edc49e6d2bb654e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scannerBuildMatrix (cyclomatic 19, cognitive 28): scannerBuildMatrix has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-matrix.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"238face2ee3368900be4c0a3fd7055a76ffa79046f30b89c28e343b86a9f96b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newWave (cyclomatic 19, cognitive 27): newWave has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec7d5467a9d14e6e64418a59417df0e79672f06aac15d1f151cbf0ea5465433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePath (cyclomatic 19, cognitive 27): resolvePath has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality-receipts.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2988ba75fdbee0852bd992ef30039ec0b9532c9f06bbf988eb8108606cdbba50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function merge (cyclomatic 19, cognitive 27): merge has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4281e85ece6024838924c97b6cca03d9ceda2ac33abe4f318048f383e5a4e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReceiptDocs (cyclomatic 19, cognitive 27): parseReceiptDocs has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-docs.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"022e5716b73381f5f6a536ad39a910e6c8da0fe9f73b9090d4e2362b80ef2189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractDiagramFences (cyclomatic 19, cognitive 27): extractDiagramFences has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f88bbc49b03be3692ba676cb4aa6b3caa0900ec9de546a7deedce4b4d3ecc06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 27): main has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa93951d846d6534ed08edf273a40a93d2f32c9080219ac801ac810407c834dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCapChoices (cyclomatic 19, cognitive 26): applyCapChoices has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-budget.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7048957bd949044b36751b1b30b61a3393218da9cd4a6a9c282d4f543bdeff63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRemote (cyclomatic 19, cognitive 26): resolveRemote has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7b4ad3bc71cc55917ef12d0f11e4da3b71188ba24bcaafffca736e2c1ee427"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draftConfig (cyclomatic 19, cognitive 26): draftConfig has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/init-draft.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"027d7624169fa461e6a800d75d6375187e63872056d9fb806dfabc976f6f9bda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quarantinePolicyProblems (cyclomatic 19, cognitive 26): quarantinePolicyProblems has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7661491e869a4633b72c3f8f1fb66a8190083e6a62635d1a64496a17202884e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForReadiness (cyclomatic 19, cognitive 26): waitForReadiness has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-readiness.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"959cb7b24f45113d715d9f05f942002bd558b8e45d113f4b2c7d08669b540a47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordQuestionEvent (cyclomatic 19, cognitive 25): recordQuestionEvent has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"357c336e3abb8a4bfd71a6caacfd564e4dd3ebe38cd46d4a0cc47ebb5c5fec55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDesignMd (cyclomatic 19, cognitive 24): updateDesignMd has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/memory.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a06a781d3026acc18e95ee0db6e6e9abd6c9c280dc711c8b6749509135bcd21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 24): main has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"663ca68be413b95e5f92bf3d4f8124a43a45ebe5eb159a7eacefe9a655bd6083"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glAppSetup (cyclomatic 19, cognitive 24): glAppSetup has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f565576e8e8dcf9ebae95f428c71fd7be14d487ecd0b1955823b9289d1c3f60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isProseAUQVisible (cyclomatic 19, cognitive 24): isProseAUQVisible has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/classify.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64bd64e373630f39c2ea620aa7031012d4eb264b08a78e9e0657d7dbe8bb2e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmMerged (cyclomatic 19, cognitive 23): confirmMerged has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"145178da01d29e20d3429c0e97a8853154b579669bd21bfc659c7095cd205377"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportPublic (cyclomatic 19, cognitive 23): exportPublic has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-public.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2282d7a92b9e7971a35bb0dc907b4fadb1c25fb97067512c203a9a8f137417e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 23): (anonymous) has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-fixture.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fb4a4466d6c5f86388b3f7d25cf94d0165f1be8b88f075742ada916f29d2ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyJson (cyclomatic 19, cognitive 22): legacyJson has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ba0b28b5233123135607bc7a62ec1d44638f8df761581b38497b5cc21d5e9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substituteStampOnlyTree (cyclomatic 19, cognitive 22): substituteStampOnlyTree has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/remote-receipt.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd407d4af687cae2d25d65ac3dbc31e92bb6b0d1776673b8c1d3f1aa0f82ac1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSealed (cyclomatic 19, cognitive 22): renderSealed has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dcb2620a003a392ca770d3231fe330ecc8492b170029bfbf2dfe6cd5f14436"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unstampLegacy (cyclomatic 19, cognitive 22): unstampLegacy has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6f033c56e063fe30d0506bd73ab67d5e34637bfea62a36162b2f7a3477e97f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiptReviewAtHead (cyclomatic 19, cognitive 22): receiptReviewAtHead has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c38bd7a4b2891af0d91ca9a5ec3ff585e6271cb994e39aceac6825dbb8ddf8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGateHook (cyclomatic 19, cognitive 22): runGateHook has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-gates.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"628daee373c347efa5de1f03aeebac1e2d896b05091bc7a43206a322623ebedf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 19, cognitive 22): capture has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-checker-evidence.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"412e609363ef5231ba700ae48cc773b10774a3727d3ac3e52d2c838729a7f85e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 22): (anonymous) has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-evidence.test.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36d629675bcdd3e7e69930ec0b1762b162bc51e094bcc9d1715f958605054dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 22): (anonymous) has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-exploratory-callers.test.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ac6ce083924b02e964c1f85ec4008a7de6e857eab5398dfae8921544a8624e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWorkflowAttempt (cyclomatic 19, cognitive 21): readWorkflowAttempt has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f2d51822834b90ab3d207ed0bc7d80bd00c7e44140e10c9be7603f52680925"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchScreen (cyclomatic 19, cognitive 21): dispatchScreen has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35e950866875991fc51ae745f623750b793f155308336ad2bfadf37f7e72ab4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintState (cyclomatic 19, cognitive 21): lintState has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-app.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0628d5e856519b8c77dc412fb9ce992fb3764b6266cdac324fb9fcfb200c808e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdCalls (cyclomatic 19, cognitive 21): cmdCalls has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bed19889a52de7061d68d77da394b03d3a0c64d10689110eb956f9f65f98a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ceoOnlyEvidence (cyclomatic 19, cognitive 21): ceoOnlyEvidence has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-ceo-only-evidence.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c269c9635dc7f8a6e33a7f0433d9cf2095d77deceb4b8c067332161a771c1e06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execCodex (cyclomatic 19, cognitive 21): execCodex has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-session-runner.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"932c0e9f320ff8616d4880fe2db3dd2608ce4ca219ae393e2a12ceabe5a1881e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestError (cyclomatic 19, cognitive 20): manifestError has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/motion-encode.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6741d0fd06f150c30fad6c6eccb4323a10ad33143b0f46ffe091a0bcb206e4fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pdfStepOptions (cyclomatic 19, cognitive 20): pdfStepOptions has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/asideClient.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3d20db70d29cb0a36ecf3fa161e0c1e7782304cf4551d25307631568c1346b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProductionProducerInstallation (cyclomatic 19, cognitive 20): validateProductionProducerInstallation has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63a975e34ee26a14c62cdde56c631429a2e26797c6738e67041969cc47115f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb350e4a7d7dd022b464dc2155d985bda7a75ebbbe3e1934e02622d04333e87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eefdfd721e474c8118a7ab54cd8a1df3657f38c750db5981788dbb5cd6dd311"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reproduceGateAhead (cyclomatic 19, cognitive 19): reproduceGateAhead has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"044788ccb99dc684da2f31f6ac2f2c98b9d49aff9f93521b1866c1509da506b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assets (cyclomatic 19, cognitive 19): assets has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-matrix.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc94757cea2b5f740e5b3c924ec40ccdbe8573c1d0d04d5e61d16c3c4adbea9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCodexRuntimeModel (cyclomatic 19, cognitive 19): resolveCodexRuntimeModel has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolve-codex-generation-model.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c542e8faeaa16f0bc42404b491a138e7675e05e390816b31282ac860309f55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 19, cognitive 19): run has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5709f3887636648cb3721f5c0589be25434d685da26237eda31c0bb16fe4a49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeCheckboxPanel (cyclomatic 19, cognitive 19): nativeCheckboxPanel has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/classify.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47b672f5f3a3e48c95c93694ed79bbb390ec4392290a634e0f9e637fac85b60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffBills (cyclomatic 19, cognitive 18): diffBills has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d305825abff9aa9b21ca5e09062dc183e6f5eadbe1fd3f33026a887f9ac661"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twFrame (cyclomatic 19, cognitive 18): twFrame has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d87237242cb9d5c03e11fed04dc94704c3b8e0d9722e82fa60985bd45596fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteGateStandIn (cyclomatic 19, cognitive 18): remoteGateStandIn has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/remote-gate-stand-in.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"657a0239a93a122db82ed992fdfb7d8de347c44223173b8c0149e79da2273c70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-conflict-markers.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3d9a05f9cb6118a06a74ee7362031b34962e61501fb874ceba8318419c24f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outsideVoiceCommand (cyclomatic 19, cognitive 18): outsideVoiceCommand has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/outside-voice.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7e0d5988aa8084f2526378d5aef13ee05fd286e889bff7978cdd1ad9141c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"126a9b6d45844f3bda97922005e8179727186a37688a1fc536e1366db5ded866"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unboxCompleteNativeAuqBody (cyclomatic 19, cognitive 18): unboxCompleteNativeAuqBody has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-native-capture.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dc2b5e8ffb1f69058664edf06d030da4a2e6337fb42156acc3bb25b50eef51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyPreparedBlob (cyclomatic 19, cognitive 17): copyPreparedBlob has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a66994b6e57846b11a8fe813a65c87927e7de1f15a1a1b48ecea0754e50cba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPermissionDialogVisible (cyclomatic 19, cognitive 17): isPermissionDialogVisible has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/screen.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"32eb2c0ce1ff7a60ee129bdaed2fd5eccd9f99288098730fc3045666b2634f8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function e2eReuseLaneProblem (cyclomatic 19, cognitive 16): e2eReuseLaneProblem has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3590351fd9b602193392dd01c55bb1577438101934da43313955f54333b6485"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSource (cyclomatic 19, cognitive 15): validateSource has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2559929cefeeb86210664a6c4ab592734b837f76a51ad6f60334ea2de7e7b28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createPlanCountFixture (cyclomatic 19, cognitive 15): createPlanCountFixture has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-fixture.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf728d7e57144bb50a3b8f3c02ed97d6b526c37b449fd6ff464c74ab8cb52b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scannerLocation (cyclomatic 19, cognitive 14): scannerLocation has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d53dc7f7059067466906571708f304c186c4a63a054f345a05021c93b9b17da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function command (cyclomatic 19, cognitive 14): command has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"760eb86c2568e9fa5e031afbe46442966424fcc071f75058da25002bc188d521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bashResponse (cyclomatic 19, cognitive 14): bashResponse has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3974a8ee783187ff9ae11290b081f97869d3b0e6ec9aa64ab13d1b2b7d3423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStoredAssertionWitnessReceipt (cyclomatic 19, cognitive 13): validateStoredAssertionWitnessReceipt has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a293dbbcc6e517d7b591e04bd2f5fbb26e966ca5a1c80f3e67045c2edee06f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 13): (anonymous) has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e454490ce873eaf9bbaedad9a8ab1c7dac7da09f16c2ecd2a40efa7c6394ca3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 11): (anonymous) has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a47f73a405376a90c44f8f4305eb97d0c8d77c14f6f6afe5f0b631cb7f0938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePortableManifest (cyclomatic 19, cognitive 11): parsePortableManifest has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1db9e1195fe8a34db7a90168db120f24f293d63fd198220557eb8d2e57fc64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPolicy (cyclomatic 19, cognitive 10): readPolicy has cyclomatic complexity 19 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6edadf2d23c301fbe02339f63a238b7f436eb4252b44b92bb2106b782a5fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPanelReceipt (cyclomatic 19, cognitive 9): readPanelReceipt has cyclomatic complexity 19 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b57f6d8d3f954cd93f55cca263fad76eeef159ff136387b6a430868bb9b60ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 9): (anonymous) has cyclomatic complexity 19 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20c7afffabb32e189943a877ef6c213cdb180ae99a99d63813ec6e2a92d5237"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPathReviewPrerequisites (cyclomatic 19, cognitive 9): checkPathReviewPrerequisites has cyclomatic complexity 19 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-path-fixture.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bedf2df952f3eee04adabb14f791e4022b0c76bf1cb379973baf2411c8d60f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kids (cyclomatic 18, cognitive 48): kids has cyclomatic complexity 18 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75fdbd5d3bbd4106a8a7d9e7c6bf51f92d874205a21a5dd050b6f7e2ed5c426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 42): (anonymous) has cyclomatic complexity 18 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/windows-spawn-hide.test.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"add6e928f881521ef77662448056ce7eecaa965a22989772463deba58fd2f986"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkComponentText (cyclomatic 18, cognitive 37): checkComponentText has cyclomatic complexity 18 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/component.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b57303620061c747e792614f95c77cd024322b63b680aed8d4e6aa792cb14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutTransitions (cyclomatic 18, cognitive 37): layoutTransitions has cyclomatic complexity 18 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e00ea6c4474946df11f059bba893ea78f94c8fd9083ca0ca5f9c9e916d83bfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check48 (cyclomatic 18, cognitive 36): check48 has cyclomatic complexity 18 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/color.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a211633c07b6e22175499bfe59951e8815647ebbcdc7e31a6f0b21648b3d8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hits (cyclomatic 18, cognitive 35): hits has cyclomatic complexity 18 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-secret-excerpt.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c2a095fa187779dad5ffe14701f6c2d8a25b242ef35f9c039a215add020b29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchRuntime (cyclomatic 18, cognitive 33): launchRuntime has cyclomatic complexity 18 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/runtime.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff65f752a1f25eeae6c308db806acfc5042ad849459bf7c34d68c281f12c6103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureDaemon (cyclomatic 18, cognitive 32): ensureDaemon has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b25bf356c6f8333320d8964d88cd574889d086d89ef96de64de7eb7fe2cacd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanFile (cyclomatic 18, cognitive 30): scanFile has cyclomatic complexity 18 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/egress-receipt-wiring.test.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c858676026c9f658b2d2d0d7f032ce78847dcc1ab9afce0d6f5651a016a1b5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelCommands (cyclomatic 18, cognitive 30): topLevelCommands has cyclomatic complexity 18 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fbd6a5e5a5b1065a397553de1fe7edaec1ca4e6c4a2e58697ad364f60da551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twInfo (cyclomatic 18, cognitive 29): twInfo has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"316f2bf3da11ca62801e75d0f36151073ff8523d901811ab34a27a4d6782469f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 29): (anonymous) has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/test-free-shards.test.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892c18b863136c04a05f19733a69725d502913107da2ea86c5f99f25b9ebed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lineDiff (cyclomatic 18, cognitive 28): lineDiff has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-confirm.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"253818d45b8583008e71554682790f6a22c13b0af1b89d5afee2dbaf04ec2d1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMergedPrs (cyclomatic 18, cognitive 28): readMergedPrs has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0fb4971311ff983da8628fa295ad35443ce8e659e9dc550b39a0611095455f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 18, cognitive 27): reconcile has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeedd9a3282fa649f3c854153164d71a5116c423d4b786d679042179773721a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexHostToolCalls (cyclomatic 18, cognitive 27): codexHostToolCalls has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-host-runner.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d009559c1fde4f43439a7fa963a41a7e093b155c39f065c77f8bee0d74d766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function freeText (cyclomatic 18, cognitive 27): freeText has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/generated-bash-lint.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fece2cddd69f5b5f688475669feab4c953194dd8bf0071ca3d85cf88aee1f671"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMemorySnapshot (cyclomatic 18, cognitive 26): getMemorySnapshot has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d86ad0300c2a2deb08db7ec54ac5a64e43d222af094c05b58a1fbab1928cf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recReopens (cyclomatic 18, cognitive 26): recReopens has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate-cost.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1210e2982a6191efb975cd7f50b3c95754d1fb3f331a40a6cafd9ee7bbde362b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 26): (anonymous) has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/doc-links.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"040ce16cdd8296e95be16e1126819adb3aa1dcaaa56ca66b4192f4240c4ccb2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportDir (cyclomatic 18, cognitive 26): reportDir has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e085a283275b12d34e8bb4086314b178d54ee0c183989b47b57c27f8b31b6395"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executable (cyclomatic 18, cognitive 25): executable has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b92624b60813895cd1384140fd21c7a81783109d1210e23b9419bb83657ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 24): (anonymous) has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8c372e8a841d1cd9b94246a40345596558daf3d1ee54a19780bb417b38e7f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRow (cyclomatic 18, cognitive 24): buildRow has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c332325c7c1ecc27f16bab6ba328db48e90e490d7a806a85a6f494be24406c5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonical (cyclomatic 18, cognitive 24): canonical has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-dual-voice-evidence.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"530b0b44acb37779b3b7bdaebfbcf65f4e7b4df28cd812c53ade1556b7e696d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSharedInteractive (cyclomatic 18, cognitive 24): runSharedInteractive has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a45cec663023cedbafcadd4b5f4d531990a0c1bd4258443b0607fae3476791"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markerSlug (cyclomatic 18, cognitive 23): markerSlug has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b1328f5edd2517e3d42b0a4be34ac26a3abacb1c2764845e802cc6ba7fc348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseColor (cyclomatic 18, cognitive 23): parseColor has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/color.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d98eb77ce748f5688b83f1ec0869566b19dfd38e6de6a947ce8542ead99b7fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effectiveOptions (cyclomatic 18, cognitive 23): effectiveOptions has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3a56716396be36cb41cdb448cd573f6ac19287ed92d9b1d7d7487bce9da798"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSkillFrontmatter (cyclomatic 18, cognitive 23): parseSkillFrontmatter has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-llms-txt.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b04fd4b6a97118ec4eb3ba5508b50b284c309b88f91eb67d2fd564005399986"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function railsDatabaseConfiguration (cyclomatic 18, cognitive 22): railsDatabaseConfiguration has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34d24a1c3b4169ac844ad03a85e8b0d3d9e48eb33a39330e9876a3ef0295e27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareIdentity (cyclomatic 18, cognitive 22): compareIdentity has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67c4418862aa3b7a5b94570da981f21d060e7d5128aeba1294fbeea90a549aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 18, cognitive 22): printSummary has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e33ead02eed112146c81279de55d863d2b00a6fe6b4982b5bfc5fcef87c641"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remove (cyclomatic 18, cognitive 21): remove has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dade60eec503c541d09c7abd733190074ff40221ab5f7458e3f06768ea486001"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertEntriesStable (cyclomatic 18, cognitive 21): assertEntriesStable has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1031cb2290ded5872be1eb5e08937098ed64839b0fce4c814acbeeeda6173930"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateSealed (cyclomatic 18, cognitive 21): evaluateSealed has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f92bf8018c16600b11d7489af7eeaf3108605e45354609181483a1f685b0054"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/session-runner.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0f5527e27453a9303bfd4358660af6c728ca6892374f90a05e3708e4245225"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInSession (cyclomatic 18, cognitive 20): runInSession has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/session-tabs.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bddd944484507cb01ee9ca645f7d6b71af8e5d47059e272ec46732de59de1b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkThread (cyclomatic 18, cognitive 20): checkThread has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"df12a7aa823ad46669fa627977ff0d944ba76ae4a9cd1044c7eb74953b64e725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishHook (cyclomatic 18, cognitive 20): finishHook has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"401370899b077836112b553ad0960a713c4ee210996c973ea772bfca3ccbbfda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkNoStop (cyclomatic 18, cognitive 20): checkNoStop has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4617328972631bc07e53c1e52adff48c7bcd670bba62da8a4cab6c38fb285a99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProbe (cyclomatic 18, cognitive 20): resolveProbe has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-probe.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3abdbe77bf201f2f3b6f9371873451fddbc84308130ecb89109aa3def2550f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCommands (cyclomatic 18, cognitive 20): splitCommands has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ce56c300a880fa1ddd3ab3cac7953e5376dfba8e77ae93084e0add0d6b9fd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capturePlanCountQuestion (cyclomatic 18, cognitive 20): capturePlanCountQuestion has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae95ecb7a8aebb478c2a0e7cc78d866fb1fe078ee1476fa852fe3f1cd2398e8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modifyStyle (cyclomatic 18, cognitive 19): modifyStyle has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"340a049ea7c712c92ecbcb4acdfb1ed9276f87c4f7c3bdd805f0a54beaefd64e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function advance (cyclomatic 18, cognitive 19): advance has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d5f8d567632f3358c8bf90e5e27f41cce1ebcbad2278593151a907c3e1de3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function policyVeto (cyclomatic 18, cognitive 19): policyVeto has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0e422b66da2959468d6e68334027657cb593c277ec2a41ded9b13ded1b24cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverTunnel (cyclomatic 18, cognitive 19): recoverTunnel has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7c3b29a73545fb7547eab10db6014844d6328d5baae1bfd00a0c053539eeaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbd0770306488c4b6cdbd3c5ebaf5e00d95562788b929c4fc3641f9e1e178b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planSweep (cyclomatic 18, cognitive 19): planSweep has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc0f38025a8fa3fd36f213ca3f1bb5e195b370b2acb46b5c5d7414fbc24f7ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 18, cognitive 19): (computed) has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ship-hook-actor.test.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecffc43b6cf212f2d2b42cbe09cfc11eff1c90eeb9560473eb533a27c25adac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 18, cognitive 18): fetch has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-auth-verification.test.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba9d3271130cc9eef2abd2ba7450964aa5614d86e5c858063e4fad955f5a0e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b756657b5f7bb034ee8f6cb92b20301f6502504fe40c7c07d90b4e8802e446"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spoolGit (cyclomatic 18, cognitive 18): spoolGit has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8f768ce5d428669215dec1e8a89bcff0f138825432e9cdb1bcc32eb2845f2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderReceipt (cyclomatic 18, cognitive 18): renderReceipt has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f9197759d0f567e64e47a7bf8d4680c7fdc4ae15ea71dea146bbc6eb4be60c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installLoadout (cyclomatic 18, cognitive 18): installLoadout has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-install.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"130a880c23c6257b1116e625fa17b7d066a129a53e64ff13792708595239b04c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 18, cognitive 18): exercise has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/auq-parallel.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c478dd27606fa09d602bfcdad01af0471488761cf8728b53df79b3aa607dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-evidence-producer.test.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb01c3a87da608d86687ed58e8bf1e57e9ac890b5415e4db22cbfc67f4334276"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-gbrain-remote-caller.test.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be96a7866cb3f3095b524af53bfc924a4b86e062a37d57a44cd5519bac701f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBlock (cyclomatic 18, cognitive 18): runBlock has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-playwright-best-effort.test.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eae9e14edec021e4959fd9c4d09a4e401b5e44f3d3b96fda2d5228ccc2e61e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeAt (cyclomatic 18, cognitive 17): mergeAt has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cae3af654c62cedcbf36460c9094d1af542148361d43bc5cdf475ad9b2820e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveGithub (cyclomatic 18, cognitive 17): resolveGithub has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-citations.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26775de912aa7ea478fe211bd509daba7c7d04c1e356c3caf96fb5685ab11df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consensusRecord (cyclomatic 18, cognitive 17): consensusRecord has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"290d61351b34ecfbeeb11ebd485d48b249cf5a429b0b503bd4626a7d90bd58b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sarifBaseDir (cyclomatic 18, cognitive 17): sarifBaseDir has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd353643b207eebaaa4059cf7300021a6390e049efad9fe0d4b43672bdbf6ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dxErrorCaptureMain (cyclomatic 18, cognitive 17): dxErrorCaptureMain has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f273a19897e42596f1cc242d1e49643f02bed9b0b284f869bd108d5d5b15a8a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPlainTitlePolicy (cyclomatic 18, cognitive 17): loadPlainTitlePolicy has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plain-title.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87769bb24e4136030a9cca8f2341ef0b36259fb426266cb4895ad2d7059afe7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab6ead6fe3111a0733c42bd587ac8a0bf2f4c6316af95e13dc0b40af2040ed9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSubShardOutcomes (cyclomatic 18, cognitive 17): mergeSubShardOutcomes has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-jobs.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"292e27b9574a9d355d7073c4c685b96f9f7d2ec3bccaf848d1c58db442b845ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syntheticResultFor (cyclomatic 18, cognitive 17): syntheticResultFor has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-eval.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa46b04675f002980862efcaee3895985e977e1ab54da6988fd177e2ffa930"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function concreteExpansionProposal (cyclomatic 18, cognitive 17): concreteExpansionProposal has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0debca94d4f73ca22830dff5fb4c0bbe6e5d4007061a2a944b108a81fba7a156"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFloorDXPane (cyclomatic 18, cognitive 17): planFloorDXPane has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16c80e6b122f9bffd66d68b49a9b9f25f97d5bca9adbfa3c09f90a900d82061"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAttempt (cyclomatic 18, cognitive 16): runAttempt has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fda81842de9911ad91804edba5cca7fc8966ac38b56c392cd3bacfc2cefdc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDispatchOverTunnel (cyclomatic 18, cognitive 15): canDispatchOverTunnel has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/commands.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107b8ce65e4f051b601d0db674040bea04e32d404a56e987c4ce3797bfdaf50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 15): main has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verifier.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e20740bc05be7d6a8db01865fcce63d50dcf7950bc88df616a7ea55765a0e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectRunner (cyclomatic 18, cognitive 15): detectRunner has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb63a034799d2bf17ad5510ae1d155b8b495fb684e2c404d21ac9e846cf491e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupEvalInputCache (cyclomatic 18, cognitive 14): lookupEvalInputCache has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5180d8a350e343cefafdc2b1ca96eb057a6675a09739590ee1334b3436d22a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureCase (cyclomatic 18, cognitive 14): measureCase has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a088c9e3e9e46e0ca4c0cc33f06ddd231766d5ab0131e0f7478476fd1b697cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertOpenedFileContained (cyclomatic 18, cognitive 13): assertOpenedFileContained has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"42330421598071fee18844399ce90e56249de9b6ca619a27a5d3de861af465bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordCapture (cyclomatic 18, cognitive 13): recordCapture has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-shared-libs.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cb3b284402b89afc32a793f58b38195d3dd719f1c02caacaf5c1aabef879d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateClaimOwner (cyclomatic 18, cognitive 12): validateClaimOwner has cyclomatic complexity 18 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e30a89d8df062b73db584fa5311307f783ad12608655d8f6cf9f4d6cce2f5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 10): (anonymous) has cyclomatic complexity 18 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"869f114a7cef56f4ae6b3db3128bea5d36f58996778290d45e416b964c3f0ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engExplicitRepairAUQ (cyclomatic 18, cognitive 10): engExplicitRepairAUQ has cyclomatic complexity 18 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/boundaries.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a35ec6f9ba709e2e689b7c827d9756eac4df78211673606892233fb8eb6017d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 10): (anonymous) has cyclomatic complexity 18 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-design-with-ui.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92dc0e4038a2249a3ecf2faf5be055bdac66f28f2956f2387a127febdaf71e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 9): (anonymous) has cyclomatic complexity 18 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-runtime-promotion.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8d4b5079458a6bf74d950807f154ac74bd8dc334aaf053021c0510cdce61d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 43): (anonymous) has cyclomatic complexity 17 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/auq-native-capture.test.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8bd7edb1082d74e5b33d8556cd5bf6dec4fa133a8c1c5a829bde7350f43003"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonTokens (cyclomatic 17, cognitive 41): jsonTokens has cyclomatic complexity 17 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"53966c22600b26ec8e8fc78bf0b62e0c4d844f748bb97348ab679262ac599869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readModelPolicyConfig (cyclomatic 17, cognitive 37): readModelPolicyConfig has cyclomatic complexity 17 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4612f0e1eece19a57a230af776ed7afaa88d20732714551e4c52bc070b0e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTestRecord (cyclomatic 17, cognitive 36): parseTestRecord has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79bed68015d04d8ded7ac03853c8dfa711ddff106282a427ad71091fa8b97e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wordBudget (cyclomatic 17, cognitive 36): wordBudget has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5580c0905ed8bdd91f1451b5edb138210d8be22b98a7066b7c73f5873e14055"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blankDartComments (cyclomatic 17, cognitive 35): blankDartComments has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e8126812396859224757c45fb1c679aef5ef22428864590f7608bcbcc26e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregate (cyclomatic 17, cognitive 35): aggregate has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b374f91bae9d9d8f28bd23f0274de6a69f58ac6d3ad0022bd14b3dbd1803fcf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 34): main has cyclomatic complexity 17 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/preflight-agent-sdk.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"91295122f939bdb5ef3b5fcbec63c0f74604db498031675c14774975d4367e13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readGateRecord (cyclomatic 17, cognitive 33): readGateRecord has cyclomatic complexity 17 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edac2f169412d4166afdbd41a1a57e35fe079fcf7711e38ef1ea0fda55472f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHunks (cyclomatic 17, cognitive 33): parseHunks has cyclomatic complexity 17 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-scope.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b096366a5f4303dc2362180cc54ee026f36d6ddcacec63b4579884fc40e49d30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasPathReviewPrerequisiteReceipt (cyclomatic 17, cognitive 33): hasPathReviewPrerequisiteReceipt has cyclomatic complexity 17 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-path-fixture.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e0f6d1b54704ffbb607a192c382fa2d0b7dd922d02a8799e02de5e37cb2be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glAppAfter (cyclomatic 17, cognitive 32): glAppAfter has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a38fea12931701c28d31b1092398abe3bc4f060d31a6c45458348ee804e5c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rankedRisksGap (cyclomatic 17, cognitive 31): rankedRisksGap has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ceo-review-gate.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e847660d4c86b0d84a00112b1ce0a7f9408a12ddc39bba4a1a0a0ec6be1de09e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supersede (cyclomatic 17, cognitive 31): supersede has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tasks-prior.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b047f81e8a4269b1167b1727fc5d7003840e5d809d0356f0bde53abb182504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clippedReviewMatches (cyclomatic 17, cognitive 30): clippedReviewMatches has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c3b0567ab0e0b147d6f2fd20caa3eaa3187c3bfff33e89793691e0ed5142fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 30): (anonymous) has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b2cedd8593b4703f344b39d559d9a6e140c6cd9b4301cbbe982b8114361ec0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluatePins (cyclomatic 17, cognitive 29): evaluatePins has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8671712ed282e26c89591eceb6596e96791d31a8769661162fd3422295b1874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveArms (cyclomatic 17, cognitive 28): resolveArms has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a21c0681e3151314529728b56e7a659cb0492910f0080bf6e2459fdf41f98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanPattern (cyclomatic 17, cognitive 28): scanPattern has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bash32-case-scan.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"df597a6b982a6abaee67c5f553d189a41e443f677bdc10a78000d7b9ce0d9d5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 28): (anonymous) has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-devex-peer-comparison-classification.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a596f214e2ec955aa39fbe7648343b03a8776ed28fc4b76aa0f3dc9f62f636"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCookieImportArgs (cyclomatic 17, cognitive 27): parseCookieImportArgs has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-operation.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3af4e669780845e3d733725417b939691632968b00337a2c05b87a26098fe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check23 (cyclomatic 17, cognitive 27): check23 has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/color.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec7c43a51e8240a733e35fcfd540a2626417aa0a759efa744f013b73c115011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsSpans (cyclomatic 17, cognitive 27): jsSpans has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9faaa0dbfe5400632184e6e89292c45cfe5e16918031e743b107c7e685c306"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainForget (cyclomatic 17, cognitive 26): trainForget has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-forget.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0782d4124317416e262363e1cb643ff743e4b081d31bc0b3775fa5a6e5df08b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exclusive (cyclomatic 17, cognitive 26): exclusive has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"041a16439669d8cd5cf24c6f1871b79a723f78961b00ecee9d211f4f948052d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iconSurfaces (cyclomatic 17, cognitive 26): iconSurfaces has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58e8d1e08f5cc420ea7b5259cafcc918339f3587ae95a3551017697f9e1ef77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportFile (cyclomatic 17, cognitive 26): reportFile has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/component.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"934ea93c9f5db07a0303b86e78c12c26fa94863b46c41641957f360093e4aa9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasRemoteOnlyGbrainMcp (cyclomatic 17, cognitive 26): hasRemoteOnlyGbrainMcp has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"323c415eb5d6f40ea135b601eddf7fcfc38e7aeb60f1aab91d0afd88ec5f40a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateLlmsTxt (cyclomatic 17, cognitive 26): generateLlmsTxt has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-llms-txt.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec845614690ced034cc40e23417cee0293e36592c7641b4b116f079eca4dbb43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readComments (cyclomatic 17, cognitive 25): readComments has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb4bd5c64e285becb6f18f10dd83a34659c9dd18c166f895bc0f861568d1567"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRun (cyclomatic 17, cognitive 25): validateRun has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bc370cccb5b6f1aed9918db208e813c41f14f20cce0ab1c97bd1b2ba345091"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSourceExpression (cyclomatic 17, cognitive 25): isSourceExpression has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7b27790eed75356f8aaf7e3cbf7c07bbc7be8ecf42b1a6f298786f13828498"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagramLegend (cyclomatic 17, cognitive 25): diagramLegend has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8d14513d5f07dc5f7a678d06ea1ac6bdc74124e5e648f97920fc53dcdf483a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 25): (anonymous) has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-auq-consistency.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e970bae6544bc0e006fa5324e8a779c5308d6e23bbf6990c510c14114cb3b18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scannerAssetHash (cyclomatic 17, cognitive 24): scannerAssetHash has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-catalog.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e81f500ea63b58ca01101bdcf6dd2e9c3ad7b0dabdf32a9e2d689f37162254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireLandLock (cyclomatic 17, cognitive 23): acquireLandLock has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-land-lock.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04ebfde2783acd41c24d687e0bd45c9516934656d39a265c574fd6ae270178"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function screenMerge (cyclomatic 17, cognitive 23): screenMerge has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b0f45d512d1553662fd8aa0b5cb59cbd54b4796257aa5fdf971b733230b95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glGrid (cyclomatic 17, cognitive 23): glGrid has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2f48a752564b520e3c6aa46c91217aec7a1905119e406961e09e2063fb4729"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkScrollChoreography (cyclomatic 17, cognitive 23): checkScrollChoreography has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e49f3160ece22393ae5df1dc177099dd61160f471ba9bd522edc6b0740204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scannerCatalogProposal (cyclomatic 17, cognitive 23): scannerCatalogProposal has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-catalog.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e257991873262189574774c8cab11352318ff232c0157bae3e405a361bc44be3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 17, cognitive 22): handler has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/pty.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e972629db0bb14c6a10a8a70627ad94b7347837eb7ad3683b9f729a3115266d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recheckOriginalDirectory (cyclomatic 17, cognitive 22): recheckOriginalDirectory has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"601b7c697ce8891e143f61320c80aeeb70c55587072e42b9459c069067c32794"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureDirectory (cyclomatic 17, cognitive 22): ensureDirectory has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16771ee9cd6c0adb5dd123b89d35a62c048e2e2cb3b24b31a369cd2143ee0fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readGateRuns (cyclomatic 17, cognitive 22): readGateRuns has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"60977eb15c4004c4c11db98060907c841518020fea170b9359e99246cd63c4a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBun (cyclomatic 17, cognitive 22): resolveBun has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/runtime.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"06faabc43087056879836fd88e79b0c7b3b4efff74e5a6a87075c893187eeadb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readersErrors (cyclomatic 17, cognitive 22): readersErrors has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy-readers.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4957b14cc16bd471e001e3c180073722643c352537a851018b2d8fa3d4624275"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function strictProfile (cyclomatic 17, cognitive 22): strictProfile has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-catalog.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0965094620b1c2823d4631877a0263256a8792b8b847a8a71e76aa5ff30509"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function floorAssess (cyclomatic 17, cognitive 22): floorAssess has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced9e415cb6b0f9cdbd9bebf7fb3fe5f4379eeada0b11816a6660b5ebbe3cf4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEvidence (cyclomatic 17, cognitive 21): parseEvidence has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/base-red.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3127b00b448eb9eed50a3c5535cc36044dbf923d2b6f03f33af25aa1b1960ed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glWords (cyclomatic 17, cognitive 21): glWords has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9582ad097061da960f819d0a29c572e77c579594c81f940c5ea6e7394d792e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glSetup (cyclomatic 17, cognitive 21): glSetup has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f931111c925fba0d4e5efe2f25c32d62c580fdd4de1c1867c6716c2a24c321"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBase (cyclomatic 17, cognitive 21): resolveBase has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"777010d72bf73601d60e380ae4f68c8e568b9dde8dba8697e53d29fa8ca62160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShipDocs (cyclomatic 17, cognitive 21): runShipDocs has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-ship-docsync.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d416d6156c97109106ed0b85815cfadfaf0fddb3aff5896ce6ca55be07680f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tunnelRevoke (cyclomatic 17, cognitive 20): tunnelRevoke has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1f903690a0c42e5b96a8c823d9d9c6ebce9b7b3caade9c4e7bdb94a3cc47af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnDaemon (cyclomatic 17, cognitive 20): spawnDaemon has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/pair-agent-e2e.test.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce070854ba2686a615822596094f6ce5d0ec750882c8fd997159210ef6f267cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnDaemonWithTunnel (cyclomatic 17, cognitive 20): spawnDaemonWithTunnel has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/pair-agent-tunnel-eval.test.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"272c18e6a36ab1271f0838e7852b532c91b333233cf92b430b97eedd13e0b619"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBrowseBin (cyclomatic 17, cognitive 20): resolveBrowseBin has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6053132e4dcef2ee1242b46f29af4c9ec0e5bb056d2f0506904ad20cd3aa804a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glProse (cyclomatic 17, cognitive 20): glProse has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bde1ad4c2f73d51d36a45555e07e10535bc47e009a3c553bb6516ccad818426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGh (cyclomatic 17, cognitive 20): runGh has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait-github.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa7d857968473336d2be6bd587c25e6fd3fa63b128dd580bd0915c6b18a8d3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 20): (anonymous) has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-edit-cropped-permission.test.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"285e5a25c3d42725a50a26f3976bbf392c010a1df1188cbeaf5086c2ee8da76c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 20): (anonymous) has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-mode-evidence.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c7b8ef96dd623f1a882baebdf5a3c1d3fe8da9c27bc2012d30466237e6bd3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waveStatus (cyclomatic 17, cognitive 19): waveStatus has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9793bd848590d5cf193f5e7a35d5b2ac0f8a6891e097ede6f3f65416fc27049b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coveringRecord (cyclomatic 17, cognitive 19): coveringRecord has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"388ffe33b6419021c56b5e53644104ab1ef1870fa4789f2d81356e080ce483f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markerIgnoredReason (cyclomatic 17, cognitive 19): markerIgnoredReason has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f36181f6f1ff604504b29151bd015206d656ef4fd7763a413bea72e6860b002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintApp (cyclomatic 17, cognitive 19): lintApp has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-app.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3d7a0fd04fc88bcaf33874e4a55652b0c2b277cb6bf25113d92d256b2cabd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatPrCoverageSummary (cyclomatic 17, cognitive 19): formatPrCoverageSummary has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"080caaf65a6e7677af6a0604b12cc3764fc645667fb4025864ce8d69d3561253"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTests (cyclomatic 17, cognitive 19): selectTests has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/test-selection.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"238846d57939cff8eb8f927689f928f1bfc8adbdfd7945ea5f6d9c09dbb8fb25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBrowseAuth (cyclomatic 17, cognitive 18): resolveBrowseAuth has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browse-client.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da34a0e1c3dec1a59e84ff8529b0dca589f526b8ec0446f6302c0b0b1b192cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBrowseAuth (cyclomatic 17, cognitive 18): resolveBrowseAuth has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-skills/hackernews-frontpage/_lib/browse-client.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e3cc742de64a0e1387e15fd21d42b5dec4a98b58a02d8ed9b101fa03201293"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainLand (cyclomatic 17, cognitive 18): trainLand has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57555f2aa8fb29326cc36ae7aed0e3dbba6422c9ddb02d132d57c2eeb5a45c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateInputsChanged (cyclomatic 17, cognitive 18): gateInputsChanged has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/run-check.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a00a473aea0c32377a133790a8b43dba2560b78a2f604cd7deeb9b8bd27110e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMeter (cyclomatic 17, cognitive 18): readMeter has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8880703f8a7d24a1904f9a5259e5e48f9673eb50e1ab8747a716bbcd8e8e2b02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 18): main has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/cli.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d1e91fdd3e641229e9cac0debaa788c7d3554a8900fc685bbb286c77653b3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopedEditSequence (cyclomatic 17, cognitive 18): scopedEditSequence has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df4a45a114054200f58c9c91f849c90083105965f1464a86ac3d296717f7a45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyWorkflowRun (cyclomatic 17, cognitive 17): classifyWorkflowRun has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"336aac016703c71207457e241921fefe150fb141198a66742a65e2890b7ef43f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 17): main has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/review-dispatch-compare.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dad2f92d256a86daffd284b93c57fcf8cd47b498da325c42e9b39869d2d43b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/autoplan-stop-gate.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5450798a9d3ad03f5496f2abd645dfd01d1d0a24e5b055f5b766511dcfe422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function challengeDefault (cyclomatic 17, cognitive 17): challengeDefault has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5847d52164ef8821479d06093e67e82e91aedf66cdc8cfc138595c2b6253eae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLoadout (cyclomatic 17, cognitive 17): resolveLoadout has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-detect.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c820ab26d77a3f1cd8618726a4583ee57b05278656d1aba14ec2d58cbd1c8831"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathReason (cyclomatic 17, cognitive 17): pathReason has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ac78f6bc78844a9d86f771d86666c486c3387b13a1fb6c027bef2e667caef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeEcho (cyclomatic 17, cognitive 17): sanitizeEcho has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sanitize-echo.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"050f64809e49f8452383bab09edae93fe770f91134020c991c1ec175a48e3349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readScopedReview (cyclomatic 17, cognitive 17): readScopedReview has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"431296386231bb2758d0a3af17c703d61c46ec9d8547b81db37a9e9c4a52153f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShardChild (cyclomatic 17, cognitive 17): runShardChild has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-engine.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"17312de0602769000b881bb9c51fd430629f609334d9935b929a14620318543f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isNativeEditPermissionVisible (cyclomatic 17, cognitive 17): isNativeEditPermissionVisible has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/screen.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6a240f27fc1d0485fda84e5138ab14ee50785d4a898ab83bed072ab53f9266"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runQAFunctionalCase (cyclomatic 17, cognitive 17): runQAFunctionalCase has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-eval.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bab8604bb196a7cdce0adf6f359566f96bcf2d560b576703c999d46280ef2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-ps1.test.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaee368d8aa13ce80468f59ef2a26a8e9eb9d41436e11817e96c54f937e048f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function freeze (cyclomatic 17, cognitive 16): freeze has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7944bbc9db8560dd5848fadbbc30328ac9ab7a0ac25f2f6bd9d9cbb4e37cd11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelOf (cyclomatic 17, cognitive 16): modelOf has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/capy-review-pass.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cf408218d51f22c02c0c0ae4cdd14cd19101d69d9a9b101ac118ae6ea7d3b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 17, cognitive 16): walk has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7179dd6ed6f74d817f4f064ad357e75355d2f33d7eb413f3263850f432c0c8fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lanesOnlyHeadPolicy (cyclomatic 17, cognitive 16): lanesOnlyHeadPolicy has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/head-policy.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46acacb0f96526e76f7e9e3d1b949d349a2d8415b79ab4ff878f3e9344d2c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/workflows.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7618a5521d5f5fd35797ecbb9a0d32fcfb11c446b61d12cf04875b332709651e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ecf92ad9ff45cc64227ef3d501f3d448570bdc372bb0f2fda1ae2c15c9687a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fragmentsErrors (cyclomatic 17, cognitive 16): fragmentsErrors has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"d376d466c43675123d534da55a0d1cf6be27b216bdc71616edc00f3bde3b3bb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processTemplate (cyclomatic 17, cognitive 16): processTemplate has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ddffb5ba21ca470040b6237f35ad2197789a62be5cf6de793735887781f1be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCarveSectionCase (cyclomatic 17, cognitive 16): runCarveSectionCase has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/carve-section-case.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"70537477a446cf321aaba5b6ced62b44926f3562a439d1aa38c1dda014d34bb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertClaudeProducerSandboxPolicy (cyclomatic 17, cognitive 16): assertClaudeProducerSandboxPolicy has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"883cd4241a0f4db3b7caffc5ebf3d8aa14f99248e5d659ef8ea06452731da6b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeHighWaterMarks (cyclomatic 17, cognitive 16): observeHighWaterMarks has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/observation.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a44a23b9b974e28665a4ed28907811e83988daf1eb3afc6efe2834da32a787c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampProof (cyclomatic 17, cognitive 15): stampProof has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ee8f7c07569d133ba1cf55a86cb76570be87e3d7465bab1966834d33aeedc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFinding (cyclomatic 17, cognitive 15): validateFinding has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bad3967d8992a3022fba6b33b62c85cc284988d9c9b752a0a141003984e142c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 17, cognitive 15): record has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-bots.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4142fedd2f07aa4b6ce46a934f7cdae6e67ddada16154a2f733c1c2bcce928b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixRangeBase (cyclomatic 17, cognitive 15): fixRangeBase has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffa77bfbb8377939c3ef66cb02501159adac432e20d0837caf3ae98b7c9a0fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkContract (cyclomatic 17, cognitive 15): checkContract has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3043b99f13df6373467efe47db7cc32006cebb59d8400539540ee5c5bd5344ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCodexGenerationModel (cyclomatic 17, cognitive 15): resolveCodexGenerationModel has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolve-codex-generation-model.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b29bfc6c67c05a80d49d64bad6004cfc8c44011c6b3255a682e825962f386e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function displayedNativeAuq (cyclomatic 17, cognitive 15): displayedNativeAuq has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-native-capture.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a747d7490a82e330db6b55e2c27038cc0ef12fbed4674469b85b6dfe1b60f9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verdict (cyclomatic 17, cognitive 14): verdict has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de39be4c73a9ab26e285fa4d9cd57f1d994ff35c13d3b6f15ffbf5b875cb04b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function phaseClose (cyclomatic 17, cognitive 14): phaseClose has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-timing.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2098740fcb71922b69a084c47cb335b2e0973a760b61268efebd25bd19d083f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPublicIPv4 (cyclomatic 17, cognitive 14): isPublicIPv4 has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"321a50bbb12122b73b260d9aea22decf754609e8f3aa8741426c963fe7266fc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 17, cognitive 14): collect has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"741511c3c840ad34f1ee21b44f8d21b886de1f8806e951069a5fc31cfb69bfa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAutoplanEditDigest (cyclomatic 17, cognitive 14): createAutoplanEditDigest has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-digest.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"505a140f6544fc044895083c279ca6ab543b4cca9e6504f604a19696d4cf938b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 14): (anonymous) has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c674ebc6080409f288a03716a921e713823e90f99396dfd2572e69c00214e013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 13): (anonymous) has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c03ad65a722f93ce2a2c9427fcea46bd7a14851bfe27c314ada460736f8030"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandGateErrors (cyclomatic 17, cognitive 13): commandGateErrors has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"900840e47d7e0e166bbeabc49d893cfe0bd43aaee06ac99b622cfc59926cdd05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isReviewAUQ (cyclomatic 17, cognitive 13): isReviewAUQ has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eng-seeded-coverage.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b84b6b8ded0d482cf86af24109cc69e89e867c45cdfe5eba70c66c7bbbbbc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 13): (anonymous) has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66370eca61784c558cf9acd5766ef39fbd85fa11950a2d97a0a8dccbd8d2fc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaNativeCapture (cyclomatic 17, cognitive 13): qaNativeCapture has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-evidence-producer.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4427b7114ee71093fab6a94e09827d6d2db0b1399b822767144a27495e80a82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planGate (cyclomatic 17, cognitive 12): planGate has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-citations.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d133ff4310b4896936ba3b0fd56118ec000160829578d335afc921eace1dd1ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSameTreeChecks (cyclomatic 17, cognitive 12): mergeSameTreeChecks has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dad7aac8cb298158da938dc985b72142ce809cd61ec0fd71ed8f3c504007e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatPanelLine (cyclomatic 17, cognitive 12): formatPanelLine has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17e374128a44e3a03889f28b15cbd11df3614ed93512c5b8856672e4ff9291a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prefixResults (cyclomatic 17, cognitive 11): prefixResults has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verdict.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc81e5c820d309eaa12ea84b2a061647e90f1f5d51ab5a040e11fc0f90e0c49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reducedMotion (cyclomatic 17, cognitive 11): reducedMotion has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"25063d631dc043dc165a005abb7ef62ce20844973870d6429e09ef985ac3b6bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 10): (anonymous) has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee7b6e36c2d74a905f29d06635a02fa39f8df87f52c891889202790e12f5c08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPendingQuestion (cyclomatic 17, cognitive 10): readPendingQuestion has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-question.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"547bf5dc8be19096366a98cb4fa0479db324d3421f0ccde405ae94f75d6e8ed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickPlanFloorProductType (cyclomatic 17, cognitive 10): pickPlanFloorProductType has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-floor-review.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"464d7f26babd1a391460573355882752817412b9fe2b6cb21212b22ac4645733"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flatBody (cyclomatic 16, cognitive 38): flatBody has cyclomatic complexity 16 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/css.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"318fd8841d2791db63a3e7b35c7c6ebebb638cca9372508fd1b0f028f4481cc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkHeroCopy (cyclomatic 16, cognitive 36): checkHeroCopy has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome-copy.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3969507e78e18824ae968a696f9538e41e81eae4bb0dc1e6894520ac8b68ff1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripTags (cyclomatic 16, cognitive 35): stripTags has cyclomatic complexity 16 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fd6732c645836c0b466b12714fed2c44986c47dc865803aeb38a32f70475cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownerIndex (cyclomatic 16, cognitive 34): ownerIndex has cyclomatic complexity 16 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63173cc26350fbb11a8913725eba589f7a0730080cebf605d5efd2f5998386f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPhases (cyclomatic 16, cognitive 34): checkPhases has cyclomatic complexity 16 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfbb58dd26ff715ff8d388108931ceec2b9fa6f48dcf2987a7938c742278c55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractBrowseCommands (cyclomatic 16, cognitive 34): extractBrowseCommands has cyclomatic complexity 16 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/skill-parser.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"610542a6eb7673ed6a2065a3e79c98c296c9e24115b463e017dac87f9e9a42a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consume (cyclomatic 16, cognitive 31): consume has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-observer.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e978182daac7f89dc049d624f87cd5d24dc9ec6e202783978fac02b3907085"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 31): (anonymous) has cyclomatic complexity 16 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-functional-prompt.test.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca740c3cdcc8688848d5c4aeace8d503284ceb8f29643b3dd3731768c0de928"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paidTestClosure (cyclomatic 16, cognitive 30): paidTestClosure has cyclomatic complexity 16 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/touchfile-closure.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c315146e01f974eeb934c0c4ed5cd1f34d0f4cc59bb9dada7c28dc13138b6e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProfilesCommand (cyclomatic 16, cognitive 29): runProfilesCommand has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/chromium-profiles.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd36cb75f43f22f1bb424c8d537c56fd4c74509bea394e13d9b9d67db6ee1db2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 29): (anonymous) has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-evidence.test.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7f59a18c6e4f8271ab4be32b6ff907eb94cb859bac0f3f84efbb6ec8ff1f48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oldTextFindings (cyclomatic 16, cognitive 29): oldTextFindings has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/sealed-stream.test.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1563fec05932b82766f4e8e7d0cad71939f2ca344f65da9204d444c46a1e378a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupWaves (cyclomatic 16, cognitive 28): groupWaves has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3be2d621be4786d998d792eff9b3d891186d44c4da84d3f86518b32625822a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 16, cognitive 28): download has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"175d95e45908becad2bf1cc6b8e1e9acd09dfbf9e59d85e43ea6dd23e23cae21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glFields (cyclomatic 16, cognitive 28): glFields has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-quality.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e140a4d4a195c7f5d0b1bdde8962d9eebfe34eb61c32c353c96155c4de9b1f8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPassRateHistory (cyclomatic 16, cognitive 28): loadPassRateHistory has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9199c4e453db8c041fabba0e2a838aae30900742d7b27584366f7592e045bac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampFreeTree (cyclomatic 16, cognitive 27): stampFreeTree has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e41d6a42f223f4746ef2fa24d8034fd18d3ae5d6a748969ed5a667903f6f5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTasks (cyclomatic 16, cognitive 27): buildTasks has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-export.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"73714f84727f43e9b7fff8fc48d92dac8c55cbec6da6519b38c746cd90cc0adc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireClaim (cyclomatic 16, cognitive 27): acquireClaim has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"68add46c0b58509c77b39f6de36043c0e1e80289b5482ab447b9c38f7c6a2c98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeOf (cyclomatic 16, cognitive 27): closeOf has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/sdk-system-prompt-tripwire.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"67da45e52b07efa9effecddf257411ea2d32ddbfb02b0a04781f7a70990da95b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncActiveTabByUrl (cyclomatic 16, cognitive 26): syncActiveTabByUrl has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0bd9785c0be1c8b8e938c55996c3b761af13140b13115c2a1e11546161864b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdWait (cyclomatic 16, cognitive 26): cmdWait has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a79d51392fc4912362de0383301f45a87edae59c36d65b92046611e28d44f22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 26): (anonymous) has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde50cc40bde4510941d1c4827f0d3f1b193448b1999e648aac185f7f7cefd27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function advance (cyclomatic 16, cognitive 26): advance has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/review-pass.test.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e897bdd2b00ddb3efd821489364b8abee5637f9533e2cf3c2168091b8b984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cutRelease (cyclomatic 16, cognitive 25): cutRelease has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7f88ffd349a37c94e887c56cb3d6f7bf381fa9885d5867ce21abb8017f4a87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classHits (cyclomatic 16, cognitive 25): classHits has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"665da75c7737a770756791cffe8943824b90d9ffa03a7cbbb15f8d75f93a1f49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 25): (anonymous) has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025acaef5d074ba4316e994c0c14946ba01457edf770e6801c68ba3ae26e8d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check7 (cyclomatic 16, cognitive 25): check7 has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/color.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"febe3f6f5f4432bcd0047ed47596254a8ac63e3d4742b42107e9396de74754ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 16, cognitive 25): visit has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bootstrap-retention.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6738496e2191946079f7a524e3e6b26903896673354e65449ac47588e0672c09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 25): (anonymous) has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-ps1.test.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8094b5c939cf6871b78b3d543c02619f58b05510a48124285516c0b4cb9770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launch (cyclomatic 16, cognitive 24): launch has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a321346a5518725bc68d90ee60cbd2de5fcdba8b3b4363a09550691b890acd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withResultWithdrawn (cyclomatic 16, cognitive 24): withResultWithdrawn has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-phase-publication.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd1d21ce1b0454b300003fc85d77e5285b1f048dedcff0913573f518b0de40c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 24): (anonymous) has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bc7f8b2c8e8a5e929caf550df197a222ff721e780262340e1b446dd7651606"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForReady (cyclomatic 16, cognitive 23): waitForReady has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/pair-agent-e2e.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d142261a320e806ae7c791cd62174bac5c7e948f4f99929845773f459eeb0197"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForReady (cyclomatic 16, cognitive 23): waitForReady has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/pair-agent-tunnel-eval.test.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09b203d972eddd230243b37a0bebda6eda0a418694fa54e4b749ac17e26019b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkChangelog (cyclomatic 16, cognitive 23): checkChangelog has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87207d33fc79233d6c73b270344ab6a899e5d59119bb4fca08db49ed9fcfd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function git (cyclomatic 16, cognitive 23): git has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"627365dbae9681a49c54476fa8527aca2cfdee78339d8c27d453842d1e361b9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDockerScannerApplication (cyclomatic 16, cognitive 23): prepareDockerScannerApplication has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f8b286fb47dd067e9476fa4619aa614aaad2304774f19e1ed74bdb83ae736c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateGeneratedArtifact (cyclomatic 16, cognitive 23): validateGeneratedArtifact has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-check.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40a1b41cf19a11bdb088ba44adc1adc8ee773ca514fa929cebcb376367c9551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recreateContext (cyclomatic 16, cognitive 22): recreateContext has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef47ed505962ea24de31daa8e1e5a05cabbd77120513f94daa97e2758190032"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newShip (cyclomatic 16, cognitive 22): newShip has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/review-dispatch-compare.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0057d8ceda7b054cb091f11e16b35de1c048fa6785d01184548fa96ec120a083"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedTestLines (cyclomatic 16, cognitive 22): addedTestLines has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"77571a81e75ed25ae71095d497d1cd1c4e6a089214ca61fff45d37446d7de78a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inStructuralToken (cyclomatic 16, cognitive 21): inStructuralToken has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-engine.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e757944a3c76844dc3a4ef290de326543b909f1a25b42f793f2b8ca91bccabd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-owned-state.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40dfaa0974b548f215461414fabafbc99458f06225868415a9f977d9213756e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-source-reads.test.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b7b802a958438382d93c24cbb801a7d9637c21c7b71bea8542de2e047c66c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function controlHeight (cyclomatic 16, cognitive 20): controlHeight has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbfb533bc83bf4bdac273430bb8afc2e3808dc562c97c3310ccbe76d3147738"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 16, cognitive 20): run has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb072b8a082e52e301f584c2aff668612093f7407562384aac3324662111df0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentCreatePreview (cyclomatic 16, cognitive 20): currentCreatePreview has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed0bc258cf79d6eee6b47a38d829925db41473ee87ed592ad8d8c5dfa2f4c87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireAgentStateLock (cyclomatic 16, cognitive 19): acquireAgentStateLock has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e2667bde042ea9c521e9a717718c31eea48b1c148e00d04a3ee3cb69873d97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regeneratedAtBase (cyclomatic 16, cognitive 19): regeneratedAtBase has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/version-gate-train.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d8b8bfd3e92c997a39b6419251af09591766c54874224214c852d7428bb353"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 19): main has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/measure-journal-read.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f1f21a31430d6bca8dc5beb97bed91e178b569b433cf9b011124952b9c8418"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provePreparedProjection (cyclomatic 16, cognitive 19): provePreparedProjection has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a339e993a83fc2e258ab6cadd4cc11a415286ccadd63423ba5585af9752463"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitConversation (cyclomatic 16, cognitive 19): emitConversation has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef0ee23823d2be0aa0b4f7845999d7b361b325dcd152490d57dcae0bcd9d3ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observationTick (cyclomatic 16, cognitive 19): observationTick has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/observation.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c825a919b3d5b9e7b7f7695c9e8a1618983f1ef8ecc09332ae4f48820f11580f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-autoplan-schema-canary.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"530c64894709e9ae430930e0ca2e02fb10eed0f40ddf0cf11ef3d28acef039de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 18): (anonymous) has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bbd23ee96b4e5534bdb90a58164b0cb74f7202faf014de388d7da1c5fe006d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispose (cyclomatic 16, cognitive 18): dispose has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"b024f2810384ab51cbedfed559c5f9806a4554e99e3e66f5da7cf29a6f2db278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glSlots (cyclomatic 16, cognitive 18): glSlots has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"426329c52f79321ac070713dcdd90b1b52d0877c9ab44555caa21c137003cd83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repoPolicyTierBatch (cyclomatic 16, cognitive 18): repoPolicyTierBatch has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b4f606dedee866a0a41779de4e9b775fbe9a11190440fdbb90b8ce90b4b3f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectProducerReceipts (cyclomatic 16, cognitive 18): collectProducerReceipts has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b45aa05e3b6fcad9b96f069042483db09d97c79d2f69d02bc90296465053a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"714caf4457ca1bfd2b1ef5887c01f6a4b1c76f58953eae11053b7eb8bb09ab43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c57ca3fef008edc5a434514a6e9c0962b174269deed0204eb134c5a87af4e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function geminiFailure (cyclomatic 16, cognitive 17): geminiFailure has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/provider.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7dfaf6ed588055910a1a91e2fcef701290d11937ce829308c08c7c8ac593a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAgentModel (cyclomatic 16, cognitive 17): resolveAgentModel has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/agent-model.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c75fb6ce916b32f4fe84b012a714be82b2dfb6d1da570089a81fe2e9e25a6b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderOfficeHoursReviewerPrompt (cyclomatic 16, cognitive 17): renderOfficeHoursReviewerPrompt has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade4a49a5cd771924a8b4b0e23b369437ee5315b4415dff4b32bc68b7014fef2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ci-paid-coordination.test.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3b75c5814d3f6b556559c0f8843bde14aeedb57ece4b94dd01a85d8e4a4e5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function singleScopeBrief (cyclomatic 16, cognitive 17): singleScopeBrief has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b021f818d30a1a386f620ea55d2825d9343a18d9d6d3c6212fa61016ecc4f52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addQuestion (cyclomatic 16, cognitive 17): addQuestion has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9865756bfe0fcee0b6c4a9a0cf41f517f4d47921b3d40aa6147007465007a103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unbreakable (cyclomatic 16, cognitive 16): unbreakable has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-land-lock.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"288222b51bee7864c0ca808072a1d8d0afaeaf54b517da0331987032e1e3d546"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCommand (cyclomatic 16, cognitive 16): runCommand has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9e63647757f47f8d0b41e0f4f972e5e8b116928aedd0dc7e40eb27e57b06c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRecheck (cyclomatic 16, cognitive 16): planRecheck has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-recheck.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e75fb24d8c304bd7a87a353a6ec32f990c532c0d1c97c287c4ee3138ae8b90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/release-cut.test.ts"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c44bb46a007e6c60d7282dc1c485770f91105fa1742c123a41a4ff2467501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/test/fake-device.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e26eaf4032b5ef95921bbc187566399c2a8886b4518a2c9a8845822cd3278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function browsePdfPayload (cyclomatic 16, cognitive 16): browsePdfPayload has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a5ba670a9aa8baaf08d2caa99d001a92b5bcfb398977309918ec5bb832c2f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repositoryIdentity (cyclomatic 16, cognitive 16): repositoryIdentity has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a33965877acfc80a454dd9dc3fda344c169f631f3ecdee9e605c5435501014d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWindowsBashCached (cyclomatic 16, cognitive 16): resolveWindowsBashCached has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/script-invocation.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e845eba2438009f47e2a7ae2a1d67f3ecc720ff70e858656e0b0795b6fd2c5e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sealedPolicyAt (cyclomatic 16, cognitive 16): sealedPolicyAt has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4afb8fa27c218a42fba57bdebdf79650b6c1ecabecdad8b6cbb25ebd57bc3ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-split-collection.test.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"263de1dac7b17baeedb45381262cdf747afa920060703a0313ae400c6e6d82a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 16, cognitive 16): run has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/gpt.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"161f60825e64e8e9463827d8725729a80340b7c929602ad900154a74888846be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareGateAhead (cyclomatic 16, cognitive 15): prepareGateAhead has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516eb5655fce27e11ab930636d817b682cd9840d4160e56ad4e181868088e53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyBaseRed (cyclomatic 16, cognitive 15): classifyBaseRed has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/base-red.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2cd198b7fe77e8bcc96fedabc3f85d0a87294bde6ae34a5c8fd45628ee4177"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdPoolerUrl (cyclomatic 16, cognitive 15): cmdPoolerUrl has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"012f8bb28a89a3a192d82330669963097e625270a275369bacd475290d0e30ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function targetNumber (cyclomatic 16, cognitive 15): targetNumber has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"08486b3f51f88d9e67f4e9bb3ebce8b03a2c824e2b38cf1fcbccccb2493f8096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSpecialistOutput (cyclomatic 16, cognitive 15): parseSpecialistOutput has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/state-matrix.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d2fec4ad0fc4bc9d3b476a7275a0bed6da871318aad38f48a42ac6b8e5cd33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsRecordSources (cyclomatic 16, cognitive 15): docsRecordSources has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3536dba52ea01e1af004df7aa0ab2f7cc7f1c356a44fc8cfe5323cd0e8f3fc0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShipHookActor (cyclomatic 16, cognitive 15): runShipHookActor has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-hook-actor.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e0971f1a9969ba938c5d8a15a27e927670d61d870003a29f36af30ff110850"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSession (cyclomatic 16, cognitive 14): readSession has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/session-cache.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa676f2f4fde930bfeef13b80e9828901467830d0e872e7514cfc50fddc4de6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claimShadow (cyclomatic 16, cognitive 14): claimShadow has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef82351b66e6c3d6f6c9104526e68b0d466777f64dcea1d54fc08f0ea2207262"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admitLocalImage (cyclomatic 16, cognitive 14): admitLocalImage has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec41bf784f093230f3d7c0b88ca88547551028391d9cc81d81717d7b6e18a97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPage (cyclomatic 16, cognitive 14): buildPage has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57f087eb0ca1bbd4a461bce304aacd29aa834d41f77587e80bea5564c5e807a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRefs (cyclomatic 16, cognitive 14): resolveRefs has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc1bf30447ed3f7425d93ec7c0d5b21422f286428a2555ace879db3cdbff860"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/prose-lint.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0481a36a389ffb6a9f11174a89f97de0495f24c15ce19776fd395235b3f6f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePortableSkillFiles (cyclomatic 16, cognitive 14): validatePortableSkillFiles has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6ad3deed03f742493d9abd1f24d7b3304cf46b2dabe9a66372c49afb7f151a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsComposedReadAllowed (cyclomatic 16, cognitive 14): docsComposedReadAllowed has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"be85a43eabb8117945a970f605855c1a53c3205c6eb386a12b622751d0a05233"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gh (cyclomatic 16, cognitive 14): gh has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ship-queue-land-direct.test.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"564e51faca0407dec45f9d05ae36f450ef59e3ea727ef848f80c4c22a1c3c014"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseOverlap (cyclomatic 16, cognitive 13): baseOverlap has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"db58502d95165dff09cdbc2acbfd4aef404b86fcc122ba9958613a4a7da34c7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBinding (cyclomatic 16, cognitive 13): buildBinding has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df4e11a063079a2c2463b3596eb28f42f86880caf2b0819bd3bc47afb105af9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeCodeMain (cyclomatic 16, cognitive 13): claudeCodeMain has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b840d8f13a713e3f4f7a2316f441d8029fa0a573d04874faf6ed06e636cb5f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keepSameTreeClears (cyclomatic 16, cognitive 13): keepSameTreeClears has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"81171e93ba4bca4ba5a363e785baf267f274fbdb28d2c496e745038ffec5a3c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-scanner-docker-integration.test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"290c64c1cd3d20ec3b54534f651312b89bc6a5ead5ff9837e316d2ec67152204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePlanFloorCitations (cyclomatic 16, cognitive 13): resolvePlanFloorCitations has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-floor-review.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d616d06d33cc400e08878382b51d8e97317f97b3a878dc1d0c7b72b861aa77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEvalInputIdentity (cyclomatic 16, cognitive 12): buildEvalInputIdentity has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27e47d225e13e941a0c7f5a4f0c623d60d32d0d847b96ba03fafd31ba11323c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverMetadataTemp (cyclomatic 16, cognitive 12): recoverMetadataTemp has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc20bcedf04b72c40a9e099d2b154e705c7629529fdcf60164596b02cf291d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createReceipt (cyclomatic 16, cognitive 12): createReceipt has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a0a69334c68238ceacbe5da306efca5d0f3ed6e6d410030424f4752034c2bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifiedStatementSetDigest (cyclomatic 16, cognitive 12): verifiedStatementSetDigest has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-attestation-evidence.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2756092baedfa13e5006af5b458208caec1cf36d40bbfa8a7f10bb6fdbb3fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function subShardRecordProblems (cyclomatic 16, cognitive 12): subShardRecordProblems has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-jobs.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c21744bec7db00406f44c2885255083edf4963299bba18843b2deab6d561ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgePlanFloorReview (cyclomatic 16, cognitive 12): judgePlanFloorReview has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-floor-permission.test.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"90299e5a9ff5a7ab1a75f95fa93e676cc2f83e2d41cfea89f67424c5efc23aef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 12): (anonymous) has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-ship-measure-loop.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f190fae895761e9d7db5121382a698366b52bdb939e0b01bfa1a4b63438a77d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOwner (cyclomatic 16, cognitive 11): validateOwner has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aff62c6bdf3c48169ccba45fdbdf06079a8e7f9305a34c8f2a5d32ae865e9e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 11): (anonymous) has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cd707d0556c4f29e42a4771f2c326745ebf1495771a75ad458be9819781f02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgedCapture (cyclomatic 16, cognitive 11): judgedCapture has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-shared-libs-periodic.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d76b204c7887694285ede19cd4911b3f2e0991a912de7fb6e868c9d67d4cfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check65 (cyclomatic 16, cognitive 10): check65 has cyclomatic complexity 16 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/color.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba30f492ebf33f9e097575c4c0a60dfac06c72cc769908b4018683881b43ec9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCookieDomain (cyclomatic 16, cognitive 9): normalizeCookieDomain has cyclomatic complexity 16 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8f5ca756b31699d3ce275e59f23cf9afebce3476272a94f44cae81162a8d73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRunner (cyclomatic 16, cognitive 9): validateRunner has cyclomatic complexity 16 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c0ae780c6fa7f40348491637a0ccbf9b9639f05f22293807c7719fad2da920"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function specifiedDxTaskNavigation (cyclomatic 16, cognitive 9): specifiedDxTaskNavigation has cyclomatic complexity 16 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9906558791b15c118eca45d29a816aafd0c1ddc42f9fc9d48f1f9ac632754dec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathsRejection (cyclomatic 15, cognitive 38): pathsRejection has cyclomatic complexity 15 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/read-only-commands.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d753c55772fa5ac7aa2bd585c2d2979d485c4076b712d9ec0012b72041860061"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ignoredGeneratedPaths (cyclomatic 15, cognitive 33): ignoredGeneratedPaths has cyclomatic complexity 15 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-check.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43dd9442a444d68fb9248bd961dd9a8d2eec6cf8c5dcd8e0fe55b671ae481f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check25 (cyclomatic 15, cognitive 32): check25 has cyclomatic complexity 15 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d751ac79df7c1b4ff2663e77dcfe0ec751bbee7ad13bfd60282df4133921f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function brokenSectionPointers (cyclomatic 15, cognitive 30): brokenSectionPointers has cyclomatic complexity 15 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/host-conformance.test.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c511df3059a2a9b06b2a87b0ce53b8ed5637d921e1060e096bc3dc806b309713"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStyleIndex (cyclomatic 15, cognitive 29): buildStyleIndex has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/css.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0fb948fd5c733200375c1ebe291356067353143f02d3478742258dd90dd1ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triageRun (cyclomatic 15, cognitive 29): triageRun has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"653e9fca4ff5b112fb1e3ddb3eb168e7ab013c5c0615aa4230105f654730e9b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipReferenceProblems (cyclomatic 15, cognitive 29): shipReferenceProblems has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/instruction-facts.test.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d062c3532d1e3b79eb288fa106d9fa39b4252da730cb05845475ca77b4d1c5b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkImages (cyclomatic 15, cognitive 27): checkImages has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e4cfb9a4fa95278884f7e549d3e6f89d07c2c7c44dd4f311c065a9dc8352ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireServerLock (cyclomatic 15, cognitive 26): acquireServerLock has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b42d21e0c87057df0e72ee92dac574991945b4e4eab693ee1785f03f8a4bba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jsonRecords (cyclomatic 15, cognitive 26): jsonRecords has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0a8fd6e4b47915f753863477eac29590d57911a3f2309893cea36e0022c6bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 26): (anonymous) has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-production-deps.test.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc23cb9bf8df66493407d6b6be4e293d71deb86f5b5b1216fdda1fd5c3567be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatInspectorResult (cyclomatic 15, cognitive 25): formatInspectorResult has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a07582a38cf90ecbce13f7296a71f23bf6bf19596c4e92e64e6d3d99bf084c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampChain (cyclomatic 15, cognitive 25): stampChain has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-stamp.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea1bc41b23a347c0f0e209e22bedab4e2a8242840dc91a1f0be89bdece63a82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runShadow (cyclomatic 15, cognitive 25): runShadow has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd09afacc8b6536d4c58d8ee5f2b5587c597c8070fa29ff5b340261a19416b3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapShellCommand (cyclomatic 15, cognitive 25): unwrapShellCommand has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-host-runner.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"036e8a33cfbf113e91b48c74e73e5d92d0f7f2b8cdc9bffdc84ccc59c07a330d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownDiffSignature (cyclomatic 15, cognitive 24): ownDiffSignature has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-reuse.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48a54f91236d4533f90889f2a4bf26e4cea67053190c3bc775014293adc99a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function basicBuildSelector (cyclomatic 15, cognitive 24): basicBuildSelector has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c703816b33e92389c85820fc7e41ccdf1fc75762d4f0dc5eab18b7869c646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testsFor (cyclomatic 15, cognitive 24): testsFor has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c77ff06b5ad428d3bb2023b0f2c9912424b376e3a70d0c38d2cd537125b4b63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tentativeMentions (cyclomatic 15, cognitive 24): tentativeMentions has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeeb428e2324f4aa170a88f1cb06205c3eed31cd93b5b9abdc70e11a5fb212c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulate (cyclomatic 15, cognitive 24): simulate has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/evals-train-workflow.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"080a421fb968c6318e2cea04c01da19fc63eac6d6f4f7a3da49baf73c7328b20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 15, cognitive 24): walk has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/path-spelling.test.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d273fc71481975c0c8b23d6b5bc122e258833491b5fc1afae0b545f282b148e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseChecks (cyclomatic 15, cognitive 23): parseChecks has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-gate.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"744f6702c098e68d60451d6412fe49523d7f94b373e1a57c6248b89f7e02892d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkFakeSend (cyclomatic 15, cognitive 23): checkFakeSend has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"48265111a81618401da811035b936b8a13e7de33b311f59fc1efb365429490cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twTokensOf (cyclomatic 15, cognitive 23): twTokensOf has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2bcd2b7f867353c444643228638de3494f720a0fc591cb9b4a1b15b3a26489"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCatalogDescription (cyclomatic 15, cognitive 23): splitCatalogDescription has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fb42a525cd7405aec62afd8adca29bb9bc5204eeb4a05e2b55353019922ebb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plannedCases (cyclomatic 15, cognitive 21): plannedCases has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab0ab3a9a89dcf788f2150a53f486ed1b7f31327acea8400cc2f3545eb729b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSelector (cyclomatic 15, cognitive 21): buildSelector has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb592345c6475684d55213e70edc9cfb967b5d62606e234aaad98cade15b8487"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePublic (cyclomatic 15, cognitive 21): validatePublic has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-public.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"873bb7741c2816af38ac5df92b1287fe1afcfa9b8b78ca2b98f835e3cd95c674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverInterruptedOperations (cyclomatic 15, cognitive 21): recoverInterruptedOperations has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb51cda03127e89c938622fb22542fffadebc565973d9cdf947237578d4c5bc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateGateList (cyclomatic 15, cognitive 21): validateGateList has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-list.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4f0ac5088dc78769e78c7d2ecd67d985b36efa4f3ad7318bbdb09ea1f187fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relatedPrs (cyclomatic 15, cognitive 21): relatedPrs has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/issue-links.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f61ca33b104b4927068c8e99297b0ec054c11a40961ef26f81be4adac0df5af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grepConsumers (cyclomatic 15, cognitive 21): grepConsumers has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e70d5840a39d79271aa3ac660532d89944ebc84f6bf84ed1d48c508c76c5186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function delimitedRows (cyclomatic 15, cognitive 21): delimitedRows has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a690643e3820d9f720dbda38a8389a58c7836de6055b24107949299cf4fbdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createBootstrapRetentionScope (cyclomatic 15, cognitive 21): createBootstrapRetentionScope has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/bootstrap-retention.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d299bdbb114d14de0c7579f09f8a3b0398cad3efff1bdec0ebf53b79c5e960"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assignedBy (cyclomatic 15, cognitive 21): assignedBy has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/generated-bash-lint.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ea98cda8c3b8fed692384ca7d011b823622e748667b99d7001c278c37db69d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substitutionEnd (cyclomatic 15, cognitive 21): substitutionEnd has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b108cd46f4a560e894474cfef0471ce4c5d67396aa33cd694c160920134790be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changedFiles (cyclomatic 15, cognitive 20): changedFiles has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"113dfa1105fb0fa17a598b99edfdc1cd87a3d1b6a2839c697317fd56bba349ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 15, cognitive 20): walk has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1289e2215bb577d28769e1e5d9607d4813266c87495c25aaa4be12a8be23c370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifest (cyclomatic 15, cognitive 20): manifest has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3655e9c5a7afceb0d9edd0a372389b065c5749a3ad3a6631f52d1ef6e1ba569d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokensFlat (cyclomatic 15, cognitive 20): tokensFlat has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa66a85d2b6525ba4e3b4939f34c0bc9808dd7e02cdccdfd2aa64badcf15a0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDiff (cyclomatic 15, cognitive 20): parseDiff has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95488869a0a10570c4c991608b7861792948934ff2f1198ad052b8e11a7a650"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulate (cyclomatic 15, cognitive 20): simulate has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d070353d6cfe9b1f96ec82709d43194ec1f5d8832383414d1b159c34a66e5a53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexHostTranscript (cyclomatic 15, cognitive 20): codexHostTranscript has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-host-runner.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"742febbf8ad25d32c7de17c90ab2b501129092207f2fb7aea4e4c6cf585b96d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ae45369703c9abd6e18eef85a666612c4d7ebaebc5b79466b6cbb3c4641af2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainPrefixes (cyclomatic 15, cognitive 19): trainPrefixes has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fdfe0d3a217ca1d488f0b8e2e3d9e0a8b91f30173100c2f44be32df43fd0e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locate (cyclomatic 15, cognitive 19): locate has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"087cb5147830deee65de52a44187a0ea7364a9598cc48e8e2c6a5a4f50a1d554"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 15, cognitive 19): send has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f55fa9313d0df0f4e928c9699587d0e7f6b4a358f3c3f20f17362709aa17269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkedPath (cyclomatic 15, cognitive 19): checkedPath has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-deadline.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"af611144448f2ed82ed9a3ab1636e2840c6ee6483cf3366056b49b121abffa46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expressionTail (cyclomatic 15, cognitive 19): expressionTail has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aac3901ee391632a093eb686f992777133c09115ba3be1029711bbf642060a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileRecords (cyclomatic 15, cognitive 19): fileRecords has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41ba3b5fc814e28ac12c0589b71e6fca0b5b219e7eee9b3010da8494bce4320"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withoutExceptionLines (cyclomatic 15, cognitive 19): withoutExceptionLines has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-prose.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c65a41a5a62afe15a48d2ecf1b20eef0ff3a2dd44d2e102f3d04f21ac94de9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSkillBill (cyclomatic 15, cognitive 19): buildSkillBill has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-bill.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaa068638651fb102b96c46d3fefce5ea36d1c74f51f69ebacff7a43c33f7e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateExitPlanModeGate (cyclomatic 15, cognitive 19): generateExitPlanModeGate has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/plan-gates.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd872dc8280ad45b30327a3f228eb5c6c203c1446ead4ac4e78b16bccfebcb25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/banned-terms.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1444340d4f5b5a59955b82c6b05db5f3217904c0da66530b55a211fdb7a328a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePreregDiagnostics (cyclomatic 15, cognitive 18): parsePreregDiagnostics has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3573eece00470dfcbdc51d8fd8ff1ef85778b6c6cc12eff4322ebd9dbbfa3eb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openShipRunsOn (cyclomatic 15, cognitive 18): openShipRunsOn has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb2ef46b31ef712df4a4855e9cabff85ff745610b66fc6e5cfe1caa0ab256fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkGateSettled (cyclomatic 15, cognitive 18): checkGateSettled has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"825fc766ff4e6106984980b0dc730e90883de4a4d0806b82f068cb5e94f60f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveVersionSource (cyclomatic 15, cognitive 18): resolveVersionSource has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/version-source.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"370c783cf331de5eec031649588c38f831ff2fdc4452da3ea03771ec5457654e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"be00d47d340979456aac04f2ca204f2f85d2b2895280edc7b0c51dcca570a128"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupRun (cyclomatic 15, cognitive 17): cleanupRun has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1b6d415793184e17990b1309e0a9f4740506fa79692a7b4f21ecf1b9a04cd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ce3bb00a2afd3f76d25663a48d27e3a0dd2aadbc32c8929f99da388108d8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateState (cyclomatic 15, cognitive 17): migrateState has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf28a535c9defc699c1248d5b65be7176afc24f4ec3ed6f4b6c60511b4076223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jpegDims (cyclomatic 15, cognitive 17): jpegDims has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/image-size.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e045a153ef37013f3f681202c3d9e9d0033faa7532f20e800238eb20683592"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function floorPermission (cyclomatic 15, cognitive 17): floorPermission has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d692362f5d1f0432d93210b0cf03d4a277fcadc3bd68b977b9ade0b559c469c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iterateOnGemini (cyclomatic 15, cognitive 16): iterateOnGemini has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/iterate.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac24eb709220c0d540b0c8ea06f9ad86af6f972df1067ca86ffff696adc7c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preflight (cyclomatic 15, cognitive 16): preflight has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499d51614c8ca155e6bab47bb24eb8fe44093905daa4fe2091c9a489898917a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathRefusal (cyclomatic 15, cognitive 16): pathRefusal has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs-only.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcdbdf7635edeb801e65eb6ebf812aef17f6ef7e0053d88ae81b6cd0a1556b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyEntries (cyclomatic 15, cognitive 16): classifyEntries has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs-only.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e251feaf96e51864ea540766ab194434a05b9922e82f1d1083a6957dc772dd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixedSleepAt (cyclomatic 15, cognitive 16): fixedSleepAt has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7266c1e9775e9b77c2b7e97ddbc9604a07942fff10f7f27329d60c086a8629ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function platformReviewAt (cyclomatic 15, cognitive 16): platformReviewAt has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-platform.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a5efc08ee969a2e2ca3aa1eb85321dd5aa2b16b2443d35f9908349e9260e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6a7526f59d2166966416caa43921f0cb78bb8099739649d367202f8c8ef5ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampPreflight (cyclomatic 15, cognitive 16): stampPreflight has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23eb1c46e3ec90161ed53c245bc6b30da0759b235f6265226de92fe3eea5b07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decide (cyclomatic 15, cognitive 16): decide has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/measure-bar.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa12d88cdaa4ac31c3f5fab277305168cb91ddd7485b7373199bd0c58d7f1d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findBudgetRegressions (cyclomatic 15, cognitive 16): findBudgetRegressions has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0cc0291e11945b55f7586bfd1727dd6259e7868c18bc26102700d6ef6e32c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSizeLedger (cyclomatic 15, cognitive 16): readSizeLedger has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/size-ledger.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde9631a1fef4427f60ed13419b0220f7a6d955e789576b887c5390e8f4528d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-shared-libs.test.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d5ee2fef2cb1cae1229e6866dabacd0ba4247022db974b011e3019855d59b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waveChain (cyclomatic 15, cognitive 15): waveChain has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7bc6beed3a8d1d29056d4a2f2776c6d844e7ca2cd4ce3b28c25b533b4b2c75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCmdline (cyclomatic 15, cognitive 15): readCmdline has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-state.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dedee97e3aa689c413d2c864f97acff9640d598d798818546500d0ec0a64465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace94d903618a26833977610869bb8b40ad03793a4ec2cfffb02638d6466d22c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/app-input.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d6d270dba00614199b12be4897fb81a5119140c51a835d0492c61845cca910"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitClauses (cyclomatic 15, cognitive 15): splitClauses has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abc64a27867755e60b7273f1a14eda8d6dea3a118fd9364f5332fb86d0cd556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCeoReviewCompletion (cyclomatic 15, cognitive 15): validateCeoReviewCompletion has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-sdk-capture.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9420bd67c71cb772a2961eb27c22b7ffef92db7d73e48030aa5bb0856fcc6354"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/native-auto-decide.test.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53613087105e451a6658982c12bbb9fa0a176a856edcdb6141c989a74debcf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-browser-deadline-evidence.test.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d621d3bd884c812f95ba58236cb8e147797d2edfa318f252278d4d13068bbecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-fix-loop-fixture.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"673aa25c09595f1506ab168293e3bce19bdc9b2d6e6561be953adc1384e57c03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ace1b14ec3a406b0a757452c8aa9f678c2049a3aea01c63efe0529c0cf72f0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeHealXProtectKill (cyclomatic 15, cognitive 14): maybeHealXProtectKill has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xprotect-heal.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"957a6476f0419085cae4dec13bbb50f3a36fc9b9c31760f191e34fed35f8da18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changeBudget (cyclomatic 15, cognitive 14): changeBudget has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-budget.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3d190f66f880f7d0a8416c4136796415cf5b0b7ed40cac3ebb2d1fd5b0a407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeChangelogsWithNotes (cyclomatic 15, cognitive 14): mergeChangelogsWithNotes has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-check.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"933534e5d3a347a3e01eae12c9038ec607bb10d6255d2b69949c04d5c009bff2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testVerdict (cyclomatic 15, cognitive 14): testVerdict has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5b10adf3737b8346fa85726becdb2ee7dcfa0a25a46fde6b4f4b59a03e8055"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchWatchdog (cyclomatic 15, cognitive 14): launchWatchdog has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bb321f868607bce31bfd25109dcd7ebd5873c8a83bf713ffa8d80e3a4b3d3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 15, cognitive 14): detect has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/greptile-early.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e98c3624b5b25f35e97cadc043c502a97181a48dedbf6820906fd4849621dca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindReceipt (cyclomatic 15, cognitive 14): bindReceipt has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"286f1c75c493955f0e17d71889bd654b1b42011c94e21e8a1dfe7c9db531e571"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCases (cyclomatic 15, cognitive 14): resolveCases has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-rerun.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5364882161eeebce85aab74169f9927269f2e057750a9ac653a9f8c2096cfc6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateSpecReviewLoop (cyclomatic 15, cognitive 14): generateSpecReviewLoop has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/spec-review.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5d63aeb152d03ba714e41ecc87ed5dd866bb52d84e4be88de6c523be51a5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-split-question-policy.test.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"54612d0dde8c79be4507108b91c262c8d40df979639aeb6f6a1db7724ce0fb63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordSession (cyclomatic 15, cognitive 14): recordSession has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/agent-sdk-runner.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f6b4f63114d6459edb634989abd8be44cdda247efd8dc7eb025d4c3b8b1d87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/overlay-measurement.test.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f4c776c15adf50fbb3ce958237571b7016751db77a01c11585db3bfc8c083b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-create-combined-permission.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd64a74c4a02f64c6914e51bd7b903c7804808a2ff79c0aec408dde83054902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-edit-cropped-permission.test.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5227d2ef066df089ad3a75b63863662fd1cf4244b0db24b5733810d98664064"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-checker-interface-evidence-replays.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6ad953b0056c6b4b46d450970ab0ba46ee0d8069e40005b0b138c94631ec8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runScan (cyclomatic 15, cognitive 14): runScan has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/spec-quality-gate-secret-sink.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c72feb005f5d730f17837204977fdd96ec4c3b1d821e63bf5efe63425cb02f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function profileOwner (cyclomatic 15, cognitive 13): profileOwner has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/chromium-profiles.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25fd2829886b7c1270889f7572c874f8f1245148ba2b5082b2fde20a8a2695b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGStackLaunchArgs (cyclomatic 15, cognitive 13): buildGStackLaunchArgs has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/stealth.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b07079b1fd84ad0f2003491a4adf407c5c1ac6348ef6df1fbb34415ee6f7a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function end (cyclomatic 15, cognitive 13): end has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shell-writes.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8d6db58e2b349db21a268d77af2457de5d76325f523fe6b0b08c0d36e49a3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function carriedAudits (cyclomatic 15, cognitive 13): carriedAudits has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-docs.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"42297d9ece44bb43e227998fc9744339078612dc4d9a263bf0a5adb7c737406d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d70db4f36ead3ce44bfbcea81b809ccfef26b207ba4d26f20724192ff864f48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProducerHelperBinding (cyclomatic 15, cognitive 13): resolveProducerHelperBinding has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"203356271bc780ab9115534f4cae4bdce467ac4d0616bd7219f820a949751f93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsCommandAllowed (cyclomatic 15, cognitive 13): docsCommandAllowed has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa659919a3b533621322b442657319856b8b56fa7ac78731a46d72ce3460de4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOverlayCaseLifecycle (cyclomatic 15, cognitive 13): runOverlayCaseLifecycle has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/overlay-lifecycle.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda69c0f93486f5f24f4960f370bec5974ba73cf324224fd632400dc263e011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgePlanFloorReview (cyclomatic 15, cognitive 13): judgePlanFloorReview has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-floor-review.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b22804e1e67ce0a891b279f4b54ccbaf9ceb52c1e2a09d70b15ab46eb39431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planCountQuestionInput (cyclomatic 15, cognitive 13): planCountQuestionInput has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16228c3a2e98df3218aec20bd8898e6a39314c6309e97d6dbdf2eef9ac60f2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseLocalPgliteFixtureAnswer (cyclomatic 15, cognitive 13): chooseLocalPgliteFixtureAnswer has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/setup-gbrain-fixture.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f92b8c3511f59e758b7f0d290d488501ee22ef3fb051941d498bc2866ba08e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gitDirectories (cyclomatic 15, cognitive 12): gitDirectories has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af4807e89f1690de8bca39c92a4b40fb42b00497a8ae53c98c2691a8e32d0f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy-mechanical.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff910fb1ced4fc5ea89324c9d7a66630870231de851d6f927630593e1f896923"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseMergedChangelogCommit (cyclomatic 15, cognitive 12): baseMergedChangelogCommit has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"91690454ba027449ed4d43ea639e92cc8e90aaf2b6f0e6740307684c81c9c393"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"badf7db218c7e56d633a9d8dd47643ca613bf1fe94eeae2a7f5a7ba0a3716970"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liveRecognizedPublication (cyclomatic 15, cognitive 11): liveRecognizedPublication has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0cfdbd360b741eca6c98cb84466c58f0e15555a405d3e491d69d17349834e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dockerProbe (cyclomatic 15, cognitive 10): dockerProbe has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"693e1dd1cc0c43e43648bb2b2ebed762fe42be6640f6307ed68b9034d16632c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesClippedNativeQuestion (cyclomatic 15, cognitive 10): matchesClippedNativeQuestion has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/auq.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc867c1fbd5b068928ea2782127bbcf232f8d03613d9bb401430d37c2c9cbd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dockerExactImagePresent (cyclomatic 15, cognitive 9): dockerExactImagePresent has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"82690d80f99a32fbd772f50a8d7b0860c2333425a9919b5d3fc1266607d58a1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFirstPendingQuestionForDisplay (cyclomatic 15, cognitive 9): readFirstPendingQuestionForDisplay has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-question.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6202e6205f533b190173d799d3414579d9b4e594e910d1fe3d3cee0f938c0fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isQuestionlessNativePlanExit (cyclomatic 15, cognitive 9): isQuestionlessNativePlanExit has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c4b5c639206950131e2b44216c48e9283b3aa170b753d520348bb78242ae9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function architecturalDxTaskNavigation (cyclomatic 15, cognitive 9): architecturalDxTaskNavigation has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"766b115e4b4caaabf7a6e97b9e194d6042096296e9cf633c8e61987aefe7835b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qmCommandViolations (cyclomatic 14, cognitive 34): qmCommandViolations has cyclomatic complexity 14 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-qm-edition.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71a3183046f57570caa608a34fdf03650d124d70e29685960a89642e8193c7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 34): (anonymous) has cyclomatic complexity 14 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/env-host-fence-conformance.test.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"669f105fee2a782d442bc925bf283562a0775c7d7350453759f9df864f78e451"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkEyebrow (cyclomatic 14, cognitive 32): checkEyebrow has cyclomatic complexity 14 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome-eyebrow.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd2927c5ce12eee14ce3a3f205a5c1465742b7892896f6324a55a0efc2c283a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sarifCheckoutRoot (cyclomatic 14, cognitive 31): sarifCheckoutRoot has cyclomatic complexity 14 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f7933406e5db3cc3fdd39a1109ea4047dd7db3e4d08ccabddf22466e578cd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedRemoveTree (cyclomatic 14, cognitive 31): boundedRemoveTree has cyclomatic complexity 14 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a17009ffce54e51eb65cdb07ce843bed8fac5aa6d11d41a65083beea707621"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkMatrix (cyclomatic 14, cognitive 29): checkMatrix has cyclomatic complexity 14 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/state-matrix.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c61ffa87b7d1dceaab425206d9a33e811bc55dd4c5e484560ce5e764dcbd83a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listBrowserSkills (cyclomatic 14, cognitive 28): listBrowserSkills has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5de3d52e040f51311e58862eff8370129c0fa2ef6f549fb1d5c82998ecffb48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settingsModules (cyclomatic 14, cognitive 27): settingsModules has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/django.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b66062b08d2c422ba81dcad1f2dc0b00012ee50e9d37554de13a93facd0bd92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkEmailBandClose (cyclomatic 14, cognitive 26): checkEmailBandClose has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5c2a41bf8145c984e4ca24f80c4d63aa0594f6c2353f9cdcbd04f70677c55d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanTiming (cyclomatic 14, cognitive 26): scanTiming has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecb043772a2ccf13a98b142026afa0a81dcb1fba4827965485c06822288598d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeToolPairs (cyclomatic 14, cognitive 26): nativeToolPairs has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-review-start-evidence.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e229c1f372e600aa70967f9476ae994d151f3de10044642025c40104e7ff34b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdListOrphans (cyclomatic 14, cognitive 24): cmdListOrphans has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97a59117657d5bb48fcea76fa4692fea04193f0838e4188b69b162f7b89d078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJsonc (cyclomatic 14, cognitive 23): stripJsonc has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6d2a34e7b544fcf79ceed4a729fa4366c57e505abecf9ab30e3d497ce5e8ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportLines (cyclomatic 14, cognitive 23): reportLines has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5f6826805a9101cff77b4d609a8037683031003cbf788560b263de5a2a86ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributeCommands (cyclomatic 14, cognitive 23): attributeCommands has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/exercised-map.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"498a843f30a6f4911c854972f2e384b099caf121c7dfd042c59c1daecca1ed78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sideStripes (cyclomatic 14, cognitive 22): sideStripes has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9afa46b2694dec2f19d64cd8e2c0d4f0ceddaf96d494e4024710bc7807be0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileJobs (cyclomatic 14, cognitive 22): reconcileJobs has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2152031ea51750eb49f4914ce857df4b5877db290235ffa07cc7bf90c86601"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandWords (cyclomatic 14, cognitive 22): commandWords has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d1c053f2d351ea32f1051b9dc306e764416a9ec03f3040e7a11a91b0b5cfe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countingObserve (cyclomatic 14, cognitive 22): countingObserve has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/counting.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3c49aebc6bdf631b754fc6a3688db71921f26d5665a7abc504d78bff930753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function navigateToModeAskUserQuestion (cyclomatic 14, cognitive 22): navigateToModeAskUserQuestion has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-ceo-mode-routing.test.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"da919ca650787c8722442284d19c29c0d87d45baaa033058688d8b2c26c3f9e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findBalancedClose (cyclomatic 14, cognitive 21): findBalancedClose has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a276a5a7c4d07abc8508c2e20df801bd933de56687198bf1077eeed487f21d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withLock (cyclomatic 14, cognitive 21): withLock has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37bd67546dff56459c6667327b24f18b0d759df4f50a17ad47eaa0ba401ba22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkFooterShape (cyclomatic 14, cognitive 21): checkFooterShape has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82f840bcded36ece3a9da948fc70246d4d46b4ea78fd3cca2e24f2a393f9e85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function touchedFiles (cyclomatic 14, cognitive 21): touchedFiles has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/context.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1338d3cbcce94940c62034ed1f96ee6bbd95b24f32d0aeb12472f6da90bc0ba9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerAutoplanPhaseInstructionAliases (cyclomatic 14, cognitive 21): registerAutoplanPhaseInstructionAliases has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-method-read-audit.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"286a18dab652ca8a014ce4de987ac453ba764d425549727c5fd3dff4132ea33d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readinessVerdictProblems (cyclomatic 14, cognitive 21): readinessVerdictProblems has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/sync-gbrain-readiness-verdict.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b63672e1126eadcd98c5d994318476a5144e3883e8152be4e914706760fa3c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-read-permission.test.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb18dc5a7b9ade6a1b08b35a1e3bfe289f152aee48948dfa4aa14f054ac5f4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runHeadedSupervisor (cyclomatic 14, cognitive 20): runHeadedSupervisor has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"397657b6f19d1cf737e9426058760dc83ffb216d899479484741ad3b8eb734ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProxy (cyclomatic 14, cognitive 20): resolveProxy has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/proxy-config.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdae7dca4cc35b6284ce7461c9ad74685b80d938a3c43782566e913b64726a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePage (cyclomatic 14, cognitive 20): parsePage has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a418b8fcb7c6af36c794a42e2c2210306dec25d1f3fdf452553bfedc7a68a2c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signatureField (cyclomatic 14, cognitive 20): signatureField has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e540ca761129b2469fae8718c7c64cf8fbd47648da4d8d8f516d4ca8a0d9ca78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkUnlabeledDecoration (cyclomatic 14, cognitive 20): checkUnlabeledDecoration has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/assets.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edbb7d0c5297edf572b9e9373ca27f6d66c245a4e46fa68eb590c1dbd95f32a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupCpuMs (cyclomatic 14, cognitive 20): groupCpuMs has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ee2fb43b259d305a218aa5a358fa7c29ca17ab21e35122ce2e849dcbed54f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changedFiles (cyclomatic 14, cognitive 20): changedFiles has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dab081ad6c513d94bc1bd97782bb40e620461517be01b789396853c85dc880"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seededDiagram (cyclomatic 14, cognitive 20): seededDiagram has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"77611f06bee1701c904fa040cd0b93ebb9b507e26706f4536349a6e89771db63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restrictDirectoryPermissions (cyclomatic 14, cognitive 19): restrictDirectoryPermissions has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/file-permissions.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76fd697cbaa2ad57854edead4d33253d8f73724215d9b46d2b52a47f668b6de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onData (cyclomatic 14, cognitive 19): onData has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3631a0c28cc5f3a65354c59e41eb219fd880d2da7658820a0c6235469b1dda0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBisectPrefix (cyclomatic 14, cognitive 19): runBisectPrefix has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4edb3a4c1adbdcf6401b53bf52246855c4a180a6d102adb46987d27290154f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3098beaa8f96cc9734c027cb488080394c9549a017f9f1e6d71a70d0304b7d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function program (cyclomatic 14, cognitive 19): program has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shell-writes.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2084b21b483827d5b8e22d97a3492f738bf00ae3928153cbbdcb5b778268f70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/bun-entry-isolation.test.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8663187e3ac594d639a881f4e83da255820530937680258ac2061a84c4122c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function correctLiteralTargets (cyclomatic 14, cognitive 19): correctLiteralTargets has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/overlay-workspace.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d209ce4c2bc0d5ab3383bd779f88d4472089113fd1c20abdac4f7cd45636d68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inventory (cyclomatic 14, cognitive 19): inventory has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-hook-scope.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa298ae6dcad40be6b2786bb2ba41d8ac0ac817567f2f4624aad877711101473"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createSetupGbrainSandbox (cyclomatic 14, cognitive 19): createSetupGbrainSandbox has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/setup-gbrain-sandbox.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9986be611729afeee4decdeae6af659a41fcfcb94ac86fc54752a80f5c902c26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPlantedBugEval (cyclomatic 14, cognitive 19): runPlantedBugEval has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-qa-bugs.test.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"438d8b9dde36bbb4bb7362a116901381290099121d168d406a097f88fac1ce7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterArgs (cyclomatic 14, cognitive 18): filterArgs has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/activity.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c83e8a7fc986c71333f2d5c1f58593162874c170838d28ab868b86852d9565"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/gate-reuse.test.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5964db587b99927d7e6e817f9f1ad380570b19971bba9f4b5ac14fb796244f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFragment (cyclomatic 14, cognitive 18): parseFragment has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-fragments.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a57229731f85b10b052070e65f1bfeadde2029e4336f177972d7f83222468cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dependencySpecs (cyclomatic 14, cognitive 18): dependencySpecs has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63e51ce6dce3188896c4899bc9b253d4674834e71260148cf2ddb13bacc368"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCallRow (cyclomatic 14, cognitive 18): parseCallRow has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8197555a34f4f1ab2f3e989e3ef6a36c3b8321b92a490fc21822e5b39d4aa18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdCreate (cyclomatic 14, cognitive 18): cmdCreate has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"591a4a970d8674cf0c3c5005489691aa56c0291c77ab5dcabe4ac26716ff8df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function freshDetectEngineTier (cyclomatic 14, cognitive 18): freshDetectEngineTier has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595c243e69280619795b93e64cb5fe8956e4a5b7986fbb3894c79d2b3ed6112"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withBlock (cyclomatic 14, cognitive 18): withBlock has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b1b34b75aa3d81b1ec5b0b5d3a82ed1c022b669d8a46ef72633fa7a5bf1437"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exceptionProblem (cyclomatic 14, cognitive 18): exceptionProblem has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"23593a19ad6b6917cae845386a2ff790c3b76c05d43cb20184bcc827566b10a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidates (cyclomatic 14, cognitive 18): candidates has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"64615836842c86fe37fa5d4e64abbbcbfcb3ec3c7ef21b87fdd39d176a521c05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pdfDestinationPages (cyclomatic 14, cognitive 18): pdfDestinationPages has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/toc-pages.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f66645c551e0d5d8905e62e451441a13168970ac5ecbd441c0e17184a2b8e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJUnitCases (cyclomatic 14, cognitive 18): parseJUnitCases has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb279aa209a2032c07b90535f513c1263f2c104844c89709faad37236088d8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagramWordLegend (cyclomatic 14, cognitive 18): diagramWordLegend has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee8ed97b974b319026a4c3ea4d6b747a0bf97ca8d7f3c9ef0ec524322fbe4d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeBashPayload (cyclomatic 14, cognitive 18): nativeBashPayload has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"336b7b010bedcd751ffd8af9b9c1300b03957d74ac41a48dfa54b2901f3133f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-count-timeout.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd448e196902fb5f032a143b9f81d8a2baaf2ab2d4dab8f29c82cebb776cb70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyAddress (cyclomatic 14, cognitive 17): classifyAddress has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/url-validation.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3e91213db638dde34e56406655b5a6b2d7d204183d0b5cb42c451c53211022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopProcess (cyclomatic 14, cognitive 17): stopProcess has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/pair-agent-tunnel-eval.test.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e89c9fbe1ba0a6daa7c00decd56a0fed66322af9d493b15312d7b9091cb146"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/tunnel-revoke-cli.test.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f748fe9335eb61ce92be7667c34388b33068f6033e999032adbff628fd58b2e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseRedAdmission (cyclomatic 14, cognitive 17): baseRedAdmission has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef381ef8cd91b445a5a75e53343507f1d99b476f18416ecca659265d1a323838"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeDeferred (cyclomatic 14, cognitive 17): closeDeferred has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6c137ad53200a54bf9d9d256640861a2c63264576335717c91091c643f41e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a91561b00e7d0314cde057662ed9fe96dc6d13a8a381ad0ce5255f9b2352a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamedUsageCostUsd (cyclomatic 14, cognitive 17): streamedUsageCostUsd has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pricing.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cee659e303bb7f3f5c60b0d0894dbfe94dea57ad1c05b800a4ff483d0fede0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d682a4b3f2d83f328ef65b2ba471a88cd20b9ca1aaf0d286e4ecf77e278b409e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishedViaPulls (cyclomatic 14, cognitive 17): publishedViaPulls has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f547a3fcc0a8e3694976dcee97ad140858c706ac4631cb1928bfd2f4687451c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertProducerArtifactPath (cyclomatic 14, cognitive 17): assertProducerArtifactPath has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval-producer.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dd347e4b6477dc54ffe252d06f907d29939b8856ee15b99b6ef5dd03f552ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeExercisedMap (cyclomatic 14, cognitive 17): mergeExercisedMap has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/exercised-map.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce81fe76e1ba64979c3b59c6c012fd3aa74f3e62bd1592caf70e13ca4322f78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCiShard (cyclomatic 14, cognitive 17): runCiShard has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-jobs.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f902d856c4f38c32a588680708bce21964668c898eaf6ff05454abfcf9a93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/sections.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"181f0bb0b78e4ff82488deab7a58d0d04b9dfbe7ffa9f13c3a310dacc30efe21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shadowSelection (cyclomatic 14, cognitive 17): shadowSelection has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-pr-profile.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285d35ae73c26dbc8de4be40f41280072c3942f6db34c5189738e8f73c93105"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 14, cognitive 17): fetch has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-guard-pty.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b3ed25cbfa39d9e7644b9d212d3f5ad7169573864b1943821a41d878bcd734"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-functional-evidence.test.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e3288226b140570db866548c554be0eaaa2a3a5926d927a0e715f6c45b0e70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyShip (cyclomatic 14, cognitive 16): legacyShip has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/review-dispatch-compare.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"236c75af180df25160239dbc016bd2f4c04ce181a269009cb47cf6bf2c54ee51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onClick (cyclomatic 14, cognitive 16): onClick has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dab2fe424d9afae344edb7c7df8a62ae231f9025f2eaa6cc733981757444995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRule (cyclomatic 14, cognitive 16): renderRule has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cb6b2b35a0e5e89b972316b2b0826e3250dbda18191996f762624393d3cc0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settleEvidence (cyclomatic 14, cognitive 16): settleEvidence has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-revise.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccd4c6a16ab774081f5058656e993e149e65c96dae90a5d67071f4fcb21e76e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reclaimSlot (cyclomatic 14, cognitive 16): reclaimSlot has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62c6237fb520015f0ff5b2fa970c2982e6802649b7a6aa0e9531d13c043566c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispose (cyclomatic 14, cognitive 16): dispose has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ce2f1306f7af1e580221cb83c8819556efeaea8c9cc01fa4e40642df8ee098"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5979b9ecaaa3d88ff291b5d1a7c6b66d02998e6ee882bd2ba9e624aefdcdc4fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settleIn (cyclomatic 14, cognitive 16): settleIn has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5055e10a922ffdeba5a97e9d8935b7b1b009836d5e1a0b52e4d215bee521f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-windows-launcher.test.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ab36d84d7d0cf2df2e0b07fda27591af262822f99feca4c5c3856fd7f4bdeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaCallerInstructions (cyclomatic 14, cognitive 16): qaCallerInstructions has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db79c38baa17c6ecff061f8fbff16e23cbd6faff2333ebc0db2ac3944e73169"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-webfetch-permission.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"797f94a2991086027ef0ae6baafb845b29f8ae65a0c020f4a4d264447d1a9d24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 15): main has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-diff-calibrate.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ef18a4c5dea921bb4999ce06c1e5a106287c80beb6427166b42a10834dd5dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function killByPidWithIdentity (cyclomatic 14, cognitive 15): killByPidWithIdentity has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fafae98f77dacfd6fd12c61bec88708bc7144c117cdcb278852c57062ed9a42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readImage (cyclomatic 14, cognitive 15): readImage has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/provider.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"de250b248cf2b461eadbb673c95979f6b55a1d12e66537d83bdc10aeb3fd7b47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asideRender (cyclomatic 14, cognitive 15): asideRender has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e7e869af9f87cb97443d6c0531becdf59ca118722785859f17f1ddd40aa9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function release (cyclomatic 14, cognitive 15): release has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3129069d47c58f3503953073155dd77550e0604093d745a84fd8cb9c5a319ede"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeSettingsEnv (cyclomatic 14, cognitive 15): claudeSettingsEnv has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4736124cceffcc517db23c727d15d3e6df9ad9b40724a729000c49d164199ac6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function landPlan (cyclomatic 14, cognitive 15): landPlan has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfbb8134e7b625ceeecd160101996f72b756ab4e0004d9ead8d92861600db3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 15): main has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/typecheck-test.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c9c148ced3d8fa52ab3f5c86f61e1ad67de418382bd09bc17c156f2c21ec88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-stack-cold-integration.test.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"63438a176227bec9e6c3150c8f726973750679124eb2a86cb06311772c2bd4ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retainQaCallerEvidence (cyclomatic 14, cognitive 15): retainQaCallerEvidence has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fefe5042253da8a6b1f689878746d1ab2d576dec79f42e32dbdb559c558cebd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseMode (cyclomatic 14, cognitive 14): chooseMode has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2f338d2568b22f6a2957ad13a6566f50d8251cd0195c45b36db8733263103f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/release-cut.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7e7b81e6538315f7c593de03140bdcafd9d7d3c229557fcb2253dc0614c26c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateConfirm (cyclomatic 14, cognitive 14): annotateConfirm has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-confirm.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b53c0febdce8a06b5c883fdb03828c6894a07d423868678baaec748217e4f6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertion (cyclomatic 14, cognitive 14): assertion has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"551f53f9bcf88205a20ee1f039c232d82e8dc1fec6e10dd8d8ea525022d1d55f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execCapture (cyclomatic 14, cognitive 14): execCapture has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2649249151c31793d664960d63767768a9c1cbd8f770f7c4efc3a8382166eb04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dom-dump.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dc9d11774baf517a79382450a2b420f7f164a12cbad92c64134e02b2ed0a4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describe (cyclomatic 14, cognitive 14): describe has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"53463576a733be796bda3023fc18d06defa20953a73e1339140982419fa34bbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewErrors (cyclomatic 14, cognitive 14): reviewErrors has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy-review.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49c5d714d1c059bc0c21ad43f0afb74471f9e000156710093f80e3fabc05315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFreeCli (cyclomatic 14, cognitive 14): runFreeCli has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"788210525b01af7da31054a4bc3a6ef1a1a41dd3a078c5dad4e05ed4addc0925"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function explainFreeVerdict (cyclomatic 14, cognitive 14): explainFreeVerdict has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61061e4b41c46c40c32b1e40ae6d78bd7b461f3b69ff55e29f19dcce0a9287a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-method-read-audit.test.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"756184e73313f3e1caef9830210862db0e81308be1231d70ecadfa76ff63bbcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-plan-mode-fixture.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"770f5f57dcec6c0b92d8a84548f99de9a19f14161aba6af847a1fed228ce0777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 14, cognitive 14): exercise has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/design-detector-source-fixture.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4222140076921abfbacdc21c8b4a57b7a1ca26db998cbb113cfa4807144bfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 14, cognitive 14): exercise has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-floor-permission.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dac00d1bbb66d06a70a65228ca769cc21e3e3c120666fbefd87befd0f72814"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bisectGate (cyclomatic 14, cognitive 13): bisectGate has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a446abc620871c5c5e6fba0340a0e3a8751fc736537cd78e6fab976c419afb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyRegression (cyclomatic 14, cognitive 13): verifyRegression has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a3038102f4de5b707a403e62b63dbf20c7cbbfacf889c4ff5e9670db0d3a6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/test/proxy-transport.test.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c445696fc04ba2b75e15c374b0c8aeea10967de6db36070c5b7102482c0e8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseThread (cyclomatic 14, cognitive 13): parseThread has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e8fdce8751434c3fa07a6597a36b171d69a4c6975e205402221ed70592c7e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPr (cyclomatic 14, cognitive 13): readPr has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/archive-check.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d43658ecf1d58ba5b3d0cc097241bf278b50b55fb67b0e62008fba332103fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownerWords (cyclomatic 14, cognitive 13): ownerWords has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5e95128164e9d5076ab65950bb32d7a29c61c72003c8bce75b8a19873d0367"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"155800f13599eb1b79297499055dd5f17f738a0dc9b52368e31cb2bb7f5b8002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTunnel (cyclomatic 14, cognitive 13): openTunnel has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a647ce1f92409a4ce930f8c4afee2d84d3743e5349c5c40062e936047cf843"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"924ebf74a595ef05447e687b26f1daf6b7199d1940238f9c4b1e1f0c3c57cb8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function control (cyclomatic 14, cognitive 13): control has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37f6c810505bc0917d9d0ea7ef5a6fe2780ca9242e098ddbf86c35f84d013a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 14, cognitive 13): open has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/greptile-early.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b77662c5372e5a6abbaec1e38f381a794a4ec0ac66d13e1647b47d13b52ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wtreeFingerprint (cyclomatic 14, cognitive 13): wtreeFingerprint has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/script-invocation.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a815297c4d4ff29367477616c773bd46eefff05dd503c13bf1c49ffbe6df95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrationErrors (cyclomatic 14, cognitive 13): migrationErrors has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c883e9aaccea5bf701f0148f3c7a486d8f668416891f39c082065f337ce010"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindShippedReceipt (cyclomatic 14, cognitive 13): bindShippedReceipt has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb36e9c52ed3aa6a1d049fe45fd88cee15ba34f159405dbcd0b544e22e2b8d57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCarryPath (cyclomatic 14, cognitive 13): classifyCarryPath has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e198e150c1250cb870a6de7ac4fb44a453dd72fa6295b0bddb47d581eb45b70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchBlockers (cyclomatic 14, cognitive 13): dispatchBlockers has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"511ab11f2de1e882e3dbf10c78fa71759e546f7135929e5e7fa2813723dab9ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shardProblem (cyclomatic 14, cognitive 13): shardProblem has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-rerun.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1218a720a2ec19958374eef2170321d5489ed9607184763cae49b4f1baf88d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outsideVoiceInvocation (cyclomatic 14, cognitive 13): outsideVoiceInvocation has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/outside-voice.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc6e42405b49163c84a0da9753c25963ff6bccae9bac4a50f685cc5fb29fbc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-barless-submit.test.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea01aedcae597f1a4b409fa5e3e375c1254713dc58cf3f6a75bf130ec504a01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAutoplanArtifactRecorder (cyclomatic 14, cognitive 13): createAutoplanArtifactRecorder has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-recorder.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd0add60e87cf8074e2ff878aba9504b7abd70033e2a1e779cf651103e1d086"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hermeticArtifactReadArgs (cyclomatic 14, cognitive 13): hermeticArtifactReadArgs has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/hermetic-env.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"22474a3b4f8403bf7342e41b5c705aa488206e0a1f7a408a6d0b5a7cd9cfd4aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-review-decisions.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c6348844bbe2d9d92b78ea3b8ea7711592fe40922b43f75ae4155f99dec5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resultFromClaudeStream (cyclomatic 14, cognitive 13): resultFromClaudeStream has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude-stream.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"557feb4fea8750c1d9e3591770d2d01a2d6d0c3a51f169ce660ae617592b7cde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function available (cyclomatic 14, cognitive 13): available has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b55fa990f25dc6f333accdd2c6cfe9d9c659d30fd9b32c9e15db64f8d0d8f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPlanSkillObservation (cyclomatic 14, cognitive 13): runPlanSkillObservation has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/observation.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d980ce6c35e4b061320df9ea9b7f6c1fff27b67f6e604397cef5e30182a302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchClaudePty (cyclomatic 14, cognitive 13): launchClaudePty has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-floor-permission.test.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d59101cdbf54446a3fd0aa555516db37712e06a92e2195fc1f27ea718e36fc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-browser-deadline-evidence.test.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"741a7fb80634d0282bd8aee40e91b5ba4ff172a3ac7d51d79bb1e5633c5adba9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-production-deps.test.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"590d0a4532290bb40f377a662abe83f0b276337067c7381dcc064c47525289a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRouteAuth (cyclomatic 14, cognitive 12): checkRouteAuth has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/table.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3696a6111ddedce5642a952cb8a0273017dee012b965f32f87052d08f491f0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shows (cyclomatic 14, cognitive 12): shows has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b315c0fcc9225eeb3f886dc10b35b180714a88baab74931f8ba3d5fbdf36390e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pilotReport (cyclomatic 14, cognitive 12): pilotReport has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e72563a27e3c1401ec0dd67f82886c8f390daf3f9e62ea2286d1b1eac149a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function owned (cyclomatic 14, cognitive 12): owned has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d1d251a7b367c5966413ff9c5f9968d8a8b788f69cb4c4a31b81cc08527b2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addEntry (cyclomatic 14, cognitive 12): addEntry has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9034983ea50d24f65b0f2cddf433f62d9a21f9f7e34ef567e2ed078976ed2365"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projector (cyclomatic 14, cognitive 12): projector has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae0c7df165f5d86aa3230de13ca51398d4b30d634cb8034c6ce4f28d3ea1310"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-auto-decide-preserved.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbf913d3bed76d3f01f95c2f90737e710c50a8fc5486c5c069dbd337c3c8172"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFiles (cyclomatic 14, cognitive 11): classifyFiles has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8dd2a167bf4eec55214dd130bec0745bc3e40d19ad543db86a2add58102ed8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsWriteFailures (cyclomatic 14, cognitive 11): docsWriteFailures has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d83fcd4ab5be63201c5a0925d49bdd581b9179b36e6311b5e24f26bd7b9951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 11): (anonymous) has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eng-seeded-coverage.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"828602a0371398af4c1cdfe707ef702bee39cda61e7d57b022cc1a4d17120c82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callerEvidenceCommand (cyclomatic 14, cognitive 11): callerEvidenceCommand has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-callers-fixture.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2dd86be5e3031fbc38faeec6be62fa02952de7f67620f828dc5bac44306510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/network-capture.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fd2f0e4014c909e6d52337a0ed3f7592028bc11f3724346718110533e3a360"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeAside (cyclomatic 14, cognitive 10): probeAside has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d44bfc132e788a3a61e41204055ca9b0c2c088a472fc4d180e2ff462f917d07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherCheckoutFacts (cyclomatic 14, cognitive 10): gatherCheckoutFacts has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d644175b6ff28d45291eb2df3102fdb5e28c1f5a28853730a74272d347f77721"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPlanSkillFloorCheck (cyclomatic 14, cognitive 10): runPlanSkillFloorCheck has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/runners/floor.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f67829d69221abf8ac0f380ba6eb0c1cecc8773d13937c7cd53628242f5a87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickAUQ (cyclomatic 14, cognitive 10): pickAUQ has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-design-with-ui.test.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e9c055b3de46acb06ebe17c5159dac343580634d42f69b7ec96fadc691bd3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 9): (anonymous) has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe02668e405698cd010ec6a325eb10b80a42d44401df7fc4f237b29855de02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harnessRepin (cyclomatic 14, cognitive 9): harnessRepin has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c528e453dd1e6e7616269c93c61c843c978ac638f43a91ba02779d9e485d306d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 9): (anonymous) has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/test/e2e/diagram-gate.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c7ea7060657018e0c92e3b092a19c984dd6992107ff1182d8249041dd6b9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installedSnapshot (cyclomatic 14, cognitive 9): installedSnapshot has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-fault-actor.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee47310913ac93905cb49f6b4bf714fba32105a60aab6e95176eb1fdae18400b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deterministicPlanFloorFinding (cyclomatic 14, cognitive 9): deterministicPlanFloorFinding has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-floor-review.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b7c5f548e90c2a646d58d1e8b78bd1749afe4ace4bdb07f6695c9bc5a2eb7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 36): (anonymous) has cyclomatic complexity 13 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gen-skill-docs.test.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd005c55161c6db4f2e72db81e56c23b7916a33ce0164bbb763c70205b05bac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clockVariables (cyclomatic 13, cognitive 30): clockVariables has cyclomatic complexity 13 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8ee5afb1a8bae67e5914b87dba5fe14ca54cf2280d3d9fded263ef33a0cef5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOutputPath (cyclomatic 13, cognitive 27): validateOutputPath has cyclomatic complexity 13 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/path-security.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6836b27c2a2caa6d343870fd7fec353eb07a7065e36711c0b6cc99fc4a4d21e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function logProblem (cyclomatic 13, cognitive 27): logProblem has cyclomatic complexity 13 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"370ffc11d0acd2aa42ff0a9ebcb0ad2a204f5f4c4214ff138df883fa7aca17b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forwardClosure (cyclomatic 13, cognitive 27): forwardClosure has cyclomatic complexity 13 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-impact/key.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2509449281d52c3f5c96f3794c4c035a172393cf7a947f6950f8f14b5b0bec4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 25): (anonymous) has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c75c7e75f5479af6539bd8fc936e9883a7a3f310d9324fb0025766ab9d5e25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePostimages (cyclomatic 13, cognitive 25): parsePostimages has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/secrets.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3e94dfd73b5dfe58e5e30a5a9d91890f412b36d0dec42ecba48d8f3dea9c8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 25): (anonymous) has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cad7524069124ed9a836a656d17331f3d91f113399aa1fbb390f6008be3e17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leaseRecords (cyclomatic 13, cognitive 25): leaseRecords has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-windows-launcher.test.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9cbc720079bcb6861bdf6b2821a25fb5f943f248de9f457e81ecbd9a7007b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOutArgs (cyclomatic 13, cognitive 24): parseOutArgs has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ff693fb1f2bf46fc6d8336a06166f18596a376fd819f5392705cddec3be86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spansOf (cyclomatic 13, cognitive 24): spansOf has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a38df155b88438b6576ae2e09893af7499b4be37a57e7973b4c9fd71c1e255"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spanEnd (cyclomatic 13, cognitive 24): spanEnd has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/module-size.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a704e4510fbb7ca889aedc2a5f09ccf6acfbc082a27c0dfb55d40bb055b6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderAllHosts (cyclomatic 13, cognitive 24): renderAllHosts has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-md-size-guard.test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d0c60b16ac5bcdc094f5bc764d70a33739a6cc1874308477b8e8141b4b8002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function awaitXvfbReady (cyclomatic 13, cognitive 23): awaitXvfbReady has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7355e2bb7400b3a9dc16e98693fe89e4c35e15034971d1043f0cbc13d6501726"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkOutput (cyclomatic 13, cognitive 23): checkOutput has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ceo-review-gate.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df92368db8f58450abc5a9ba8cb33645aebece1b9f6cb629229717d6083f0f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveReleaseConflicts (cyclomatic 13, cognitive 23): resolveReleaseConflicts has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4317183bc7b9fb402212ed89e053c08a923d5d11dc2877f4f1e74ea79850c000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 23): (anonymous) has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/e2e-tier-alignment.test.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"efce4c15802065dacb2f09063f19e867fe0f47dc98dc7f7d636410af9492d6ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkCompleteness (cyclomatic 13, cognitive 22): checkCompleteness has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/carve-guard-checks.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffe1d7d1c9eeb6804d20726025d16b475b0d81f302d40793edebc8fe3c592e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check37 (cyclomatic 13, cognitive 21): check37 has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"804b6d05f59fc0d7bf5a573592c6a2ff3b8a96eaae3b31a0f34e546f207b0434"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function notEli5Only (cyclomatic 13, cognitive 21): notEli5Only has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e8e9f3a52d74b08bca83d0f06eb06175a09de2e04024728fadb4ea1e1b16d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flakyRuns (cyclomatic 13, cognitive 21): flakyRuns has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8209d978c9738183df458de80ff988ae6808b9753aa0dedc6097396b9ebaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pythonCode (cyclomatic 13, cognitive 21): pythonCode has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78ac2afcc549a4c6482e8bab89228ccc6e22c5bc63ef3ce763807755cf118e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectPins (cyclomatic 13, cognitive 21): collectPins has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1fb417a324fc3f2ac1b820b9e6a6d7dfe0d69e6dc3c6c950f9436a1f3263b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scorePrompt (cyclomatic 13, cognitive 21): scorePrompt has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3893970dd9deca139361c8f4aa5ae55a0d4a67c73b8224bc4cdd0846142557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skills (cyclomatic 13, cognitive 21): skills has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-question-hook-scope.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f51ab5d5d0d4438e4a45520b92d47bf845992dbb823bb36842125add3c1aa76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-count-timeout.test.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a8d1dc3eb048266e0e4de1bcca3b03d4c34e113d11e9df455f8053833d662"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSnapshotText (cyclomatic 13, cognitive 20): formatSnapshotText has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/memory-command.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4327c47a722dbf125ef30324c6ddc7762b69d05140a4ef4826c953b05bff176a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testUpstream (cyclomatic 13, cognitive 20): testUpstream has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b85bbcf7542e77cb39d616a551048875754f0ae6e75ff30e346fc28ad0a52f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryConnect (cyclomatic 13, cognitive 20): tryConnect has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc7b88188040fdf290f86575940c52c6b642c8d63d55853c7222f65b94242eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function familyStop (cyclomatic 13, cognitive 20): familyStop has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/capy-review-pass.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e6039aff28cffd08d2562d4806ff75ec529e1b209b60ff6b7c65b32b520ed0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check55 (cyclomatic 13, cognitive 20): check55 has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8ee7ef9c10646737888c71356d0fa5323581ec211078f585615f5c32318404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectRelaxation (cyclomatic 13, cognitive 20): detectRelaxation has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/tags.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e96f1822140a9e4b557d02281765b0b0b48ed8b22ea5aabe3ca6fdc4c048bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeReceiptDirs (cyclomatic 13, cognitive 20): mergeReceiptDirs has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b124e7ef38c739440cc38d264f19fb371f6145e7a3a7070faaad85d3037113a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function weeklySpent (cyclomatic 13, cognitive 20): weeklySpent has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c08cb77b6826ed3e1fb5e0db52f992d10139082d778ad259c185a312f32293"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTriggers (cyclomatic 13, cognitive 20): parseTriggers has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/workflow-concurrency.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67176deb5707a92d2316d7560d55e9f4244b5b7c078bd756d52445ca2f3fb45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistImage (cyclomatic 13, cognitive 19): persistImage has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/persist.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4454251342b7bd394a571e2d687fca83bc2db154fbb20e0fe9473cdbb37d1e31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 19): walk has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14cf28437645da78eed023cc80f6e80c574f58daef59168bf56e5b1b2ab9d48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildContext (cyclomatic 13, cognitive 19): buildContext has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/static.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a82d7e4429b21b092fea8aef1633ac64e543f2f1b0f69be760e419a9e4d670e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDesignMd (cyclomatic 13, cognitive 19): renderDesignMd has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"006b9e4a0a1a1109c68a97fd5514ee8e12e397d40e19491dafa9f1c26e565d09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 13, cognitive 19): run has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/strays.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d66efb73c711ee641af5157553ead30994eb2aa0911d551cf6cf5b2ac1f5c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dartDirectiveUris (cyclomatic 13, cognitive 19): dartDirectiveUris has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"918aeb829fc94d2bf349ced75ee9e76761c6440930e8a906616f225c7676a2d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outline (cyclomatic 13, cognitive 19): outline has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/workflows.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ae856b7a1c07aa2071c13eaa78f2a6c07dc032aed1c72a8f14def417e26303"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseProblems (cyclomatic 13, cognitive 19): baseProblems has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6828c80548220a5cf1345c9f85007dcdf8e4a9f21367b5bc380ac928abc3ac33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stagingRunId (cyclomatic 13, cognitive 19): stagingRunId has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-staging-run.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87fc81810dcd5e775ddb0b87f5ae51f8537fbaa87319dbb1054a31c97bfba9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-trial-series.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc9496b7f2ef2db9af5868ff69fb6b1542a0c427196e1f15d794ae5a0b37b78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/eng-first-review.test.ts"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c90a397b08bf2bf125541545ad1efc0c30a8cb1476442a1e94022a75fad2ee3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gstack-memory-ingest.test.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebed9e8890b3b40542a24d6048051d76d95dd19c170e6b075de3d4ab331944c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seedSource (cyclomatic 13, cognitive 19): seedSource has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/install-fixture.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f043ac405f01d2f4ea0f76cdc91daaad5794ac14ad258a637c3490c927ef472"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffTouchfileMapsCore (cyclomatic 13, cognitive 19): diffTouchfileMapsCore has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/test-selection.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6b4f36d4d2403e8265b4748aabb2eedc1f3290f5ea1cfc77487d81f466e787"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function command (cyclomatic 13, cognitive 18): command has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browse-client.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d37b767e11359ef958d6d67d0d8d8fba1c36635393f8d1e83de67ff5b2ac979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function command (cyclomatic 13, cognitive 18): command has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-skills/hackernews-frontpage/_lib/browse-client.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"294bf85b60477237c78d7eab9d7ecdb9840b831e95d130750135f5fcc10130c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedLines (cyclomatic 13, cognitive 18): addedLines has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/banned-terms.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb1e1d4a18a5cc33c06d10ccfee07d28ab0e2f525d51031ab2b303e1730cec4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeWindowsReviewJob (cyclomatic 13, cognitive 18): initializeWindowsReviewJob has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-windows-job.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ec3fdf35bf6fe07c3a3fdb49bab68eeac76ea6e1ff04e25a33d4c8f0a38c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-owned-journal.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b550a055e14008e375870e773a43fe4fdd15fd69e96a6416f14e86110c03efa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkHairlineUnderShadow (cyclomatic 13, cognitive 18): checkHairlineUnderShadow has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcff87e2cc201d58e60cd30cb7d13f948fb61b09314c3906f38f547995e1583"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 13, cognitive 18): run has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/literals.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd0c07e94b67f58b3b1a1f97c278f60604a54748755fb96285ba47154e0a4ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laneFileSet (cyclomatic 13, cognitive 18): laneFileSet has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5da762f9594a2ecb6dcac7ae228c49b073b9077d31487984b980609edadbb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cargoModel (cyclomatic 13, cognitive 18): cargoModel has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cea7e43698528ced5e0c0d9bef4380aeb6e15b3b773bf19b4169eec1609f730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryFailedFreeFiles (cyclomatic 13, cognitive 18): retryFailedFreeFiles has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d80731e0d225315c3ded28ebd4fb7515bb4dc939f1f3ff83f9993ed620f561d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPreviousRun (cyclomatic 13, cognitive 18): findPreviousRun has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4950ec4d1bde4aa49056298e5e2acf9cd09cd1d7a84531db620e37abde78f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/generated-bash-lint.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aac2df8a2b82980b73fe5d4686f1f9c74f13fef48b6b6a25406f78280602f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRejection (cyclomatic 13, cognitive 18): findRejection has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/read-only-commands.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c36d2c4ec306f538ea924d83341bddb0a6f904ca877dacca94aa46a4ebf8c1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/native-auto-decide.test.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eda6727b4509e1de5465fc4adbecd71aae2e92582d59a7311090efb700f459f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-codex-scope-namespaces.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5012bcae11354472b0908b82aff1271586ab9461c6d1be157c6d653671e60b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stackTests (cyclomatic 13, cognitive 17): stackTests has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-stack-tests.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e1cf2647a586c99dac40821feef67718b475c046ff0a650ff4c6b77507c323"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveImagePaths (cyclomatic 13, cognitive 17): resolveImagePaths has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/image-args.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"898913a58beaedd0bab3ec9f10ebf7191843fafb8fd430eee903cec8ceae1199"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLaunchEnv (cyclomatic 13, cognitive 17): parseLaunchEnv has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"061e6267feb8820df258f6673ec491b728ce2964d5528375852fb761d09844b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitBaseGreen (cyclomatic 13, cognitive 17): waitBaseGreen has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/base-red.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d64994506cc28abc475b513476182f40e86eb941aefba656173fbe33017111"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check64 (cyclomatic 13, cognitive 17): check64 has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b34bc6ced2c86cfe5fa1f9e96695210ba18cad4de68651eaa8dff76860e460"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lintStaticRaw (cyclomatic 13, cognitive 17): lintStaticRaw has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/static.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9868025af5af8cbe15a79885e770057ebab531085a27d517328d630f3eeeb61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-list.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3578adb4d9343a31bef05c1b6e4400696d536642d6da2e4121794475221f9e56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function carryLane (cyclomatic 13, cognitive 17): carryLane has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-bin-common.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"394c3a60fcaa910e1cd54675f478272bc88f43818a54125402e9b8cb066fb118"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tests (cyclomatic 13, cognitive 17): tests has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48e19ead26807b44404604638ebe3d3f58fe43b9f3a48d1fa38c5a4dc9494f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOptionKey (cyclomatic 13, cognitive 17): resolveOptionKey has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/psychographic-signals.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca956d2f44604e4b8b368cd469f1215a9f5cc01d68b5cbd8fd16d69c65e93ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1f487db8408f7094a1f4762da4e0d52d53e5129f96938d4c38fb8275055eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settle (cyclomatic 13, cognitive 17): settle has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f4150bd33c77c3b3fff9b961dcb114b6560fe0ab4420eaf36e97e6c96cafd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/disabled-plan-review-fixture.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0575ff62b1c5b74efa2f9f93d46907ff43e62dafde5f53aad242254d496d49fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureStateDir (cyclomatic 13, cognitive 16): ensureStateDir has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/config.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb80bc4d04bc9bb6d182fd15a7d8b1783af74270cb2af6bb6e61b1d33f7758f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyCookieAuthentication (cyclomatic 13, cognitive 16): verifyCookieAuthentication has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"73febfd7fb6b7c3783e65eb04a18f9fab6ad49b7d946fd80a186c98afb1bcb32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkStampedRecipe (cyclomatic 13, cognitive 16): checkStampedRecipe has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5445318e5f11f00a71d38be2e8590a1ae0ac1f4674848bc3996dc12a5ade6c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function notTimeoutOnly (cyclomatic 13, cognitive 16): notTimeoutOnly has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee47de1a46d3592f30d162da437ff36079aa88b723d59d1d2267b1ab699b5c7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function officeHoursDesignChanges (cyclomatic 13, cognitive 16): officeHoursDesignChanges has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d368d698fa596d3ff9d27a5ddecb27b9a655706995fe92e59e3e02643a253a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageFromEvents (cyclomatic 13, cognitive 16): usageFromEvents has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-review-result.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aa0ee9ac3ee0fa76a47b3865b9b4c2ece65a0807a97cd9b29b64cd3cb51267"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1063e9bb01ec5c363b02292b1a48556c04d6d13c79a501eeb3e604359cda4ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-scope.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a423b481aa0b01d777eb0f5e8e140ecf0bb294d7c6e74cd586f310e3988059af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 13, cognitive 16): fixture has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/capy-skill-wrapper.test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"89156b1e6e13d06e16200bd1587a784e1a392411230f1c07ddc35777b48e340c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOnlyCommandRejection (cyclomatic 13, cognitive 16): readOnlyCommandRejection has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/read-only-commands.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"588aa2fc73b6d84b60cc42319d6b23817f0da717616134c84939ce50a14dfec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e9982972f87d051f10ef0be461c48db19512de7963fef728c03c5336470265"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forgetNotes (cyclomatic 13, cognitive 15): forgetNotes has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-record.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd461e6a815dea7d42e42637ab15195a848e4832246f18ffe67c59c5c2a28585"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanup (cyclomatic 13, cognitive 15): cleanup has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"721c6e19ecd47238b10ff3f020d7e1da9f68019cc7d5c12d57636bb30dca72f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultBaseBranch (cyclomatic 13, cognitive 15): defaultBaseBranch has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/default-base.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"422591324947717665325d827cf0a338b721ba5709dacd4758c79067310a2640"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twParse (cyclomatic 13, cognitive 15): twParse has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0a57f6b06d4a2048ab569c755c63d6fad34013452f2395619704498375dbaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkNoGstackArm (cyclomatic 13, cognitive 15): checkNoGstackArm has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a60996766e6f138d102f0657ea0d31e0d74e2f8c6baa14e77b01ff628d9fb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executionIdentity (cyclomatic 13, cognitive 15): executionIdentity has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf261c9cee445dfa936e8e9a8e86688f9a68a562c85ab5e35a01df0c352bb26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6af815b1d07c84029c11775617d90954264b13af4807c1de9d55d75d915ccfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatPassRates (cyclomatic 13, cognitive 15): formatPassRates has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"e387829f0e9dfbd039eb380164638bfe4418969457f74bfcf782eb1e657001ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 15): visit has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/free-home-guard.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"630e9225e245901979a64a09a709217d9b1441dc3c5983f7c3b332fcc308d267"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function link (cyclomatic 13, cognitive 15): link has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/hermetic-env.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55fa130f238348136f2c42f0cb63138d310fd7dd9961a15b70c3d1e6d8656ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPtySession (cyclomatic 13, cognitive 15): runPtySession has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/session.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4964abfef98b3e0fd3ab362092f4774530d1fa0523a1cb4213e8d7e1a0367f6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 13, cognitive 15): add has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-observer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7262ad6d9137bbd0dbe25c66d796fbc9fb26dbfaf9ce3c9065a2b3dbdfa7c3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWorkflowJudgeInput (cyclomatic 13, cognitive 15): readWorkflowJudgeInput has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/workflow-judge-input.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"54264b1c5288665ed7bbd8f07c6c2ba08462483fbeba7ba2d01244c264c0d99f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitSkill (cyclomatic 13, cognitive 14): commitSkill has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-write.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af65317f0abbbf66c392b5de0a21d872c17535d7bdea65d5802babc7374ef2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNativeCookieDiagnostic (cyclomatic 13, cognitive 14): parseNativeCookieDiagnostic has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-job.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd128a1c44f436463607e91fb9c824168f706a595be43a4ec6a45d17c20ff7b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost-history.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2107f4850522a2bb5f6d74a6a88fa76e9e6b8aee126782f32fe558871c97221c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 13, cognitive 14): parseArgs has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-diff-calibrate.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc45a847361221d0df7bb9c9184e54b87e4db65c898c547333b8938cde807f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gh (cyclomatic 13, cognitive 14): gh has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/release-gate.test.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a420ed86e767bfe161195bf996318f94442ea461144285488430b3b597631c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"545b45b71f831afe1150120721de62df47ce9901f4d702f29d52267920741bd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 14): main has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/skill-route-hook.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c733c8c0154afce7efae08cb2b5d7f45fcd94251b749102cdf2c38f017b10898"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"374512676515b5a50206a2dea3723d7fb10ce41122b9e22dbb042031a91fda66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordCiResult (cyclomatic 13, cognitive 14): recordCiResult has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-carry.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"120615e6424efd0759e410b6191bdec163a9e7495f1bce2f93e77ba194f866d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 14): visit has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/static.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7df62cef94864bf50034d5ee6b3c80ae6246c1510de1fe956966a90e2b8b37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectConfig (cyclomatic 13, cognitive 14): inspectConfig has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd2a94ae3d4e9b05e9d41568a536ceeaf27012378855b1968e1ae54bc85fe98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 13, cognitive 14): run has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/regen.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff6be9418e531dde5082d1036b02bd9f850722e7dac14bb6838f394b9172fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdResume (cyclomatic 13, cognitive 14): cmdResume has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"38192648d122b71736fba47828113b445b012080824d33a8958b633a44c32a88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contextPacket (cyclomatic 13, cognitive 14): contextPacket has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d608bb0f893f2989326c20992c16feedbd4254f6bd002cbc2f15784034b2263"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waivers (cyclomatic 13, cognitive 14): waivers has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e19c3ac029fe3c2d86c684a9ffb4395824e4621419542fd564799244e489b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertPinnedFamily (cyclomatic 13, cognitive 14): assertPinnedFamily has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-image-matrix.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c279c0e038260c44896682be5bb66a06be4f5d9b23d56461f5dec172bac1d449"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCaseCosts (cyclomatic 13, cognitive 14): readCaseCosts has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/exercised-map.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fae4ae3a04941655c022bc98e226bb10caf3d1734b397207927f720ceabd8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f42bb2bb32089709a3401f91fee151163af92a96d57e2e437223551f8c6fa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffSkipDecisionForFile (cyclomatic 13, cognitive 14): diffSkipDecisionForFile has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b9604981fd4d307f37caa55049b6d3f37466cae26d1c86418fd09b0c8996ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateAutoplanReviewFile (cyclomatic 13, cognitive 14): generateAutoplanReviewFile has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/composition.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea712e7cf9dc8c3be4ed7ab7bed2d7c5642fa46653aac66c092c877f627bf51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cf844ee990f304cc50c2cca5bb868b5d78b51608a1c6477eefdaea9ff24111"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-mode-option.test.ts"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e13308055f87493586e41ea7d36d7618053c8759510cdc27d265ee80a1d6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-native-capture.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61f5d20fa38baefd1b39566875b56327f1485ab393b9463e1985d17e6c9ecd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareCodexHostRuntime (cyclomatic 13, cognitive 14): prepareCodexHostRuntime has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-host-runner.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3052e760e96ada3b2b14b14764c24e34ffb168d43d288cc873ab5642edf9ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-review-decisions.test.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2193410bc2b38282cb6ccacdd21dd3e32b3b4401159df310f49184ac1b8188da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinNativeCookieJob (cyclomatic 13, cognitive 13): joinNativeCookieJob has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-job.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e11524599b2960a95b6e25dede65fc48fa57d27feb89234470e1f7775da8c8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordGateAhead (cyclomatic 13, cognitive 13): recordGateAhead has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f7bd274e8bd19e1948fa7e93f433cdffb21a62944d178b7f386d31f613bc09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startDaemon (cyclomatic 13, cognitive 13): startDaemon has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beab94412d2e7e91306239eea7fcbee0b51e72c6b7e6d52093baa86c14d220d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEmailSignup (cyclomatic 13, cognitive 13): isEmailSignup has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8477947316c2d4275ab1a6f6371983026c1ce085977207d7bd9dc0785729d7e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSkill (cyclomatic 13, cognitive 13): resolveSkill has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-bill.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd96b76c42b9b3a47276ac5fd9f9409c2aff51b0a74f2b53089e611b0699f06d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePredecessor (cyclomatic 13, cognitive 13): resolvePredecessor has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f45ec860a00ccef841d75123495f1b57f25f2a8c155ce6d2299c3b56eb45509"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSetup (cyclomatic 13, cognitive 13): runSetup has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e2540e51ea446cd490403b3ce5cd2cb185a1f67d484ab26953a55fcd91554f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df978ed500cd1a629f36b5974d074d8778d093ffc7317f8a17d92ae496f4678"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchClaudePty (cyclomatic 13, cognitive 13): launchClaudePty has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/launch.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d37988dad75fcbf61faeb8d9e0afd1c5cc5e394d083060d8030362768c1ac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c56a196b90cdc586b609f668916d0f896eb249964cd55646b4de53ac986983d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function userAgentMetadata (cyclomatic 13, cognitive 12): userAgentMetadata has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/device-emulation.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"655f7dfe66862fd5c3709f5c1aaa315fbc429513e920d416d16cd7b2c435b74c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5d2566c71559f78d27b260ce51c4f8f2d190a1177b82ac540952aa4d9ac4eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePublish (cyclomatic 13, cognitive 12): handlePublish has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d5bf20627091a2e80a8c60e0a2381778cf679d2f303c55b0bfade6bd624d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shadowBeforeAnswer (cyclomatic 13, cognitive 12): shadowBeforeAnswer has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"80968ff019565dd768942e4d8242fea6ed28e32b8b08aca7984e4cbb411d5447"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operationControl (cyclomatic 13, cognitive 12): operationControl has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61d7df0f8a8765c8536a9993784fb34fe27ab9da6615197434adc8fc212e3d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCoverage (cyclomatic 13, cognitive 12): validateCoverage has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70ea14c85e193b07a48681be81f38733177f100711de008229ddca0dafaab02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4371132a9faf14dce3654958b76c8eadc0249ff4962609dc3d0f1d5760790f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRepoDocs (cyclomatic 13, cognitive 12): readRepoDocs has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs-only.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d2c275ff48955d071761591283f6b97f0739c1b9d0efee78a6dfe799b6d62c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCycleStatus (cyclomatic 13, cognitive 12): readCycleStatus has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8031919263c868b50ee5c2eefebd3a2714e733858a725b552e0bb65fe527e7b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsOnlyLane (cyclomatic 13, cognitive 12): docsOnlyLane has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/docs-only-lane.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"99268dcc7fbc0aa5d19d77fdfd6e4e2151fd0f39e1edc2e4ef2561639bdfbd29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sweepResult (cyclomatic 13, cognitive 12): sweepResult has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9dc66023e1e0f8814a223cc1ed7f81014d12a1fb00cf26425cb36d526c357"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ambiguityReason (cyclomatic 13, cognitive 12): ambiguityReason has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/version-source.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ab59fe632550d88e33adbda2de91b03d660eb744e9c388fbd8b27007c6774"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function e2eShardIdentity (cyclomatic 13, cognitive 12): e2eShardIdentity has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd39af223a84361d95c2d3e1457e9e4b9b42ecbab58ec0b8720e6f1537f1423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computePaidCaseSelection (cyclomatic 13, cognitive 12): computePaidCaseSelection has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edf3314b16ef82b525b0b9e9f72d8b4eb0840391087dd3fa6b264c49e7ff96a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexPreflight (cyclomatic 13, cognitive 12): codexPreflight has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/constants.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eb90b2e956952b47d1b8a9140ce212a6b13bfe2103baa7a25baf3a4d68e0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateQAExploratory (cyclomatic 13, cognitive 12): generateQAExploratory has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/qa.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"001744a778a06fc710b98662422756bdd7f8e9058599513043097d603c3b48b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-evidence.test.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35d1384dcf60d15ee8c1d5f319838e39c8a79145ad751d0842aa00139673899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-mode-option.test.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce48f42538775ea0406cbd466498bb3534b23325027071463bb1cdb07b2b796"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-mode-option.test.ts"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c7aa3111066515241b5fc003dd1e901596784d29a60c81d9699c6f47ed623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/design-printed-paths.test.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"15299282933302f71dc4882a3ecea3937487a41584a629e0113361dceac959c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsUnrollLoops (cyclomatic 13, cognitive 12): docsUnrollLoops has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59e4fd98297a36a87182055b66fa9fd2ea9aa97711ea8e2a4434b639b858d61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failureDetailOf (cyclomatic 13, cognitive 12): failureDetailOf has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/eval-store.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b6b216f30c518d195257aa49f7d2e67a0c8388769269e98ee82c7adaac55d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173068385302ce5526df3e1e678ae0c998228521f1e9a964458d2883e816835"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bc88d5042dd235819a59db22091126a0821e69fa5cb78b2c7fc11d3382b191"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-browser-deadline-evidence.test.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c04883ea0243a45acefb44a4d5d2a263c127677aac1ed9ae95e39a6c8509a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCell (cyclomatic 13, cognitive 12): runCell has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-model-panel.test.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3c5f0f9ba537e7758ab16de69fa319679d5e2b17834069485fc32685b88d25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-safety-ship-evidence.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d5ba6650de9c7493fa223109ef1df6e8e89692b4e47fe6e1bf6cdac497b8ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSkillFile (cyclomatic 13, cognitive 11): parseSkillFile has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a083ff439c3bdc0a6640290dac0ed987ba26ffecf9b782353cba4b08755f537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30ef59d69f8db00c5bdc519063c9b0087c317ab8d3f5dd32555fc44287f91fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkCeoOnlyFlags (cyclomatic 13, cognitive 11): checkCeoOnlyFlags has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-ceo-only.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4519d9293c615d3844e10f71d222f365e32a40959400f3cb9441ba327cd3c0ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runChecks (cyclomatic 13, cognitive 11): runChecks has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2369a75ee021b65e20105a3407d5a1181df8b7f00ce4f2895941a9e13a6590e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oracle (cyclomatic 13, cognitive 11): oracle has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fcaa9d3a802359867e78afb3e0059b4a6e859e9b1f00c14027f0c83390151b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scannerPlans (cyclomatic 13, cognitive 11): scannerPlans has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f552edd4443b5d91939355589037d5e989e05547d318f92207804cb045fd305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateOptionsFromFlags (cyclomatic 13, cognitive 11): generateOptionsFromFlags has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/cli.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a5dcb86c8346f69d527b69ce061e87d8828f1429e11632ad7a62edb1fe8db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePublicGhcrTarget (cyclomatic 13, cognitive 11): parsePublicGhcrTarget has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-public-ghcr.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"28473aba73d645df21a4ff76ff84128fe7d890f637ed29150a2af2d0c098d126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChild (cyclomatic 13, cognitive 11): validateChild has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c1f7afaef737d29ff8c934fe6bf06de725f0e7548f490c2ae62ffe97e3536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-guard-pty.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c70792c0906e26d6589570d7c2659edcee65c86fc6d912de613a846971b886e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeQuestionSchemaRejection (cyclomatic 13, cognitive 11): nativeQuestionSchemaRejection has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20c1c7cd1bb479542e1f592897afe972287d8f52b6e266a1021cc1fefdf6d01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/review-checklist-pr-type.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0c5cb5ede1a613f38cce0095c3d0db232eac42910c8b9d67a045ed3cd1189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-design.test.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b1f698549c491c60c4a22b3950482dc2b9060b957c6bbe4402302e334f88c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRuntimeIdentity (cyclomatic 13, cognitive 10): validateRuntimeIdentity has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/runtime-catalog.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3375be99b8b84d7903cbd00d0a5958d78d5caa05c291ebe795ed8af86f51d2bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCandidate (cyclomatic 13, cognitive 10): resolveCandidate has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4698d6292201c7f1221e1b8d2a03d5bbd95e4463ccde7376f54e301541a38758"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registryProblems (cyclomatic 13, cognitive 10): registryProblems has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9890f211df4a4612f0ce718c49f87d76bb2cbc7f2deff94070b677be7b053ddf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stem (cyclomatic 13, cognitive 10): stem has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"784cfb77d0972dae16d0c00772118f5b633a8beac8713a450c8d48bba4bd358c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function subShardProblems (cyclomatic 13, cognitive 10): subShardProblems has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/shard-jobs.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fb49a9eae91a33a38affb7eb8f91b7fd7dfb37f563ab3a97e3423821b41bea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fencePrelude (cyclomatic 13, cognitive 10): fencePrelude has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/runtime-root.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ef1737076ae3ab8bfe2ea8fe15bdb941eda447d656fa163e9390fa66e75715"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checks (cyclomatic 13, cognitive 10): checks has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bacbeff25650e4bbfc115dab4d079c764132138b315ff258f28a76e8418491"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAutoplanDigestFile (cyclomatic 13, cognitive 10): readAutoplanDigestFile has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-digest.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cc2ad77937e5f5c6189214178558fa6168bee8d91be91c39b6ec14a89b5731"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-dual-voice-evidence.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccd0f945a22bc751618edeb972f2e41ba154031a19f3e84a5dd04ed7852e01e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee28ed9e534c2c976487cc9e68e7225aa0a080713262e8b0facefca4bea41fea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeQuestionSelection (cyclomatic 13, cognitive 10): nativeQuestionSelection has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5830c75fadff389149c4bc1e336f7c1cb74b8e3842a395e2e21946ceabc5ac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73d4f1c88d61a6d8fb5a9abee655d07b3e8c43b412575bada31253c58614720"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkBrowserSurfaces (cyclomatic 13, cognitive 9): checkBrowserSurfaces has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a2615cc07d306cc8843031f4871e6660773eddd2cd74d1c737bb3be94893ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a03b8cd3725d7fe53b2addc99764f9f88f8173f9f8396d0403cde355244c03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasNativePlanCompletion (cyclomatic 13, cognitive 9): hasNativePlanCompletion has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/plan-native.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"46235c4ba7f92be6fbbc5150e5b3ecc330e9142b574dc0991b14e7e48a8a0040"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit (cyclomatic 12, cognitive 33): emit has cyclomatic complexity 12 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba673f3306a347a7a56224e64deea4f43905e1612ae82c363922ac66113bf02a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function citationProblems (cyclomatic 12, cognitive 29): citationProblems has cyclomatic complexity 12 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/capy-skill-wrapper.test.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e0cb20542e342e9ac817340083201d5301a1f54cb2cba525c9dcc192a51f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 12, cognitive 29): scan has cyclomatic complexity 12 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/spawnsync-timeout-tripwire.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a836f7d0bfedfe4b5a6a249fabe2cf9c94c2ece7c3df42812b4f91256a6885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gitCommonDir (cyclomatic 12, cognitive 26): gitCommonDir has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b034415ee99c448390b28c30277e76ea2409c84e5348703f8542689b1fc898f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRepeatedFact (cyclomatic 12, cognitive 25): checkRepeatedFact has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7ec2d2243f24f5e06ecbd22751141908fdab7202aa1cfbe52a1470b36ef38e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keysReadInTree (cyclomatic 12, cognitive 25): keysReadInTree has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gstack-config-defaults.test.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee75f2ac81c9fe837170368c54a434fb80d663d657126e7297c3c97b05f8134"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capItems (cyclomatic 12, cognitive 24): capItems has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b8870090d5571f19dda19ec18e28b3e95f47ce047d32e78d59fb271236a143"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function builtArchitectures (cyclomatic 12, cognitive 24): builtArchitectures has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ci-image-cli-pin.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b249fbcdce30a077c9abe74662c7b8500d56aa6bd942410ade89306521771d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumeStopped (cyclomatic 12, cognitive 23): resumeStopped has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-snapshot-state.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d6c82dec278db0af2bbd33e06484b27b7bd57de193596a74e10462bf8c5612"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visible (cyclomatic 12, cognitive 22): visible has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/copy.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad74920a93ff37b1866a6a34fb3510ac87f7728533ac6d3db907ed2949e0ff2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bounceEasing (cyclomatic 12, cognitive 22): bounceEasing has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/motion.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c91542e594cd97ab61cad48aec6030a77fd62fe2f4d1ed1c65b8fa19dc48c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectArgsList (cyclomatic 12, cognitive 21): collectArgsList has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccadefb286416decea15ba54c28fcf176f451a26f7e99bc28f04d93bc941286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"886294bd8e3d2ab2ca6fb20d958030789556cd2eda9183099d4c8595a82faf82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copySkill (cyclomatic 12, cognitive 21): copySkill has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"980bee89227264b2561d84b97ec6e938e2c95010cece0b3efa31cc8c377e4690"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSkill (cyclomatic 12, cognitive 21): parseSkill has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2527157cda3193725c62a311445903fb2fb636e44c7050cf98fea2f8fbcb50af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"152439340697fcabe4a90028a7dad425a3a278991dde2c192c957c5f7c77d298"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-impact/key.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fce6e5b08e37ef4d1d872fcc16809be2bfea38504ce7c7ec7889991e3911b59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-init.test.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afedae3c64455122da14159857041571e2d28d13765fcf60e473196e1d39ba7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d91db2a11cd4f8b5b87b7a367937f29b824fd3c95fdb2d5a2500c6a2a9fd28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function session (cyclomatic 12, cognitive 21): session has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-hook.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ac3f24cbd83870525eb998387164e8f20d7dc98aefb77b3e7d39d749434e3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check38a (cyclomatic 12, cognitive 20): check38a has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c8aef6a252f4e01dc075f660271f4e889570adb540e122061772c1ac6d6c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanEvents (cyclomatic 12, cognitive 20): scanEvents has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a37258aef213a7896441936294ed6b0e25f618c19d8a1f0ba48d7c0107e569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bashOutput (cyclomatic 12, cognitive 20): bashOutput has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-aside.test.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1052e781d8aecdbf29e735001264aef417460de50a829709c20c7f5aef3d232a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9903c8fa3f5ea16973348146141ee521f519ddb9a82f0d52c79de8862e7fc85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twTiles (cyclomatic 12, cognitive 19): twTiles has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a86cb0a740db16beddd0c7bc6baae0104eeb9098a0689fc147f2347f4540cba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCleanArgs (cyclomatic 12, cognitive 19): parseCleanArgs has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1769ed37202c681b0e4e64d3764ade26457ba74a3bf585363039986b2bbe616b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellCommands (cyclomatic 12, cognitive 19): shellCommands has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shell-writes.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfbde421bee791779333734eea9d2c153e8e40e0ddf6cc5f64ed6dbf81f36e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedLines (cyclomatic 12, cognitive 19): addedLines has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-conflict-markers.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"44779b44cd4ea5f09e1815c2f1b487559a2ae382d480ecd0e526960a04002de5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function regenerateAndValidate (cyclomatic 12, cognitive 19): regenerateAndValidate has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/dev-skill.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b859a163abe8b93d1e617b1499d1b763324e14db991afbbc268c70a79ab77f36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagramBlocks (cyclomatic 12, cognitive 19): diagramBlocks has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32c56b59e30375bf5590650a98729080863aa27cf0fcd15f7a5169c0cbef479"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRecordedOfficeHoursAttempt (cyclomatic 12, cognitive 19): runRecordedOfficeHoursAttempt has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/office-hours-attempt.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b08f812e7a3ba35ccdeb8efb0690edc5bf4b5e24a97a044e93822a3cdcaeba8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 18): main has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/cli-mint.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ee056374271259bbf29355b05327d57ede5b2218a935c4863f5af2584e9c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preparePatchedSource (cyclomatic 12, cognitive 18): preparePatchedSource has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca88a053eb79977d883d8e0842bd46824f6240a858eabef835847deec8c44fdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAllPages (cyclomatic 12, cognitive 18): readAllPages has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b149c49ced5320cf513c07170b8e0d0e397f6dfc135cf75143829109301656"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitBlocks (cyclomatic 12, cognitive 18): splitBlocks has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-qm-edition.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a798eaed49d7b24d4f636e7304d7e43b2aedeb2066cfdf39ce33ce32642377e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 18): main has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-skill-docs.ts"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"04507ab74c4e809ee2442e7df3736f3453a4657367ce3db70fde237ab8dd87d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seedRatchet (cyclomatic 12, cognitive 18): seedRatchet has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/free-ci-health.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"386d2c70752a61907d7925526546b88012bf12e4cab8b847e9d658a39e35c22d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsTopLevelSegments (cyclomatic 12, cognitive 18): docsTopLevelSegments has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-observer.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a39c7a62cbd01c4a67ddab3a744fbfd69bab1f67707209c0ec733cb09865722"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skillCensus (cyclomatic 12, cognitive 18): skillCensus has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/skill-census.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"230f5dffbc6bf4986cfbfa061a899f7ad503014eab1d2056b3c7e204323ee0dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-floor-dx-actor.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cc9b50177e0e07de85f17127aaa8f78c5a4ccdf9b0e6569d27e059b4bd3904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activeProcesses (cyclomatic 12, cognitive 17): activeProcesses has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-job.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e2b5fed78678788b7491c5d9bef3ce5425d6bee399c909c5d5bb408d7c382a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySecurity (cyclomatic 12, cognitive 17): verifySecurity has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8173246260e9d595692d272849f0aee88aabce935fb127cfc4e65c872afedaad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function logHookError (cyclomatic 12, cognitive 17): logHookError has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/hook-log.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baabd735b2938e6b16668cc9ce6572670440d2c376e3ae8a41648aa0fe1fab1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openBrowseTab (cyclomatic 12, cognitive 17): openBrowseTab has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff582988d70a6858b69b19d7a666c020588f2ad727b7ec73d767fac95d856"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRegate (cyclomatic 12, cognitive 17): renderRegate has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/regate.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a982b564d1f4e02fc0fb95a3e04510a643b4922ccb0c4815b705ba4b97ab422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function browseBusy (cyclomatic 12, cognitive 17): browseBusy has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"542483e295439540d588d9d00871d4cb3e3f9e7e60c6cd7bdf611f049d403e15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function select (cyclomatic 12, cognitive 17): select has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0fdaec05fb6308c90b0ed34fed7007478beb1eecf04f010512006634b1d078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workflowsGateErrors (cyclomatic 12, cognitive 17): workflowsGateErrors has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdd8b742b3cb55c50ba3178705d84f082a35e5bcb8e92964bbd5245ecf44ba3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function journal (cyclomatic 12, cognitive 17): journal has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-guard-fixture.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf587e46ff7d10933e8d748c9bd3c8faee72f89aed9c3288c0f922f72cf42482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function firstAssistantMessageToolCount (cyclomatic 12, cognitive 17): firstAssistantMessageToolCount has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/overlay-measurement.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3b5cb7e0f92776d6e09e0e54bbd2285eca1a70734f1e48da45b7605a37d322"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-webfetch-permission.test.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"092d24d592839eab662f3964b38dcbc1c568f84e00e1759254ca6494d8371388"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function follow (cyclomatic 12, cognitive 16): follow has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa238de18b5d216233778c90bd194c7d42c97fb88002f3ad5f0904afbdf0b2f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampMismatch (cyclomatic 12, cognitive 16): stampMismatch has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-stamp.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"596858f8f12777cb12aa5768bf4c603145443092220602734606b4a4566ca1e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isErrorResponse (cyclomatic 12, cognitive 16): isErrorResponse has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/auq-error-fallback-hook.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3890d115c18603b6bfc2b380ce5c41c18db6635f0fd864ca9d0a2fb1c925af90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapperClose (cyclomatic 12, cognitive 16): wrapperClose has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/agent-notes.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"071dff70555b90f3043064c5cee7ed6cf3ca5bb4d36bbd2d6ce3967374ed7274"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29448811e0fa1c7b2ae4c67679a53c022b550d1d4ad4d5a191c1efd97107028"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectLive (cyclomatic 12, cognitive 16): collectLive has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c6542aecf6b1bc47f9ac81a8f2f08c61d1b16093e86f2a09cd183ef56053b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathFindings (cyclomatic 12, cognitive 16): pathFindings has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc77854d69539425a1faefaa230098da1193cdb5cb78108436c79d807e580a44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planCandidates (cyclomatic 12, cognitive 16): planCandidates has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-audit.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a519752ae1df567c9e76f6f9aa17f07476c13f63e03e1b3881f1311e8b17186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasApprovedStaleFillDecision (cyclomatic 12, cognitive 16): hasApprovedStaleFillDecision has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-stale-fill-decision.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"598bce99aca37d9214aa9511642fd4cb9573767b76f209061f01c449ce2f1d74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onStdout (cyclomatic 12, cognitive 16): onStdout has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/codex-session-runner.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd6cf290a8b04d76878193cd541e5389f0312d3f73276e1c0f31d99af1bb63c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-seed-submission.test.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bde28441fa4ee4e21d79e0002a9573ed2c08a82f4b0f93e820a6930825e40f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"24214ee781b1896464003e11d983135bfcac9816e1c6f525ea6df0e89dd46799"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emergencyCleanup (cyclomatic 12, cognitive 15): emergencyCleanup has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"4219f11a5f9459eefbb19d3ee0a59ad2667dfc69d43165225851f1c797fda43f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainWatch (cyclomatic 12, cognitive 15): trainWatch has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-watch.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adc7d2943cc8e44cd5892cba603774895c4283df4cff8ebfc38d6a9ed572d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 12, cognitive 15): visit has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"740c56d9ba2ce125ecf3b3f55b769db93268e051d5d018755a4e97fdc6398705"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function negativesFromRun (cyclomatic 12, cognitive 15): negativesFromRun has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/recover-receipts.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0b38e98662b5d612ca02bca12d360359247af6d3289630eabef40a47da520"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importantChanges (cyclomatic 12, cognitive 15): importantChanges has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cadence.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd8798b03de952e5f54dce3d62e626aed51fa0ac33968045c79d021d2b961a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalize (cyclomatic 12, cognitive 15): canonicalize has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tailscale-localapi.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a63abb9ff2eb7b96018f7d4f144b1d29366320a0249bd8fa206692b7ad3b7f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settledIds (cyclomatic 12, cognitive 15): settledIds has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-confirm.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1f2001fe21bf5aab91f2a0608b42a55e682a5353cc4502e5c4f3fe720bc9be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureExactTokens (cyclomatic 12, cognitive 15): measureExactTokens has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0af346d740e7f4604bc370d0268066a5ece876a67c8d7e021db5fdf460db90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spliceRedaction (cyclomatic 12, cognitive 15): spliceRedaction has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f43f31bd6b026e79de5fafe318a81a8a2a538bb150087434a787821df17114b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedResponseBody (cyclomatic 12, cognitive 15): boundedResponseBody has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verifier.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f6b66375c57226b2661280d16f3f034cf0a6b6159c328345f59cf7fb41e2e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGbrainEnv (cyclomatic 12, cognitive 15): buildGbrainEnv has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-exec.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc3962e26689b19dd06584ad6a0efa67e39bfe0704878ee7c7a1ebcd0941338"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lastBashWrite (cyclomatic 12, cognitive 15): lastBashWrite has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shell-writes.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e397038ed763fbcb712f8142cf20cb492fe19bd57f25549a91474d32dea4b76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadRunArtifacts (cyclomatic 12, cognitive 15): downloadRunArtifacts has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/ci-history.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c47e8e1e73b00b87d2f1cf30887c4d9696a9cb5de113f3c3d8374e2a6f920a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCiFlakeLedgers (cyclomatic 12, cognitive 15): readCiFlakeLedgers has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/ci-history.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd3b6d8fcb04d62e4a2662fffd779b3d22b3334a26928f66d0b3a2718c95cd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trace (cyclomatic 12, cognitive 15): trace has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-impact.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e34e898e93bd0b89091d3679ca9979cd96e5f0b5c29de107a5904add413e28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd957b6feca9fb40095b7006df7cd05c8148bd519355c422bba762068a0ca70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/evals-train-workflow.test.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d795f5fc26f29a8610ac83f188830359e4eb9dba2af7aa884d177a6e91b45c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredFindingAssessment (cyclomatic 12, cognitive 15): structuredFindingAssessment has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-section-loading-fixture.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da62a7201ea5970ee519d24c3635470f27c735f2d62b779e371cca5fea6ac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-file-permission.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee02095e9798bac0aa17eaeee66b9eac95ffaa876e3e56389c1eed2eada94c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/native-auto-decide.test.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6e1068fc3ff8c55549974dacf2c16ec5c273335a2f2c9222f1eda7561c1c45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-picker-ui.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee696fde0ce3270e7082ed15fbb1edd6d05fa56e2e3a39e051da9d6ee77b9985"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changelogEntries (cyclomatic 12, cognitive 14): changelogEntries has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"17845ebef1c42251995686eb781e085195860fe046425bff5fb18f94d18c8fc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeTailscale (cyclomatic 12, cognitive 14): probeTailscale has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tailscale-localapi.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e835c8785daebd0e612b55dd3c3ba4dab2a45de274d944ef75288b8991a189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldIntoUnreleased (cyclomatic 12, cognitive 14): foldIntoUnreleased has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-fragments.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"693a195e4cdd487ef3649f272a5e6e2b7b49737291caf922d05016a73f08c942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSnapshotPath (cyclomatic 12, cognitive 14): resolveSnapshotPath has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8c286afec83d1f9cca7d7344c3bd507ab882e788d6d49930e829604ce9c73a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyMetadata (cyclomatic 12, cognitive 14): copyMetadata has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"9566b4a2e93b409ef6224fd3dd3cafe28f5a3ff699a3b3df0bd429c46b79fcb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e5ed249849e5ff2f4bfc12b3a9da7ec93169d16c72afa50ea0a7332238d13a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertContextFile (cyclomatic 12, cognitive 14): assertContextFile has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6295d4af8d9ad35e0c4f0c31f1e54fdb9c8746f725ae3d1392cb3e5c7726d1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function userPolicyChange (cyclomatic 12, cognitive 14): userPolicyChange has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4e9c0f8b7e67b361ed97a3b9a6ff803cf92f49821fbf467b2276965ff7be52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function landedOnBase (cyclomatic 12, cognitive 14): landedOnBase has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2bb508a8512b497422776f191e1ffa1d510314d8d1c89603a2a73142dfdd01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateProblems (cyclomatic 12, cognitive 14): gateProblems has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-rerun.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e97694aebfc4739f15ba5c78ccf83d4c38465d8d02c34ad30c5fd93c9c8a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-scanner-release.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f896db810e1612f4967cc33a1ed00cc3b377d573aa4ae7089059a380adcb8ede"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 14): run has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/design-build.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3549c4ba3e45a4d3bdedbde61999ac069ea7c8445720fdf971716b6eff22471f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 12, cognitive 14): finish has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/claude-stream.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec70ddfeab31d4a337a982e098fc632db188814ef14eff688a78f60992af5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function undoModification (cyclomatic 12, cognitive 13): undoModification has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-inspector.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eabb7f4218323d347139fd86def8a3f9c18ec96c0f64f4d6f17b9fa03e3cd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateNavigationUrl (cyclomatic 12, cognitive 13): validateNavigationUrl has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/url-validation.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"361b7a046ece25a8f5ab7659147f3b4da32a8141d3902010bc443eb1f73399a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMatchedRules (cyclomatic 12, cognitive 13): renderMatchedRules has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"350d34ca55ab8d02c74dcf6903e7ff3bc0e8dd9da81c46257e71b36c3da6c8d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveVendor (cyclomatic 12, cognitive 13): resolveVendor has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d9fac10a6f1328ef4ad103c362fa86d24010fd0712a28556e496036a8a36df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/test/tunnel-bootstrap.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc461184370bcf6481d571e425b623a406d59a07ec66e6ba55d18f1c0c659e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provisionImages (cyclomatic 12, cognitive 13): provisionImages has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29d8390023bbfa1b75ea7f98c8ea222acad83a5db0418e60cc85d09a2a28aa0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function twTrack (cyclomatic 12, cognitive 13): twTrack has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85311830335102d7be9bdb9d833f33218074850eeaa5aaa73dc2c4e21eeaa9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function incompleteRun (cyclomatic 12, cognitive 13): incompleteRun has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba98a1e7d84d3d67bc355d2b9e9edcc2964d6f400d1441063002549a0f54652"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prScope (cyclomatic 12, cognitive 13): prScope has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5bb13e92b8778e6d76fdbaf47575b5c0006bd2eb3fb2bce320d5bc9c9193a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function starterPolicy (cyclomatic 12, cognitive 13): starterPolicy has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/starter.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2770a5af7659b0828554ee70e25d80568f6da22b645064e500c24872b213fb3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNew (cyclomatic 12, cognitive 13): readNew has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9703cd212858a7809405687765f42616a204a67343c85c1dfcadefa1a0c9a41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 12, cognitive 13): finish has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8621ef61e05591d4dc7430578cb97db0e466dad9216ecc2f7d152b722b6cc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampGateFindings (cyclomatic 12, cognitive 13): stampGateFindings has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e29fb6d36c6e9622f3a148a6ff38eba44f8384af9b4852b50ce3fb449bfa6c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function audit (cyclomatic 12, cognitive 13): audit has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-audit.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02df55da231090d83c8132daa872efd804fc850df586ea7fb9bb7881348977d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laneLine (cyclomatic 12, cognitive 13): laneLine has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-bin-common.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"183cea768fd2006ee879347aa35a5bccd41c5be06ee7d480b3edf0152d4c672d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipConsequences (cyclomatic 12, cognitive 13): shipConsequences has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc44796240492a3da1d87023a103fc16832a977dd6024124b66b76591ff8d99e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b39e5fcf15a31d0a4325001729917acb911716c469255390428238c3fad731d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareEvalJobs (cyclomatic 12, cognitive 13): prepareEvalJobs has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"606f0f4aa9466a660a94d7d3e520a220fd2a69fa2aeffadcbe6ec0b3fdf29c0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertPlatformIdentities (cyclomatic 12, cognitive 13): assertPlatformIdentities has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-eval.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb55e268f2a35cdc42334df23c542d37f54cb1496d47565ab755a4a923b43c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJUnit (cyclomatic 12, cognitive 13): parseJUnit has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-native-evidence.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"42730470637c2810cd90dd30920d5fca90677296dd958bafeddfbf0772d85887"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/bootstrap-retention-shard.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e1798ed83cb2a86ab8a99731b6c338670ff345ee91b4f2db4f016dab3d999"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fenceProblems (cyclomatic 12, cognitive 13): fenceProblems has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/env-host-fence-conformance.test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3bb21f2e1a61bd3d93e4fd26e5582047ac2f045a2033dbc72178c38bedd62d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coverageSummaryClassifiesSeed (cyclomatic 12, cognitive 13): coverageSummaryClassifiesSeed has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa9c372e558608a8df538de53bc6f23fcc82a09c00daf1a2b79b3cc698f2930"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 12, cognitive 13): validate has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-eval.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd38e250ed2323e1f29d537485bdcfee4642c77cb12f0d60a81e4d2d5749c3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sharedPullRequestView (cyclomatic 12, cognitive 13): sharedPullRequestView has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a219c3efe4c3ced511c158c9fa2c786da9d0ea75d3cfebc0ae21ad97480b74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-browser-deadline-evidence.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de9fb98da58092d88a4f47e8f9afcb259b5cef29a83eff1aac4e1bf8d628cb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-auq-verbose-vs-carved-ab.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ce2e6b6b77da6269f87d6e9fb903e3c63d69b93aa80a58669efb22277aa204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45b02ea5f61c1e9a1e8bcedd9b821fad583fc6642dff30fa0a76e3254b207be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLock (cyclomatic 12, cognitive 12): readLock has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-land-lock.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1289d189c77c4bd764418ad020a610dfa5f69e19c57c303662c91dd4b162e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function areaKey (cyclomatic 12, cognitive 12): areaKey has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e68684bdba3906321fe0ba83a502a3ef505c2d933280001dca87e19c8af401b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changed (cyclomatic 12, cognitive 12): changed has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76010aa3bd883aecfa9e857b936b6dee97d8c33d0da2243a9a476859fa96177"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function floorStatus (cyclomatic 12, cognitive 12): floorStatus has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"827955833c7565fc2b1e78004e3e959949b5f291f5aa4f12881e78419c3f6734"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materialize (cyclomatic 12, cognitive 12): materialize has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9e5b14a66b8889b657b5baef1bf323a2860fadd7e5022147efc389e3a0c953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function content (cyclomatic 12, cognitive 12): content has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9210e9c5b7eb60986a6fda7bc1b2fd3375e507a7642e605532f573f84e4f4661"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83409ecbfe7dcb8c27aca0dafe46c31c72288ceec32d9d6988a19aeb11885c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPregate (cyclomatic 12, cognitive 12): runPregate has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"577e4a7806805e8cde601de811700836719558a04fb52ac26be212a0d0f02de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCleanTarget (cyclomatic 12, cognitive 12): resolveCleanTarget has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e4e5f036bb76a739605daa11a13297898197d21b932d13937d9ce3662e116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyPath (cyclomatic 12, cognitive 12): classifyPath has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc46974c7e5d5fa137d469105457e97eb46fd2b3f07c89170d719d1b0a3e5832"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function excludeLines (cyclomatic 12, cognitive 12): excludeLines has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f90a4b0ed21538d6353bd15d403e9e85dfe388fbf41db5ab08b988e901fec5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectTestFw (cyclomatic 12, cognitive 12): detectTestFw has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b605ae57df4c08f72620c4e590b27bf7775e7f69ad00ed99c465a3a9e7c31029"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function targetedClasses (cyclomatic 12, cognitive 12): targetedClasses has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-targeted.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e59ab11a0f11cdcdb9e7e380e6960476d19803d84f6c2a26e48a1dbcc2c875c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emptyWakes (cyclomatic 12, cognitive 12): emptyWakes has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e2ff9560df727bfd5666c674dfbae2eab75781131561c460f90b70799a80f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sealedErrors (cyclomatic 12, cognitive 12): sealedErrors has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7fc012675384e3f47f5ed35dafab5a5c02975839d1ae875d7fbb82d2ecad15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 12, cognitive 12): analyze has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/judge-calibration.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2767f81c36e14262c8afe87460392552e514e226af1b829b7e046fb53bc2d56e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitSections (cyclomatic 12, cognitive 12): splitSections has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/preamble-hoist.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81c0017abc0b42e8d1bc7701b259d0cfc4ee4cc2d6086f0d78e348cea72245f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6755a297a626781eff7e14e89b4e9c1573c597ce44e8dee60fe4ec9184cb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdd920128affc2f8ab329d2971c3531adffddab113243ddbc7607208b78a457"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/bootstrap-retention.test.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb2cf775e781094384b2048bcd3cf18f4cc3050f54eea4267c3ce3845ca242"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoplanArtifactRecorderStatus (cyclomatic 12, cognitive 12): autoplanArtifactRecorderStatus has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-artifact-recorder.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"203346a4da5bd49b298f7394a58dda8ec0d82a66d69e41c470517925855d69a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeProbeDirectory (cyclomatic 12, cognitive 12): removeProbeDirectory has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-only-browser-probe.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e299afb7c76389c7aec737f537ee41114a6fbdedbf1e3f792fd72ba023d398"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-autoplan-long-session.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6cd30b1ccfa0ad40a54aacac21451407f7223167a2c8fcf8e9ee8edf65c1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapError (cyclomatic 12, cognitive 11): wrapError has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"929bbcb81d08fb43d1b71df3fa0e3be5b3ac420a48c62bbbf16ede1b43b6976b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTabState (cyclomatic 12, cognitive 11): handleTabState has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0795bf2043f327d12761882cd966ec4864eccc0780aaa989e417fbe6817d9b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 11): fetch has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-picker-ui.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0fab161bb69e912f33c3dc6516f32025bdf9b4c601d87a9317409871d4ba45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hollowScreen (cyclomatic 12, cognitive 11): hollowScreen has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-github.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"968953655f80580171d431054ad2bd2d43587418f0bc6182632b8b788075a8bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conditionalReady (cyclomatic 12, cognitive 11): conditionalReady has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a96dfdad5f66242face6765c47013264bc3c089e08c9598b6b7c21f36d6d7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function storeEvalInputCache (cyclomatic 12, cognitive 11): storeEvalInputCache has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"801e7548fe646bf3641eb88c1e491f987f4e8607abca039018131dd68686a00f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a96a18ab009bbfa687b7c9f95d899ef94e942f4684b3881a8ffe3a87fec624"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runApprovalScan (cyclomatic 12, cognitive 11): runApprovalScan has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b6502b954c07a57750f0c46a515654ca607b5b7d08a97661d1df0c07a4d31f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-reconcile.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa30123f1706167d1f8665b3329dac85bddea314d114b52c0d4b9146c3dd189b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateVerificationObservation (cyclomatic 12, cognitive 11): validateVerificationObservation has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eccaf9926f36966807d13462853ba7fa688b1048034232a8b542586ee4e345"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseContainsHead (cyclomatic 12, cognitive 11): baseContainsHead has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/default-base.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7fec6d21b41bb7dbddbd5f746a4d57e93eb40dfc387159d53c0e02753e2faf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planApp (cyclomatic 12, cognitive 11): planApp has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/app-cli.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bd58a477909fa455b4e04502a358df4054b26e1634578fe8722209b8ed9966"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHsl (cyclomatic 12, cognitive 11): parseHsl has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/color.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"effa5ffcf91826fce104e4f91d934b350d0b73aac1144657a2badae5a1867b5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 12, cognitive 11): report has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/report.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"070674f5c00a35a143ec5247a7405f0e90c405f09b40027e1d53b51220d7b97f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function caps67 (cyclomatic 12, cognitive 11): caps67 has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/type.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f8f2c1b1bdc532d293310ed50edc9a80c3a6507a6224ed5e40d9ed7eadfbef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repoPolicyTier (cyclomatic 12, cognitive 11): repoPolicyTier has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"79837b870077777d0995596b875cccd32dca185804241ea93823167e82d7c1f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePrTarget (cyclomatic 12, cognitive 11): parsePrTarget has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a947b7d4f8bc56632a7853cc8f5ab3b5c3a4e1ea89ac56e82e6177ae4c8b7db9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heldBy (cyclomatic 12, cognitive 11): heldBy has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"745a147576ecd5e011b5de9f7aaf4aa8042ac3c0b9a520a0b8f8b7ce9ddf2039"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeKeys (cyclomatic 12, cognitive 11): computeKeys has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-impact/key.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5a15cad48f135c7514d66a3194a03feca92f412c2ee3906023cd4e1d894646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function screenTarget (cyclomatic 12, cognitive 11): screenTarget has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-readiness.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f0dd7dbc949920a6c488cd2f7b6935b690495ce18a9c1326f3f7cf01459a10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sweepMain (cyclomatic 12, cognitive 11): sweepMain has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure-sweep.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb25d062efdde742d9e5a4f1c4e0f44d4ba2d49acbb291eaa782a571f24e75a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function caseSelectionPreflight (cyclomatic 12, cognitive 11): caseSelectionPreflight has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04f0023d23d4d6fdaac12c19de8e25eca1eff732149fa8920c531ab510042b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-evidence.test.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ba9723c3264fbdca5e51d16a2d8090278f2decf79b5901076002263567478"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee2fa114fbceb8b305d69ba75c5f504ac17bf5c032c0952857989485eba98d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gate-list.test.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29d5d70c96a5167b2e98a831c4e06f1b30c9f10aedd1622d03641ced3b35630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFakeGbrainScript (cyclomatic 12, cognitive 11): makeFakeGbrainScript has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gbrain-local-status.test.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0a46d64b2772b18e0f83239d1f7ef3d8d26f747fc7792d0f3bc00fbae153dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function literalWords (cyclomatic 12, cognitive 11): literalWords has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/native-auto-decide.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e117387f4fac57c63837c1e255ff10c6cbcd2e5db2a0d432c636555052846ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordOutsideInvocation (cyclomatic 12, cognitive 11): recordOutsideInvocation has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/outside-voice-receipt.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6e0ea99a73cd645e2058f8939f52d236d9ab6a04486f8a5548a84551925dbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sdkSystemPrompt (cyclomatic 12, cognitive 11): sdkSystemPrompt has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/sdk-system-prompt.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60a9f0cd22b9462fd230abb49235fec9833cda70a8dc4ccf51e46ea502d459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ship-budget-harness.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"244b49ab6fb5f3e798b1baadf48860cb32297830a3f157c8af8870e3ad3a2906"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-edit-cropped-permission.test.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"058a890b78c8a5a7618c9688340d44dae0235144a927186de1d5623dd0191b7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-evidence-producer.test.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"721c4b5a527bcd069747f44deb96595d3c3fd806f9b19e693b3db2e25b2bef60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 11): run has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-gbrain-path4-caller.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b094015304f546be98f50f161c753dc96479b97c8d4305b8aadf2878a9fcb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-checker-interface-evidence.test.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba7faad471278a836e5cea91dc2d4e2369a7340ed80c3f1e9bf2b7aa1eed5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findWindowsBunExe (cyclomatic 12, cognitive 10): findWindowsBunExe has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/bun-child-config.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3781e2bf15b3fee9899387cff5de7845d9e0fea64f56b0c5bb3258df9bd4273"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redCases (cyclomatic 12, cognitive 10): redCases has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb55fecbd88498451a54abb188e142460cd2b218ab9560acd90dac24d835e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 12, cognitive 10): tick has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa774b04cc93e90856f7549098806e7e5995951df2ca1c7a78c94398c679375"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevel (cyclomatic 12, cognitive 10): splitTopLevel has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fabfa8749f16809fc5a687f2414d22a4ef0ea23b92a4507f836512b830e4f73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function carry (cyclomatic 12, cognitive 10): carry has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-carry.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b57d9fc3b89f71b1fb337e45e1c349eec6537adef9bbf07d41b06ba73c949c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publicNarrationText (cyclomatic 12, cognitive 10): publicNarrationText has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c54a90809ed76e5cb5311b4047c25d2265b25abd2c7bc2ac87671e7e09f347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function history (cyclomatic 12, cognitive 10): history has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"224ed3881f1ad65a3a5b1e66c9004bda877723860c1ac8568d1c32949d6deb14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 12, cognitive 10): capture has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0803a41872221671ae94a7b4cf36cc712c04e0ea376a40e384db686e65436e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plainSummary (cyclomatic 12, cognitive 10): plainSummary has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/owner-brief.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d8903aa89e7391fff85a55d889a9965695aa65d9a5aa395fdc8cd02d3320e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEntry (cyclomatic 12, cognitive 10): renderEntry has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"48abf02053bd9318975b3641bfe8a76ba4004bf96d4a78bd6fc16c67583979ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiptTargetedVerdict (cyclomatic 12, cognitive 10): receiptTargetedVerdict has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"38536792787ad4471b99eefce50c8a953012a158dcbd22277e35a8c5309bb94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function docsChangeSince (cyclomatic 12, cognitive 10): docsChangeSince has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c1505246e5ffa3c80849fc2a6be3a68fbcd6b687db8b3e1117cdefd0038135"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 12, cognitive 10): render has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/render.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2189f4d5f24e48f8a6460aa1c11ce695af17d1eec837b00df3f65921c2d8cf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-report.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a07c54bff7b02f2bc07a81dd8baab885a12e71f203585558ddaba6a5f78375"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extendCase (cyclomatic 12, cognitive 10): extendCase has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ship-measure.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac2f61043227811a603e6bc7abcd6114d677ed1a968cee680f1878758da44fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function censusStats (cyclomatic 12, cognitive 10): censusStats has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-health-report.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1decb7bebdd1fdb63dece194b227d3122019ad842c094b0065313a87fa539e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clippedElidedNativeAuqIdentity (cyclomatic 12, cognitive 10): clippedElidedNativeAuqIdentity has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-native-capture.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a77f26e2e96008b0ad7c4f08cf590151c7eb896a8a2886efed449bf3ef9e59f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordE2E (cyclomatic 12, cognitive 10): recordE2E has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/e2e-helpers.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4514cfaa8c31dbb5a32bb0fbb8bf6240c3aedd7a9e6b47f2ce040cc7e6d07c64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArmJudgeResponse (cyclomatic 12, cognitive 10): parseArmJudgeResponse has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/llm-judge.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e425dbec6e12229d7ebf6072165ba91bea29ffc7b9a4fe53c15ac840dbfa0b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qaCommandAllowed (cyclomatic 12, cognitive 10): qaCommandAllowed has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/qa-functional-observer.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed994bb601a8fd26362cdc5b6a06a6c55d95eda8031ff80832a237aa94b0369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-skillify.test.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"566fec26718efd3ed6209b928f134b37c33a07f4cd7e32b1583216747854b5b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 9): run has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbac92e4f0f9d55c418e9507b3a28b1b9cab307aa80507bc84450373d79943e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function absorb (cyclomatic 12, cognitive 9): absorb has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-usage.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5768fc7c227cc67712f62b827f4210d206458e015cfecdcd50b8f6d0630afe92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileSha256 (cyclomatic 12, cognitive 9): fileSha256 has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5767f4fe7c85ea2965931633de100e7fb1fa285c7a2c0619c036bbf5ba7e6d4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isLoopbackMcpUrl (cyclomatic 12, cognitive 9): isLoopbackMcpUrl has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-mcp-locality.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d654c59cb9c06e3ef2091ca49622a089ab2de443396440c0f283340c2ec1c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 12, cognitive 9): close has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea2229ece16a414c54215c3aee72654d33ed323d17a499845411544830b067d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shipRunClear (cyclomatic 12, cognitive 9): shipRunClear has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d47b69725f251f8b3582d767cf87026aa9430d68a7a24a25d73727248e983c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampOnlyLine (cyclomatic 12, cognitive 9): stampOnlyLine has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/stamp-only.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0de8e3d461eb05edf8aa7f4be8226d01830e32201b44fc12dbb4e31879a7de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 25): (anonymous) has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/tailwind.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3c8c35097886addc11be280b5c28fc29cbd5affee4cc5e5a2cbf063ba6525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFrontmatterFields (cyclomatic 11, cognitive 24): parseFrontmatterFields has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a04b8992bc23414c08c7e5190fef369b5b454b20bb41f0b493b40a2a5aa333"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 24): (anonymous) has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b90062cbcaa356eac105659f584d951825b025690a7175c5a8686da37f928f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSpawnEnv (cyclomatic 11, cognitive 23): buildSpawnEnv has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0776165240273c7ac552b8da698d711ac129e73a5208bbd8e4f2ca25e64fcf7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 23): (anonymous) has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"651617fec60ca97a34575dc56f00c982b95166bc84ebb57cc95de43c6840aca2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 23): (anonymous) has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cso-windows-launcher.test.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cdba2e7cb04d386501c6722a7ff2843a6688481b5f7d34c485a0a5df59594a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStore (cyclomatic 11, cognitive 22): readStore has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"686575b19a7935fcbfc818cd8472576dda9e3b3687f77d1aba9fc4bdb34fc0d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 11, cognitive 22): run has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28be58217cd11e0fe3dd8bd7b6ba2d4ac12a973206d257dd1914e995df13ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exceptionProblems (cyclomatic 11, cognitive 22): exceptionProblems has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48958dd61ea3e3552031732c25c8f7d924d8fb907181afd58d47aeec3571ca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeCuratedPath (cyclomatic 11, cognitive 22): makeCuratedPath has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gstack-upgrade-migration-v1_40_0_0.test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"981fe1d4fa126a14ee166329a5bcdbdd8ceb187652efcbcbc76c309a13e079a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodedDocument (cyclomatic 11, cognitive 21): decodedDocument has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc236febb2b7c3c69746bf371c2cedc454b016af638920251e68c315fd8f87b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compactionCycle (cyclomatic 11, cognitive 20): compactionCycle has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd009ec4a3a574dc7bce0e0d075f93a1a0a9edaf75a597f9e7960f96f7eb0707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkBudget (cyclomatic 11, cognitive 20): checkBudget has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e224223117c5cd54de40165f43da7a4fcc70059d5a739cf8edf5c0983237fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedLines (cyclomatic 11, cognitive 20): addedLines has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/doc-links.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fbee811fcb293b532110d50e3d487e80e2358c0f4e3a41ee49082b7084be00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStoredCodexReviews (cyclomatic 11, cognitive 20): readStoredCodexReviews has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-consent.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2dd5d83cd8dd3e2f32701e4995f52a222364a13532c88a09178ff277eee71c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-review-cases.test.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d259d94899e69565726190ff65bfa866ecc4ca2778a3affe575a5ff0c6b0e46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPrimaryRecipes (cyclomatic 11, cognitive 19): checkPrimaryRecipes has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d826bf40fffb8dd4f7d51ef6640101bd58b5e78220faec724261874c841e41b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function displayHeadUnwrapped (cyclomatic 11, cognitive 19): displayHeadUnwrapped has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf1e1bc5301915fce318cc8aa110bd9c0672ee4b08b74b9958bf3efae7f818e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forceLinux (cyclomatic 11, cognitive 19): forceLinux has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-free-shards.ts"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4e98752009a9be0a9a056bde5c0024489a52373b163dcb746e2e4512921276"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgePtyState (cyclomatic 11, cognitive 19): judgePtyState has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/judge.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"240d89edd5663d0355a862a8506e64d467f37e6b618b34a984e4401aa299b390"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-review-cases.test.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b498e1e888109ebbf19e740d8cfac2533f1c04d80f4240903b75d95b197002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 11, cognitive 18): reconcile has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d437abe9660a3a2c6388d236f4746604e239a9a5a8b31d66146c2597ac04d9f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryClaim (cyclomatic 11, cognitive 18): tryClaim has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1541a3950065a2ad6567759e403f4811c8e8042faac5b8bbf44ab0239037e8ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregateFindings (cyclomatic 11, cognitive 18): aggregateFindings has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-export.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee644640e7519cbf2a06f06e7a10f7a01d061b50701ebe638daa4bcf12ff8e09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function medianRgb (cyclomatic 11, cognitive 18): medianRgb has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-png.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4218652f1b8666a670c1c5871702ea406b8a75fd1f6d07538ab022de53abb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkUnheadedSection (cyclomatic 11, cognitive 18): checkUnheadedSection has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/chrome-eyebrow.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"86167e5ae784d921c70a735b9a5acf9ffd90e1158ba0f4e365708dcea86257a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyToBranch (cyclomatic 11, cognitive 18): applyToBranch has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"261639f55bb1ed5a2a08f1b883d6e08bf5f3c1282ef762820bd127f42d60cb15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function zeroHunks (cyclomatic 11, cognitive 18): zeroHunks has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fac088ffd641299c803d4bbfebb4198c1762f4da4b382d85306ab27ad7777bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFor (cyclomatic 11, cognitive 18): planFor has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/eval-history.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"da69309d3d1caa777f06f64dbdaef522f09c98b92bc9f2b944a48f0a368913e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substitutions (cyclomatic 11, cognitive 18): substitutions has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49efe8a82ad1082152bcedbacee29bcab15e2de620a81bf176c196d52c71b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowFiles (cyclomatic 11, cognitive 18): flowFiles has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/design-printed-paths.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"52db6ccb5f8b462c0165845b5cc9efb5ab5561961534316d7570e6e1f6609eaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForAny (cyclomatic 11, cognitive 18): waitForAny has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/fake-session.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb24d1ad5ab6ff0081261c03e50b20a48c65ad981bdadc47de52c34415dd3130"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/paid-retry-supervision.test.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9bedf11206dd94b805c6ad6f8d514c19801ece06dc3f7d3d79d598cbb571f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-only-capability.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"26649619c101fa6f8327cac21595c756b01670eebdff6fdb08decaca6cd31621"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function token (cyclomatic 11, cognitive 17): token has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/history.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f629d292bae31d3f156e7cd2c2d35d0f7b94fb1c2838918905a744020c6ab43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCycle (cyclomatic 11, cognitive 17): findCycle has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"36264b3c036dd80ab59417154ca8dac0ef72a0181213c920348a2dc2743f6c2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 11, cognitive 17): run has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"5900255164947ca32ecd4a722d9d6a711be46a0fb073ab077cb286ab91358616"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReply (cyclomatic 11, cognitive 17): parseReply has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a18eeb3a5c8a4bcb95f255e8660078b97295a64253f303cfe5adbed85c6754"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/ceo-mode-option.test.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"88821e17fcf4ed1b8dcbfe51e712fd256706f2413eedb8b7419648e36fd293bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForAnyOutput (cyclomatic 11, cognitive 17): waitForAnyOutput has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/launch.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4138c00d462f8bb618a7e75d8efe144f24fed934c1c26437696c304fb42aa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disagreements (cyclomatic 11, cognitive 17): disagreements has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/review-bot-history-facts.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3176d8adf981f1c51759091bca167903752493ec983f741c1b3e9f0c48b598c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanSource (cyclomatic 11, cognitive 17): scanSource has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/sdk-system-prompt-tripwire.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cf20edb1a7fd22aad87efdf114ec4acaa801269daff2332e9208087b096c9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openDbFromCopy (cyclomatic 11, cognitive 16): openDbFromCopy has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8fc201ea4e96be3b5c9bdd213e6cec10e3cbfd9bf16230aa4860246e011525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainLease (cyclomatic 11, cognitive 16): trainLease has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ef7f69ece9f5cb1b24aefb77b01268f6874477621a44284db6f8484bd4b221"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateGalleryHtml (cyclomatic 11, cognitive 16): generateGalleryHtml has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/gallery.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bceb97a92e4f52436ce7d357e5a768e8d49d6f67c36c7ba466ab92b0508486"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyAndHash (cyclomatic 11, cognitive 16): copyAndHash has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7796f32d20640c8a4faa55968f1c21d1e1cefc1060d8282b78d1189f6a60799d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withReplayBundle (cyclomatic 11, cognitive 16): withReplayBundle has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5e978c2feca9d75ada379a5faca8a9ee4bd356c801084a104ee151b3f28682"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertRuntimeCompatible (cyclomatic 11, cognitive 16): assertRuntimeCompatible has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/runtime-catalog.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c12b3dc207c206b4b87c0f5fa2e2d453cd5b32167089d0fe796a0e72137568"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function braceEnd (cyclomatic 11, cognitive 16): braceEnd has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/html.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4d398ae93f1b43f3345d8c4449f744c33be96333adf590c5129a0fef67fefd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFromRun (cyclomatic 11, cognitive 16): verifyFromRun has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/run-evidence.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a9cde229fb157769b6cdecd6fd36905116d3f9aba1687f9fa0993ca2d047b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinFindings (cyclomatic 11, cognitive 16): joinFindings has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-join.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0646aa39e67dc960ff6e7db1b2f6cb965a83eb0cf5cab0e699c5bb001838c24f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkReceiptProse (cyclomatic 11, cognitive 16): checkReceiptProse has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-prose.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f357ca2b3fd9cbfdf53a9e9314ab2b3d389b89e15fe4f11f0663a181e2a118d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followWorkflow (cyclomatic 11, cognitive 16): followWorkflow has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f4ea4f4ef0dd6d97f58805eb57044967883b1eca6e05e3577a70d6c1431045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractNameAndDescription (cyclomatic 11, cognitive 16): extractNameAndDescription has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/external-skill-names.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b9f66b5898fdceed7267588aadb075da739670575135736385bb6300980bf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeCommit (cyclomatic 11, cognitive 16): analyzeCommit has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/garry-output-comparison.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6270d2da54148e0b580a25ab8dd4bf21645c2b3a30ad6161ad40e2ffe370fe5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveDependencies (cyclomatic 11, cognitive 16): deriveDependencies has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pr-dependencies.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f4c980a4dcc0f573a77857f6b6568b0007c8b4c3adf828f2fc19af367d1f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixtureDocs (cyclomatic 11, cognitive 16): fixtureDocs has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/docsync-fixture.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d37ee95c744f5bb17200b57a8c5cbc12d4f3c1c7d5c0915f6203853781ab2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gcStaleHermeticDirs (cyclomatic 11, cognitive 16): gcStaleHermeticDirs has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/hermetic-env.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b12e49f63ca2a95c89753f6c9714a4c86223b7cd72a86d64d08c7523764945d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-count-empty-review.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"927b0552f1fd4635022fce18a6b329be5f3538d09c5398bd6f9dcee8effdc7bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sectionLoadFor (cyclomatic 11, cognitive 15): sectionLoadFor has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-prompts.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c3f54d32e24f7e6512d6d52de94b012b51f7fa3e2efabfd012ca4be1ad6989"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkIconCoins (cyclomatic 11, cognitive 15): checkIconCoins has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be8f37bf6046c60e4e5fed5b87dcf2d6ea47ad05733d264a29b0b2210c4a6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPillRadius (cyclomatic 11, cognitive 15): checkPillRadius has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/finish.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73d44711d0f1a68384c4c36b8d88b95eac1adcb1a47813c5f18d1dc7c1804a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBinary (cyclomatic 11, cognitive 15): resolveBinary has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afee966989218a08897aa89ec3d2b3f6eb5c860d4a4c692a251537c08744e67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskedSides (cyclomatic 11, cognitive 15): maskedSides has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-mechanical.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a27cf3080ee060a42c6b3e791d2ebc627857ed8161cfe4aa868191fb01ff9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeRepo (cyclomatic 11, cognitive 15): analyzeRepo has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/garry-output-comparison.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcf6e7f9d11114e6f0404a0722754b87549d37a81cb2033cd9188ebda58646d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/aside-driver.test.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"990edb54466c882d88b1d8d559763b2652411bc9080c6b0fb1a8786ce478241c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matches (cyclomatic 11, cognitive 15): matches has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/shared-libs-eval-fixture.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e8616576eb02a11f854d1e1e76e652927db1808d2213a27234cba7fc8f74e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enclosingDeclaration (cyclomatic 11, cognitive 15): enclosingDeclaration has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/test-value-fixture.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc387b1aa7f487a1032b47a97061e9945a51c22aeee56ca0b3a5bd5df39c409"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scenario (cyclomatic 11, cognitive 15): scenario has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-count-collection-completion.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36a3a6f64a5008bf3591e54191e979cd1c8d29157737b81be54ed58b3606852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-pending-question-pty.test.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"181bb672db88e3bc34d7a116a3c47ac2fb0389e159fc68624d87497c8b3badb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c85e2ac6b54f82a72e1438f55901732400225d894a4abeb5862d350de998cbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-only-cleanup.test.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d703c3ef199857dafccb7f36702f4a8ac35bc70576d92d34b42345d04e11d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenlessGhSteps (cyclomatic 11, cognitive 15): tokenlessGhSteps has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/workflow-gh-token.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"db945302cbf5f70a37f84efd31ce596713006b57699f5b6c285a9512380a749f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isNgrokAvailable (cyclomatic 11, cognitive 14): isNgrokAvailable has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf42ce8dbd8e11f1fa6227eb866e89b5c2605278276b3b668970a6a9387036c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda6d437af7c292115d842ec0f1029bb863e16c0164781d648d247439928ba3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTrialOutcomes (cyclomatic 11, cognitive 14): parseTrialOutcomes has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b7975b4770ca3a1be10d641735f3333c23f2e91da94302f7056d098904591a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respond (cyclomatic 11, cognitive 14): respond has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/recover-receipts.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf336d42db48baeb8f01a8329a9efe70a64dcdcbb50c8dda82e882d97b579477"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 14): walk has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ca624bfd7d2095f8eddac5142df556f8ad8a59f208b30373c9e9187e752b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stylesFor (cyclomatic 11, cognitive 14): stylesFor has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/css.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f5e33264fa608dda8efa6741158e1d5b2babc037e28212eff5b5739294f3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewRounds (cyclomatic 11, cognitive 14): reviewRounds has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f529dc7c09b5449f08ffd844818e45cd838ecd71f15dbb10117f11437993e669"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 11, cognitive 14): exercise has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-ceo-floor-interactive-boundary.test.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2b05e04f638303a2c84f8c3b85265abda7def00275288f0ef3cd0503a6c480"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTunnel (cyclomatic 11, cognitive 13): openTunnel has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29f21c1aa9800f64e71ae41e80ff171f808ae16d46985ff94d63bbd4cc1c7cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConnectRequest (cyclomatic 11, cognitive 13): parseConnectRequest has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9efcb8687450bb7ac4007099917b641c75cac8759408999dce99bf352678366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 13): constructor has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f3a5a91cdf3ce8739d0d8b276d870d8b15bb89e59669538312e6ec28402e94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyRun (cyclomatic 11, cognitive 13): classifyRun has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/release-gate.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d3854e48404289911c3f1a383707d8196c6fd89584da399594470c2adf6570"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawn (cyclomatic 11, cognitive 13): spawn has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/test/fake-device.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e770b57a93fb9514ccc0b1ccee2ec9c7d039092cbbd49a9253a476db33fb976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc665cdd4eeb8fd17ea9817be1b465e70594e14a624ed768401b9012d46bfb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareContainment (cyclomatic 11, cognitive 13): prepareContainment has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7c2d3b9eb514b4f342072076bd0f0fc7a0b1084ce8d172777fddf4c8be0e41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyTerminal (cyclomatic 11, cognitive 13): classifyTerminal has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21e27ac3a9b596dfb27c357fff54ce4a8e63900cc50da67f035c8948bfbee7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadEvalModels (cyclomatic 11, cognitive 13): loadEvalModels has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-models.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d218245ea84b526565873326044d5e416a861fcebef3342a76db9a23c28a90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function notStampOnly (cyclomatic 11, cognitive 13): notStampOnly has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a8c256ca6d08f6532c552d1fbefaf7ca16073aa07254de04be67c24cff007"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function timeOperand (cyclomatic 11, cognitive 13): timeOperand has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bdd06ef5e2045e68eabc73ebfdb224b5b74d17e6a477ffdfbcf0f15ae2d020"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseGateErrors (cyclomatic 11, cognitive 13): releaseGateErrors has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/release-gate-policy.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1bfda2d4a0ad32d462ebb79caaefdd3df29c68c2cabebbde1571f50a5b720b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureSettled (cyclomatic 11, cognitive 13): measureSettled has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5246feab9e5bc9496ebecc686c33d67ae9709360ae4e726b745bc2d0345463e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPhase (cyclomatic 11, cognitive 13): runPhase has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/autoplan-run-fixture.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02ea7730cc24032f59824d9af53a5d63613fdf3dd39d2c9b507cefd61fa71ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagramCheckboxLegend (cyclomatic 11, cognitive 13): diagramCheckboxLegend has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/coverage-audit-evidence.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b7cf97f5845e28236d15d75f2ac267d6bea5d1c121601a1126cc5704916032"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/disabled-plan-review-fixture.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"878d332220dcb9ed3134b689e25a5c8da63b4e329c4fe5b09d9a60d95c709f02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureFunctions (cyclomatic 11, cognitive 13): measureFunctions has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/module-size.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd5f4e538020722fa6ab0837d6d8f3238d7fad1130f3e31e437bb29eefdc41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/native-auto-decide.test.ts"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb618b169cc6800124449e8d3bf8dbd8fbef373d31b85066eefef27c996c28b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-codex-scope-namespaces.test.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"108546047a7aad5b5f3cd0a5d557c02f2c1e1a1a92423d68e8b38105832b7c98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-codex-scope-namespaces.test.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b83ac900866491feafa8d699c1cff41f6061c4412cc94e4114fb728706f3c82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-qa-workflow.test.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4f245bc7d6a634892532cf9d0bd9470f38860c8a360399f5f0a61a665c5bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-qa-workflow.test.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc20f854ca304b486bb65c044275b75b6a4d8734094714e695e7194c3e7076a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeTab (cyclomatic 11, cognitive 12): closeTab has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56de40a48b2568d52fee2a6bd83969882049bfb766dde28c8db0a86813ea695"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureProjectProfile (cyclomatic 11, cognitive 12): ensureProjectProfile has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/chromium-profiles.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c309f4d8faeb3cd0b880618b9470c7d995ea07f48503e57b47b6010ef32b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headGreenAt (cyclomatic 11, cognitive 12): headGreenAt has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost-history.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7334876c555e31a1c3ae94f31fff892c4618b287b31c1d96ee42959be7ba5c9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verdictFailure (cyclomatic 11, cognitive 12): verdictFailure has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e111611a6448e86f9c46ecdd6f6642a0ac760e95e2fecb1b989578cc87672c43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopped (cyclomatic 11, cognitive 12): stopped has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-verify.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddbea38c14e0119ae35d6a802c4d938cefb532c0078764ce1bd4c704e99761e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkWavePin (cyclomatic 11, cognitive 12): checkWavePin has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4bb1183abce49a336f3bf0cbc0027d0ef00a9bc373766daaa73cd0140c02dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRecheck (cyclomatic 11, cognitive 12): readRecheck has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-recheck.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a016dda6903245316c79c91a46b063cc38c46a66fc6330334816c0dbf6fe60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 11, cognitive 12): report has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/test/train-gate.test.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc26526d52e63230c6da0cf49540a1bb072251f317ee6eb5924a02bbf3dd4114"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFeedback (cyclomatic 11, cognitive 12): handleFeedback has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/serve.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad4f7f5db685eef5739e6d43a520914a6643edc91edaf7e79c007df06ab0f45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"404eb2c429efba2fa246cfd0d0a603cf061408702a03d1b16248eccfbd558b24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectMarkerRoot (cyclomatic 11, cognitive 12): projectMarkerRoot has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce209d089ab8eb97eccf61f67b8118ad771ca50090aef4f210bdcdfaddbee6d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectContributorMode (cyclomatic 11, cognitive 12): detectContributorMode has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/contributor-mode.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee325c4558d1ed0bc2b086943d82f694a35709d7725636af31c84b078c79fb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerQm (cyclomatic 11, cognitive 12): registerQm has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-qm.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbe9c131df79ec76955e2b7524cc69f36b490a2565735e15d4d4366e0c44887"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendHookTrace (cyclomatic 11, cognitive 12): appendHookTrace has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d747880d6977aa1f3a2f641274820ec3258441afb1b5456cdd3a60d4d25db85e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectPlanReceipts (cyclomatic 11, cognitive 12): selectPlanReceipts has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/e2e-shard-reuse.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"832e66124b0ea7060f1c4ad7c5d5cfd8d2860a66df9e5714bcdd902ece999c67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairCalibrationBar (cyclomatic 11, cognitive 12): pairCalibrationBar has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/arm-pair-judge.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d96fec230f3d6c40277494780df5025e1b0006a9766525bd782974dd09e2b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canUseTool (cyclomatic 11, cognitive 12): canUseTool has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/auq-sdk-capture.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"daea86dbdb86b7dc8cee3e1e5d89d400129386d1b9f32d6290fa7ceec8d42e6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sectionBody (cyclomatic 11, cognitive 12): sectionBody has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/office-hours-completion.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e107c445356d58d1c749d621dca43836e8bf1db3fc965f94c0f832aea095c6b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pendingQuestionRecorderStatus (cyclomatic 11, cognitive 12): pendingQuestionRecorderStatus has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-question.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"361aa6df1050432b2e3c29b5db98efa9a84ecc56ea9c37ffeddfd7b390eec53d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 11, cognitive 12): run has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/providers/gemini.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"801fcaffb0686eb40a724ec579fa6563aace6180ec5c2cab92d19ea03dd96851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtimeFiles (cyclomatic 11, cognitive 12): runtimeFiles has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/setup-production-deps.test.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c71e7f6b5199e70137f98da7e10c71986bfefea5783d62818207736afaadc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetViewport (cyclomatic 11, cognitive 11): resetViewport has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"638a65c06569a251b97d9dc9d53511b1bde388f316094f5e513d7dd687c5ade6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tunnelAgents (cyclomatic 11, cognitive 11): tunnelAgents has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"703691eeb6dfddfaf0fd3f7058195740e76c469eb96ee3a6d5511299243ff5db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decryptCookieValue (cyclomatic 11, cognitive 11): decryptCookieValue has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"752a5aa96a0d01fd868164c457f22ddbe53906845466f555b7b5b43dcd30d94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInRequestTab (cyclomatic 11, cognitive 11): runInRequestTab has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/session-tabs.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"635095f04ae92badd4c37dc10c065291a4327b889e9682198e89c2a7eaff3243"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function touch (cyclomatic 11, cognitive 11): touch has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/touch-commands.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5edf70f1300003b8e8afc47e7ebfaa5291c6e7bd35f2c4f1919619db04092"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/cookie-import-native-job.test.ts"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9640cd4ac26f4f4f24ce0b43784a299b899463dd013cb2b8f22b277ab5d849"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stableMovedAt (cyclomatic 11, cognitive 11): stableMovedAt has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f948f1f30415fed49c50891abfc50a6061fa8765bb7ebbfd84b0c6510812f5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describePlan (cyclomatic 11, cognitive 11): describePlan has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3d1843f5e2a00b9c5daf55e0b91a490015019eafa4743ce4a0af4999311284"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function variants (cyclomatic 11, cognitive 11): variants has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"341bd2613c7ce3958d63e381d91659a020911e94c38460f1e1cfdb5b16f110ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8d152b2b959201f10fa2841237816fe3f785cc34f38a6275d3a5d768ce2009"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function approvalForReceipt (cyclomatic 11, cognitive 11): approvalForReceipt has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-citations.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e14d21fdfd6bf4ca5deed2fb72ef34f217871d5452e8bb12a5126933ed9b1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyGeneration (cyclomatic 11, cognitive 11): verifyGeneration has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c737960fc19ffb0224e63e83261622e320110b36280fdf6af78117142c9f589"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c30241a4c99a77992e54e1e9e99894ed1ba268c6993ee2a56f75e11313654c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-list.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"55726307b39ebb12b2a0d66b8e4ed172c7dbfaf0151a018d1a9934c53307cb46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memorableRecallPolicy (cyclomatic 11, cognitive 11): memorableRecallPolicy has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"484b12d1efed4f17f31396712252091175391c48961663e7daa080fcc855f122"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wait (cyclomatic 11, cognitive 11): wait has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/greptile-early.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d13317a463d0cde35b3b7e631743df17b242712a90a302e526791d83a7aee81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findInstallVerdict (cyclomatic 11, cognitive 11): findInstallVerdict has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/install-verdict.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a57d78b8d1a737d45ee6474c9f8b8494e76f2780b03005372f892c9058c7e69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFreshnessReport (cyclomatic 11, cognitive 11): renderFreshnessReport has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-freshness.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b35b67a2b0265c5a8dfd866ad43862fd84f34eead171c693daf6cbc7635e2e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plain-title.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"813afcae8c931d7035818bb148730aa1b5117002edd0734bb55ac1aa3c397e64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySpecFixesAtCap (cyclomatic 11, cognitive 11): verifySpecFixesAtCap has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spec-review-cap.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8669331b81f23fc0c1452a8835fb17e99fb84b0c4f674cb021e73ba6c29a83e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attributeLegacyRecord (cyclomatic 11, cognitive 11): attributeLegacyRecord has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-flake-rank.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"79233224436d00ff7e07c77e82107f667b92d4e1eae012850e0cc8303eaf0b98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateLearningsSearch (cyclomatic 11, cognitive 11): generateLearningsSearch has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/learnings.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8049cc41bb0921fbb4f4323755164c2427920857f471fd1cc74b7bb356818e23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function play (cyclomatic 11, cognitive 11): play has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill-gates-smoke.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb35e386536f41bfe775b932bcdf8b7b2c092552cd31f1a9a36d332a69b5502c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCurrentPlanApprovalScreen (cyclomatic 11, cognitive 11): isCurrentPlanApprovalScreen has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-count-pending-exit.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08cca1b46349bda9636d932357a6a6e7870701741cd309bec35a65805c3277c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSkillTest (cyclomatic 11, cognitive 11): runSkillTest has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-review-report-recording.test.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"87799a6810bc1cb34b3823f68634f40697e1fe661676fcba59779fdb1a49c43a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attempt (cyclomatic 11, cognitive 11): attempt has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-skill-questions.test.ts"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37729ce094069eb1f3bc0c3a89f4404e1025301a069efa83c4561d950e52219"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 11, cognitive 10): close has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a7c2cb68bcd0a3a6b4ad256e0f53921b2ac00766582750888029d02a1b48a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTabSwitch (cyclomatic 11, cognitive 10): handleTabSwitch has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cb88282024f3d2afa8b804b4241ffef982f78d88ab82768cc748029027026c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/test/terminal-agent-publication-lock.test.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d61f2ce42fbcfab13be0451994f2f64292a1b3312e37cb825b9e6f422bc5961"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16ac3e4a07843da35f0f731e0e1830ea5d87e8fc946427ecaff3cedbb2c202e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createEntryElement (cyclomatic 11, cognitive 10): createEntryElement has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"facf98ec73067e715e540618d2ba0e85936e69337590d2f0e6d29a7493300f86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 11, cognitive 10): handle has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/ceo-review-gate.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d354790913a875b2f451ade115a4b0c9aa250f644407556cbeadbb4044c8cdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushPermission (cyclomatic 11, cognitive 10): pushPermission has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/contributor-mode.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2ec87670be51210d4e337e77668297971b46b6c9fd312bb71b7fbc8db96526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 10): constructor has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74968ee8d6544bf1617fcf073900443d7df8de21f77e43f3477794c6bc85288"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptGuard (cyclomatic 11, cognitive 10): attemptGuard has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc13bc81c82d6c464364ee9f70c1c20d52429acd696dbc076e68da54413f177"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"644b11e449a6b451964da8d3581eaf4a52fbd819d0a3f37f0f8243b508c42792"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hiddenWordCount (cyclomatic 11, cognitive 10): hiddenWordCount has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/rules/structure.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3377eaad2d3ed185b23fa0334b38e884ec30894d1efa583318ed3e2b9035a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDryRun (cyclomatic 11, cognitive 10): renderDryRun has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d24e5a3a8dea6193866f3bb0706216b251d8ca5dcec5354c1c9c918309c66d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decidePrune (cyclomatic 11, cognitive 10): decidePrune has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0acd34f55a16b4282109df4a93ad2aca17d6e2a7bfba28e1a34e5bfc3dc20fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHeadChecks (cyclomatic 11, cognitive 10): parseHeadChecks has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gh-poll.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba7ccd3d6fe83c849f55d41592c48ee8fc9462e04baa28dd079e1b1459df428"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertSafeDest (cyclomatic 11, cognitive 10): assertSafeDest has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d462df2c97710d16718a0ed69edffc32d58741c80fac76d4f01235406e96dd4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 11, cognitive 10): record has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0850efb53ad183749aee30d2dd59d3cc5866f6958913bf6abf0590496e5e70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePlanReviewModel (cyclomatic 11, cognitive 10): resolvePlanReviewModel has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5214da0697034ee669f1eb93998e2b2cede90ac3a5531866ac00e246955a57e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePlan (cyclomatic 11, cognitive 10): resolvePlan has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f399d73e52ffb6fc94c8ee04d1946139ed01658b7ba8ccb54ec6f1c6aeab2a20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitBaseAndMerge (cyclomatic 11, cognitive 10): emitBaseAndMerge has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89de30144b290f5c6780cf645cfd2746f9bdac194c8b793b876df7c491a21d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGuard (cyclomatic 11, cognitive 10): runGuard has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/guards.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccbe81a7e90a7f2a4c25195bcb8a82d1925acf2b2e0def2de33462a0aa47d59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOnce (cyclomatic 11, cognitive 10): runOnce has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b68011db52de0ae7d919a74bce4c7489281f07352c9e1e3f869cc4c9661ae8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headPolicy (cyclomatic 11, cognitive 10): headPolicy has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/head-policy.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"892cda33e74c35874a1e4a4c78807834bc85a82bcda41b3a29675e1b83446ead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7fdfeea0b7097813b914e965b3f0fe50b4c1f80c7ba26099be8f69e3fe4bee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locusOf (cyclomatic 11, cognitive 10): locusOf has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-scope.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0e47ab5ddc8d029b6eafec2a6ebb97af27dd978d52579ce096e6610d1c8691"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 11, cognitive 10): render has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runaway.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"625cddfa5db8ffd4d52a9019dfa2ced9adcd15ac9159e5d700aa7e4aa4494baa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchedOpt (cyclomatic 11, cognitive 10): dispatchedOpt has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b0a5b94689a674847f6c11b6a4cc93b967c8b10301e91eaed99ac5d97050ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mirrorPathError (cyclomatic 11, cognitive 10): mirrorPathError has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b085f57afdc62504b77409b1a439902cdc50a157e919018c16fbd8ac498b64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function baseRedErrors (cyclomatic 11, cognitive 10): baseRedErrors has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"65016085f2d43323dbb784dc564278e9c6709423eda9800cfb13f16f85653a0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stampedFiles (cyclomatic 11, cognitive 10): stampedFiles has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land-direct.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc077adb24faf0371b678c40457b27e85ae5294615ac67ed7a58cef42f88592d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkOwnedStagingDir (cyclomatic 11, cognitive 10): checkOwnedStagingDir has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/staging-guard.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f1cbeffd4b4fb4d415d51fbb8be7e8f03f18adddb6de8c07587190a0186d0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hashRegularFile (cyclomatic 11, cognitive 10): hashRegularFile has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cso-scanner-catalog.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6189040de1b6e8ba70f53e26653812886fd11008f4bd492f8e8fb51b3a79ce0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isLogicalLine (cyclomatic 11, cognitive 10): isLogicalLine has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/garry-output-comparison.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b1f49ac90983f76ac833e6cfb73e09274505ffa080fa7308c7678ed870ef8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveModel (cyclomatic 11, cognitive 10): resolveModel has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/models.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d21b16a12aaf83930fccceb7d087267bccb3141c6cc288fb5ccb4b8c3f83ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-paid-shards.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9c2817439d4c877abbe6924d6485dc8204f0b9f5c1bc7a03577ba8f212b809"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-dual-voice-evidence.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"931bd661715d9aabe600f05f809cadb620456dff11d5029523e3d5098dbd889c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 11, cognitive 10): fixture has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-methodology-names.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e571028458a633486a1a52aaa1f0e95a9a646bf554c3887b6d07b73b9514b579"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/autoplan-publication-guard.test.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"356f92065535a04180bdc769b28374a92a749a0877acdd1f948a60a963d3e168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchedArgs (cyclomatic 11, cognitive 10): dispatchedArgs has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/codex-effort.test.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f790a41177dfbb755259324e5e10276034886bd791d471c3fbd132d4d2da6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gstack-ship-receipt.test.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44a655f58710c294c721832357367f48a016a126242d8296ece63d19630b06d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/health-eval-fixture.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bdb671a1e63823e3b4bddc9a7c5c941b18748b3174e834d8084f24570217fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextCeoModeNavigation (cyclomatic 11, cognitive 10): nextCeoModeNavigation has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d16349638a5316420c116cfd8333a23bcea9e0b0ef647a5366a4586bc3b5ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function barlessPostureSubmit (cyclomatic 11, cognitive 10): barlessPostureSubmit has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/ceo-mode-option.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a857d5306443bb6c51bd788370a8d6940ef6e5e65a3358459e07c9e1b6cf47d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeRecommendation (cyclomatic 11, cognitive 10): judgeRecommendation has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/llm-judge.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e69e2fa7f33d84abd9953dec2b13021b93eadb29cc3d6b5ffe6d8a93c079f83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageFromTranscript (cyclomatic 11, cognitive 10): usageFromTranscript has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/model-panel-harness.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e873f9bb27b0b88cfd7b1eba1848bcc2ab977c6e9694721899fc05c35ddebec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trustDialogInput (cyclomatic 11, cognitive 10): trustDialogInput has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty-trust-dialog.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ea5095bf3d14933f7b8a8d4d17b78bd1e8afcc027ff0fbdd29a6d02d54a5b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planCountSubmissionInput (cyclomatic 11, cognitive 10): planCountSubmissionInput has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/pty/classify.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88f89025f5ac5bddb3656688eb91277d2213ada49465e3699d4d0df7e11347a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeOnlySetupPreservesCyclicLink (cyclomatic 11, cognitive 10): claudeOnlySetupPreservesCyclicLink has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/setup-codex-scope-cyclic.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6808d61e52969cd5e72e672ebccad4f913a394cc22c2df66ac2cf1262ad6a9d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-create-combined-permission.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a20faadc76f0af70c5a0c4908e2f05edd8e8242d3ac5f23a9b847e07c0ec2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-create-permission.test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"439c286493558eb1346b76490799e65744a5e7d560b24c4e1f360b497cbebd8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/plan-edit-cropped-permission.test.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c41083fba4fdaf5d53281f674ec69aa66d76a79c2245d3221948ff67261428"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/pregate-user-policy.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b3d063863e52d9c5bf360abb84583ea39fdeba783dd5dd3a683fdf4e84550f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-plan-actor.test.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3aed90e5a168decc3ee851aa7a2b5a3c21bb8487c0a960b18db13051c90b51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/shared-libs-review-start-evidence.test.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb905dea88fd44fb293af1445a45d49757b2794765c95fd415ca12f3a36f230d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-plan-mode-no-op.test.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4a7b0e5c665eaae5ada79876f8c91f2355523daf51b6225ea7c4da10853aff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePairAgentFlags (cyclomatic 11, cognitive 9): validatePairAgentFlags has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f88e35f90dd17e010c169832fa10df04552a3e41d2788f13a427b7a11584c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownedGroupMembers (cyclomatic 11, cognitive 9): ownedGroupMembers has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66ed76b2a5cc5f1519723720226a445255ee50d5d2af42baaef0efa7a4a02ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializeArchives (cyclomatic 11, cognitive 9): materializeArchives has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d642b3aae1a054aced9a3bdceabae2361fd96ed9c86e9653ad0e4a4060bd6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visibility (cyclomatic 11, cognitive 9): visibility has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcda2fb20bea5f1cee02ceeda33177594c7a1002cd72be3676c0f7fd1633a46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unfinished (cyclomatic 11, cognitive 9): unfinished has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee9dbbfcaa6e1bfa8c2d0b4ce93eca7e668a200bedaf6a88b9dc3ec45dcd7a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBareEnvRead (cyclomatic 11, cognitive 9): isBareEnvRead has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a123b3ba2e06b6f1c62a263f84b8d4e60170f3d9af0a4c2e16358b2ec46151c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTreeLine (cyclomatic 11, cognitive 9): parseTreeLine has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-brief.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e3e47b741c18a13cc930636fdec1d40e44dc1b2eef91531f67543c0798ace4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prSized (cyclomatic 11, cognitive 9): prSized has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6e7e1b6a6edde8a37d8da2a991215e7860d1312625fc3a63a45dc6514d14d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairRefusal (cyclomatic 11, cognitive 9): repairRefusal has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land-direct.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a39a3633e064f473ca970e40a3b8f60585d893b082f7f4801e04c60e8a0c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readyTailLines (cyclomatic 11, cognitive 9): readyTailLines has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f39cd1da63fb324d3ed9dba09e234f1607afc10e35051b3e09ecb42298a8f67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b6de249b5afb7d3cdea103fcfb1b68d2d825ce743db014a131ea80eb3c937b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classificationProblem (cyclomatic 11, cognitive 9): classificationProblem has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/measure-bar.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b46a158d134e03d5d578b268d28ecb9afb36f16c5bed0c8189a261c3ac9356e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 11, cognitive 9): fixture has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/gbrain-read-capability.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a04038e2d5d556a56c8299a3e2263284129cd8666b3fa03f8a6d1c6bff31dfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/disabled-plan-review-fixture.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e96df8dba88494db0c486198f46bfacd175013f8bb912cd313de4549aa5b145"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addPermission (cyclomatic 11, cognitive 9): addPermission has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/plan-skill-questions.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00f3dbffd1e606d67a79ef983a35b4123a0e3cb83c7bb78dd4b224fc3b33652"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 9): walk has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/onboarding-moved-literals.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8441b3ecb012d5245d4c98cea22c1ce2a83172c4724a5526d2e0bdea3e6015"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/qa-deadline.test.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3c7116b0e961360135f80803c841b09031036de973d0ca073593d95b7a3ab4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-design.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"030b724fd793bbdfad9c3099d787b7cdd088793ae7ea7c84282305b53430303f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/skill-e2e-session-intelligence.test.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d66f6750f79c0a51993f097b9cdef3182811b3f2059f8f914dfaec1cffe7b9"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/cli.ts: 2957 lines of code: lib/cso/cli.ts has 2957 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":"lib/cso/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55f6e915943a7f4545044e6818394ebf111569cdcdf55ec31df41c992d4c6f7"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/state.ts: 2607 lines of code: lib/cso/state.ts has 2607 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":"lib/cso/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7ff19679bbe5bf55319ad805d6918bdb3b68f42600e8ad68083a40fb74d3d2"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/browser-manager.ts: 2333 lines of code: browse/src/browser-manager.ts has 2333 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":"browse/src/browser-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590a3b5abc347ca9e48897ef3147c4f027e41e47e9f805a036907ed3104e4891"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/verification.ts: 2179 lines of code: lib/cso/verification.ts has 2179 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":"lib/cso/verification.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a629c762cd3c5db37dced01cdf6ffe064ae46ae1a2c8f21dd6f279e46e862c"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/cli.ts: 2153 lines of code: browse/src/cli.ts has 2153 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":"browse/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a03f8d7a2c245bb1259adf4f5715eba92fadf04da740ba36bc0512bf9fef86a"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/test-free-shards.ts: 2147 lines of code: scripts/test-free-shards.ts has 2147 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":"scripts/test-free-shards.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e97f1d69d58ce80b032c5714afe1606952b02dfed13b3b1de874acbd52db4e"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/server.ts: 2065 lines of code: browse/src/server.ts has 2065 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":"browse/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d6671ccbbcedd9cdabf20dce0ee4cf389fd6abfe8bd12ab9e4eb530858b639"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/preparation-docker.ts: 1687 lines of code: lib/cso/preparation-docker.ts has 1687 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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"631f5eb9a7a1e4433b4112e0be44e300fb15f5f7f68664471c4bbfefdff66deb"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/redact-patterns.ts: 1678 lines of code: lib/redact-patterns.ts has 1678 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":"lib/redact-patterns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af56de3da0cd60084dc4952ac4415af825631c83f311415e8ceff0e8f3935cd5"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/preparation-executor.ts: 1495 lines of code: lib/cso/preparation-executor.ts has 1495 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":"lib/cso/preparation-executor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c452ffa80876bc28bedcaf8d2172755112010a3b99c4610fb3a8326d6f9f65d4"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/write-commands.ts: 1343 lines of code: browse/src/write-commands.ts has 1343 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":"browse/src/write-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f64219e58c9d595daa10342f0b7e097d7056bf3a7ab21eea1b16f9136d4a12"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/context-bill.ts: 1340 lines of code: lib/context-bill.ts has 1340 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":"lib/context-bill.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b6fe274a68432b08ca2e31d32b27977504dab7e150d910e175c8899d81f8a6"}},{"ruleId":"R3","level":"warning","message":{"text":"extension/sidepanel.js: 1282 lines of code: extension/sidepanel.js has 1282 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":"extension/sidepanel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"018f47984670e997f4965e59efcdcd6af29cd6c24ad4ea97514c9589a02d4893"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/resolvers/design.ts: 1265 lines of code: scripts/resolvers/design.ts has 1265 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":"scripts/resolvers/design.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde0ac517475d35cda2e9e6c6a784c95a9b43a1b1a95fae06d11279248504f4b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/preparation.ts: 1251 lines of code: lib/cso/preparation.ts has 1251 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":"lib/cso/preparation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58894dbd36e3d3675fc4b78234ac73d5fb87a62d8be6c658b5c949ef9a4e2e52"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/snapshot.ts: 1189 lines of code: lib/cso/snapshot.ts has 1189 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":"lib/cso/snapshot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01905d313afab1168ecf8226a70225c243ee83d2d6d05e0cfff53ceece51585c"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/terminal-agent.ts: 1150 lines of code: browse/src/terminal-agent.ts has 1150 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":"browse/src/terminal-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8a57a7eb5954fcdb287b0482d6bccd6b59cec6624fa3e07a06e638b4ef57a8"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/docker.ts: 1133 lines of code: lib/cso/docker.ts has 1133 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":"lib/cso/docker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887b737acdd2a5d74d6cf3f7d25232230d06590a0803241d9bd1e0fe4182ea14"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/preparation-container.ts: 1127 lines of code: lib/cso/preparation-container.ts has 1127 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e11de39457cf4e321f9cb4cc17addfb6a85ccac8c275ae5792764e5aa90deb"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/test-paid-shards.ts: 1119 lines of code: scripts/test-paid-shards.ts has 1119 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":"scripts/test-paid-shards.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c3b4fda1177839de3a6c798518c95c609d4dcf86582cbf9459742a2865dc5b"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/gen-skill-docs.ts: 1105 lines of code: scripts/gen-skill-docs.ts has 1105 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":"scripts/gen-skill-docs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395a20957c8ea0dbe7d6258c033b2407a2c251e2e8fe485f343f157bc7a1621c"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/contracts.ts: 1072 lines of code: lib/cso/contracts.ts has 1072 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":"lib/cso/contracts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0072177262c5bf91c8e9b34a0074d62596a36feb2129525057af781405d366"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/meta-commands.ts: 1052 lines of code: browse/src/meta-commands.ts has 1052 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":"browse/src/meta-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9de6738cc55f991677bd35b0ee4d3437fb2b43f6e9da58426d6f377f184d6a0"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/scanners.ts: 1045 lines of code: lib/cso/scanners.ts has 1045 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanners.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae988179c3eca4ee9461c93a4194346482313ed8c9529e6f9597db7bc418154"}},{"ruleId":"R3","level":"warning","message":{"text":"extension/sidepanel-terminal.js: 984 lines of code: extension/sidepanel-terminal.js has 984 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":"extension/sidepanel-terminal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaee7c66c84b617857f77540b4ca1f0fd7dcda02f2796ec8469069c76718315"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/cache.ts: 969 lines of code: lib/cso/cache.ts has 969 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":"lib/cso/cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f64cbc9bc2571bcd2813c88f9cb7db18afa9c8b5ebdad8aa21f05aefb4d56a4"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/cso-eval.ts: 946 lines of code: scripts/cso-eval.ts has 946 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":"scripts/cso-eval.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041714599e2639a0ab9f40f3c6cb901a05e32d109d352d17cb496862029626f"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/scanner-executor.ts: 883 lines of code: lib/cso/scanner-executor.ts has 883 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":"lib/cso/scanner-executor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"556b595ec17f5bdbd9847ae7a046e5a384db899967dcc5599c265506b0d22e76"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/lib/paid-plan.ts: 854 lines of code: scripts/lib/paid-plan.ts has 854 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":"scripts/lib/paid-plan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df89173cc44850f3653ac52d6358383cac400829fce10411eb6e06ffec5fab8"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-catalog.ts: 835 lines of code: lib/design-catalog.ts has 835 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":"lib/design-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"832f2adc974ba7d19d96abe28d5158ecade6732454f3ddc346e6d5f8e8c8fb5e"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/cookie-import-browser.ts: 821 lines of code: browse/src/cookie-import-browser.ts has 821 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d2531f0b0abd767e4f2e1b3b1e4cd7e7846895c245ab1a9611c4027e3fc375"}},{"ruleId":"R3","level":"warning","message":{"text":"ios-qa/scripts/gen-accessors.ts: 815 lines of code: ios-qa/scripts/gen-accessors.ts has 815 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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7305cff8f14383658c57324ba43660251cb64366bbf6802da3c866659452e4a7"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-release.ts: 805 lines of code: lib/ship-release.ts has 805 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":"lib/ship-release.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc3146ba3f02dedf9f840f1a879062c25417619be206452323b4ced7306faf5"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/result-codes.ts: 792 lines of code: lib/result-codes.ts has 792 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/result-codes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98e3368c825258c90895ac381607cbac69799d40052c930453fab7a1831ad01"}},{"ruleId":"R3","level":"warning","message":{"text":"make-pdf/src/diagram-prepass.ts: 788 lines of code: make-pdf/src/diagram-prepass.ts has 788 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":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd388925b3a2c5f574c91497ee3d33bbe29836493d5c297808f329c57e81a572"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/lib/paid-report.ts: 787 lines of code: scripts/lib/paid-report.ts has 787 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":"scripts/lib/paid-report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca502fa38a08f21f4a7454a24c9f74561650aa43225b0c1acaccbf1e2418cc"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/ship-measure.ts: 775 lines of code: scripts/ship-measure.ts has 775 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":"scripts/ship-measure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bf4e0016afb9070fb0ff0b31bac5045b3d9502c8bc448050be30c00dffd3b6"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/restamp.ts: 758 lines of code: lib/restamp.ts has 758 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3cf3e22394043f8f49a8821ef7a8bd8af1102c4bf9d160604ca429865d51a"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-lint/html.ts: 747 lines of code: lib/design-lint/html.ts has 747 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":"lib/design-lint/html.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9efa0f6bf781c105bd475375ac289a5809261014ea4d79b665c0c24e31a5a2"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/process.ts: 745 lines of code: lib/cso/process.ts has 745 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":"lib/cso/process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c639b6858a7d02ac67f883e15f3fdd6ef9155a20daa5cf8eb2005ca3289ebc"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/redact-engine.ts: 740 lines of code: lib/redact-engine.ts has 740 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":"lib/redact-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d77d79ece1798037995c6328ff696dce94ae7a36e5659782e6ef8d0ae57f56"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/cdp-inspector.ts: 736 lines of code: browse/src/cdp-inspector.ts has 736 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":"browse/src/cdp-inspector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b5770e97ab3de58231ec8d5bbde71ac0ce2193f7c687569841f2c35b699d88"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/witness.ts: 731 lines of code: lib/cso/witness.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":"lib/cso/witness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbfed685ffa0e4f2645a688a4dc4ee3ca175091032da8558200dfccc59d5015"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-policy.ts: 728 lines of code: lib/ship-policy.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":"lib/ship-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685a75744a90456862eb7c689720943689e3c2b465b03ee8396298f07186c98"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/aside-render.ts: 719 lines of code: lib/aside-render.ts has 719 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f463de7d4047a6eab550a327477d38961b844fd5b3715db0ab94f07a039a9d19"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/lib/shard-engine.ts: 697 lines of code: scripts/lib/shard-engine.ts has 697 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":"scripts/lib/shard-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a15c38f1e03b888a7fa3d57a7f5f6a0044a77f60368e684ee91b572976d54c2"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/read-commands.ts: 695 lines of code: browse/src/read-commands.ts has 695 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":"browse/src/read-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccaa788450563a0708b14ca021e38850bcbb44d3fb41072140708ff4500585b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/gstack-post.ts: 695 lines of code: lib/gstack-post.ts has 695 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":"lib/gstack-post.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab55ada68ea06392fef8dd393f5fd08c10cdd69305e9b3dee8f733824ee2d50"}},{"ruleId":"R3","level":"warning","message":{"text":"ios-qa/daemon/src/index.ts: 693 lines of code: ios-qa/daemon/src/index.ts has 693 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":"ios-qa/daemon/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4100a5532952ffc4d3ccce67890231bd6a17f13c08831cf8032281b7c31de1a9"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/harness-register.ts: 693 lines of code: lib/harness-register.ts has 693 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":"lib/harness-register.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3aff1372b2e2e62e487cdaeecf3eb30e4d139880c2539d019678f73c4b23e9e"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-receipt-depth.ts: 686 lines of code: lib/ship-receipt-depth.ts has 686 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":"lib/ship-receipt-depth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4148f7bd64fde96cf341c56abe5ef0ed42ccec9236e0fa4ecdc60df210e2f"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/eval-plan.ts: 685 lines of code: lib/eval-plan.ts has 685 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":"lib/eval-plan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deec2d1ea939d9548199d38de953e97c418e508fa1d38ba758d3a91a7b136954"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/lib/windows-curation.ts: 684 lines of code: scripts/lib/windows-curation.ts has 684 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":"scripts/lib/windows-curation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c94708644144827ba90ab0767e56895bbedc37b90e5e98978a3ec8fbcfede11"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/review-depth.ts: 683 lines of code: lib/review-depth.ts has 683 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":"lib/review-depth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3f88cef7fd54d031358d11559211143a09ad71897993dd2659ab1c8c40a8bb"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/cookie-picker-ui.ts: 679 lines of code: browse/src/cookie-picker-ui.ts has 679 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":"browse/src/cookie-picker-ui.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6abc0f69c38501933572faa06c177680a4c5ba2fa4b884325d5113e7b1a0782"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/review-ledger.ts: 677 lines of code: lib/review-ledger.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":"lib/review-ledger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff79bd334a3e106150438a7125f7525c70fe1ee3487956c3d6f33c1533fe03"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/scripts/release-cut.ts: 676 lines of code: crew/scripts/release-cut.ts has 676 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":"crew/scripts/release-cut.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5c5a04fded6686790e61c3e214a3fd436ee7a5d66bb7470d9af334acde6075"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/lib/ship-queue-train.ts: 674 lines of code: crew/lib/ship-queue-train.ts has 674 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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be25121b64d15e7a6258fb8c4bf661aaf8b3585c738a08816a98e5072e8e3d01"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/cso-eval-producer.ts: 670 lines of code: scripts/cso-eval-producer.ts has 670 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":"scripts/cso-eval-producer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5612312a5ba74e9431ef7db12e76a08ac2c038217fbc4d46025969490de1a1"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/eval-flake-rank.ts: 650 lines of code: scripts/eval-flake-rank.ts has 650 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":"scripts/eval-flake-rank.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3174362b408d4d649d12056c140041bb5c0f08cfab23d3a7a3a59f46f01a1d9d"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/pregate/checks/lanes.ts: 639 lines of code: lib/pregate/checks/lanes.ts has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1118e37c5231ab0e9560ccdd2e0a921383e3f7f1feae424a82a935673c9b4d"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/token-registry.ts: 636 lines of code: browse/src/token-registry.ts has 636 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":"browse/src/token-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d5c8d686ea480652ba90d253304eec043e9fc7ad160fdca9615be5f0126926"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/question-registry.ts: 635 lines of code: scripts/question-registry.ts has 635 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/question-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc621be026931a04506a89a82bc3eb5cfce107b38c6c3f15e2f540459e9dd37"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/headless-artifacts.ts: 629 lines of code: lib/headless-artifacts.ts has 629 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":"lib/headless-artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be6f9dbe9f2a16f1f7b1ed21b6d341010684a2842db7003b4b773ae2ff40ff6"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-budget.ts: 628 lines of code: lib/ship-budget.ts has 628 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":"lib/ship-budget.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0ef6e311f703eb017edcb7c1c7dcb678d2afa551f01eeaf7d0c9021dd870b7"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/lib/ship-queue-wave.ts: 623 lines of code: crew/lib/ship-queue-wave.ts has 623 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":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59fb1aa5172e16d38eddab08fd7263f1e34aa2eb31ac76fa8b4f2bc2d4eebd1"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/model-policy.ts: 623 lines of code: lib/model-policy.ts has 623 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":"lib/model-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2a94f5485ed4a1274d2e562e657624738a36610c1b06ecce1581856d06d4a4"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-lint/tailwind.ts: 610 lines of code: lib/design-lint/tailwind.ts has 610 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":"lib/design-lint/tailwind.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd657f0e49f6a60b3f8929ea7ba769028325d2a14c9911e6a10070dced216a83"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/skill-contract.ts: 609 lines of code: lib/skill-contract.ts has 609 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":"lib/skill-contract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6623da9d85793791ea792b71bb93804c965cb87c5b1d2c32ec5b790ab9178929"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/test-pr-profile.ts: 604 lines of code: scripts/test-pr-profile.ts has 604 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":"scripts/test-pr-profile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"465271871f07e0880039259d94184ca0ee1e51b098fb93c38ffc7acf705c37bd"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/gstack-memory-helpers.ts: 600 lines of code: lib/gstack-memory-helpers.ts has 600 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":"lib/gstack-memory-helpers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb055a80ad7c12328c09116631a7557dcb915f5cf0f7454ce76221df106f4bf"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/snapshot.ts: 597 lines of code: browse/src/snapshot.ts has 597 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":"browse/src/snapshot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2b65195a99c5278fdf312c7ec1af9772519f1069d27096239ade94a58ae09b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-queue.ts: 593 lines of code: lib/ship-queue.ts has 593 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":"lib/ship-queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e25c104c366195f6f5fb8b5065552fc802f4400cd0a1125fd7f4612b693275b"}},{"ruleId":"R3","level":"warning","message":{"text":"design/src/compare.ts: 592 lines of code: design/src/compare.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":"design/src/compare.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9423ac4fd0d3022f5d1b3db987b721a0f98472987ab93731a934f981a269a9"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/pr-dependencies.ts: 589 lines of code: scripts/pr-dependencies.ts has 589 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":"scripts/pr-dependencies.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ba49a0e6289b4246b76ea183e7b6ef3c2e4fc38da0927fdc1d2552a6862126"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/gbrain-supabase-provision.ts: 585 lines of code: lib/gbrain-supabase-provision.ts has 585 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":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92507720c34a2cc71d54e8cd7366f1426b8e421ca702a4018dc31ee4c6f56541"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/lib/gate-cost.ts: 579 lines of code: crew/lib/gate-cost.ts has 579 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":"crew/lib/gate-cost.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade8d3a7882986c77bff93bc838b50a919c7ed807288759e3d412ad38185bcc9"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/scripts/gate-cost-replay.ts: 579 lines of code: crew/scripts/gate-cost-replay.ts has 579 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":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9697905be5e5efb48d124ba7850db47f4190450d7c464e637617fbce74e68d79"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/gbrain-local-status.ts: 579 lines of code: lib/gbrain-local-status.ts has 579 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":"lib/gbrain-local-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5713d1cd02c2c4da8b18f931dd8328e13a2b596f4a52cd2204b87648de80b1c5"}},{"ruleId":"R3","level":"warning","message":{"text":"make-pdf/src/render.ts: 577 lines of code: make-pdf/src/render.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":"make-pdf/src/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f94c4f39a9ea0dfcc516cb45cd40d3f470a8520339beb8885aece25bd0af3bb"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/pr-wait.ts: 570 lines of code: lib/pr-wait.ts has 570 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":"lib/pr-wait.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20c94442b0ba1d3f19daec4afd41d46d69e34ca53bee3f5a854b7bfff3b42e6"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/resolvers/outside-voice-steps.ts: 570 lines of code: scripts/resolvers/outside-voice-steps.ts has 570 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":"scripts/resolvers/outside-voice-steps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d97e7e5105a92576fa7f89ee4db5269a2e4fe45a2e6ddca226187ae2a2e6f1"}},{"ruleId":"R3","level":"warning","message":{"text":"design/src/daemon.ts: 566 lines of code: design/src/daemon.ts has 566 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":"design/src/daemon.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30be67401fdaef72f04c64de35793fd417de4558425a7011a44238507a952a35"}},{"ruleId":"R3","level":"warning","message":{"text":"extension/background.js: 552 lines of code: extension/background.js has 552 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":"extension/background.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"852b1e1af8db03341ea5b3645ecf9c071de6bed8c0c0eb81d1e73a98793f7e8f"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/autoplan-gate.ts: 550 lines of code: lib/autoplan-gate.ts has 550 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":"lib/autoplan-gate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea756ed0173529bd5b430be844a9c26a05b630b4984a1cd3ada97710bcc096d"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/autoplan-run.ts: 546 lines of code: lib/autoplan-run.ts has 546 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":"lib/autoplan-run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f363cf2e636e8920a026d19fdb44e461a3edb60839be4f2097b04103d8ced715"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/bin-context.ts: 546 lines of code: lib/bin-context.ts has 546 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":"lib/bin-context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0674eeea629d39aa33f6537cf00fced0ecb6da821e5379a62260e19ed7de68c4"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/review-exclude.ts: 545 lines of code: lib/review-exclude.ts has 545 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":"lib/review-exclude.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11621348b16c7bca6eb2d1ca0211333d6c4fd0bfb6267caa3523322ea2f7fd13"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/stealth.ts: 543 lines of code: browse/src/stealth.ts has 543 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":"browse/src/stealth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1866bed36c746be5368cd8e65a08e0891c46c8694e29f3aed07dbc9a7fc460c"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/scripts/gate-reuse.ts: 540 lines of code: crew/scripts/gate-reuse.ts has 540 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":"crew/scripts/gate-reuse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"835e18f4e6ad237d15a1ecd458cb3a39893d107a04a033ba23f3a982d16dbc3b"}},{"ruleId":"R3","level":"warning","message":{"text":"hosts/claude/hooks/memorable-user-prompt-hook.ts: 539 lines of code: hosts/claude/hooks/memorable-user-prompt-hook.ts has 539 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef3646f0460ddbb7cf2f997a814426ea26bc41cd2157fbe0be2c3238aed23c8"}},{"ruleId":"R3","level":"warning","message":{"text":"hosts/claude/hooks/question-preference-hook.ts: 536 lines of code: hosts/claude/hooks/question-preference-hook.ts has 536 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":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354ff61d7efdc2b4aeb845f10f66e88fd7f5fde87971cce58209a1fc83aa9a01"}},{"ruleId":"R3","level":"warning","message":{"text":"crew/lib/ship-queue-train-gate.ts: 533 lines of code: crew/lib/ship-queue-train-gate.ts has 533 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":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0441b22fee09eda4074fdf8e1578d7251b076bb05131a54a08fdfd43038e4e9"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-receipt.ts: 526 lines of code: lib/ship-receipt.ts has 526 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":"lib/ship-receipt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b47a81192c080d280a1782f123043180d28e3f9cf1d3f1713b08d404cb4e3c0"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/pregate/import-graph.ts: 523 lines of code: lib/pregate/import-graph.ts has 523 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb27f3a6d4b881fb5bdd21c8176d05f10dfc3be5742dc7bf24576bf9cb2fbb0"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/pregate/index.ts: 521 lines of code: lib/pregate/index.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":"lib/pregate/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33997488393edf4c8e1087b648067ff49dc73e1517df9b68bebe96ba45e3d9c3"}},{"ruleId":"R3","level":"warning","message":{"text":"design/src/variants.ts: 519 lines of code: design/src/variants.ts has 519 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":"design/src/variants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf7ffad4cd48eaedada6e6698d4c8b296112c8ace57930149d70fee1036affa"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/resolvers/plan-gates.ts: 517 lines of code: scripts/resolvers/plan-gates.ts has 517 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/resolvers/plan-gates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"240876c0fb79b267b91a1e0de7dc7b8b3f7f631489c36bdef131b8f95a8a1dc5"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/resolvers/testing.ts: 516 lines of code: scripts/resolvers/testing.ts has 516 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":"scripts/resolvers/testing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a72f81364eac9feb0b6a321941da788968b6125d70bc53dd37d2101b0658b6"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-budget-cli.ts: 492 lines of code: lib/ship-budget-cli.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":"lib/ship-budget-cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7ec925fcbd20d034258170b8ca1a105e90c96564a2d6750cfec3e41b5632f1"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-md.ts: 490 lines of code: lib/design-md.ts has 490 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":"lib/design-md.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"533a86e8e7cdfdb4164651b880bff4f9ae947773d907ee29126d2443ccb62455"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/lib/paid-select.ts: 486 lines of code: scripts/lib/paid-select.ts has 486 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/paid-select.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5681274112de67538308570e99f425b8d66413c9129e763d324b58c1697701fc"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/dx-error-capture.ts: 480 lines of code: lib/dx-error-capture.ts has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d158eb2e9e808ec9b2fa965e8fa90c19275b84c0e09003af9a3ee9237e517e"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/memory-ingest-landing.ts: 476 lines of code: lib/memory-ingest-landing.ts has 476 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":"lib/memory-ingest-landing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed0a7fc83384b65bd408bdea04b9fb594897af59fa68d6707be1919fa55d2f8"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/review-scope.ts: 473 lines of code: lib/review-scope.ts has 473 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":"lib/review-scope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fab2e4352d068cc9d346f1be85f9c9e5fa3463a10f8dc3d543039f8fc96e51"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/admission.ts: 472 lines of code: lib/cso/admission.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":"lib/cso/admission.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9f68182dd6a8dd73824474d33f03a1e8794137e54204bf4d0061e6d2bbfaf1"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/sealed-guard.ts: 467 lines of code: lib/sealed-guard.ts has 467 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":"lib/sealed-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b75948601fe849599bc2b0b85ba7c9fb604cde676ff759271565666af6b59e2"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/gbrain-sources.ts: 455 lines of code: lib/gbrain-sources.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":"lib/gbrain-sources.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"144e1deddf22ba05e0f221e6ffbe48cf44c85123d5321a663c859bf39f3d840b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/ship-queue-land.ts: 453 lines of code: lib/ship-queue-land.ts has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d796c1ed9f15e3fdc97113411a21fc9908d3d8764ce244f621bfcc119c880268"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-lint/render-probe.ts: 451 lines of code: lib/design-lint/render-probe.ts has 451 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":"lib/design-lint/render-probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9708f677fc14b3557fb77cf86fe8df0f9481229b1a69484123bc12740fd9f41e"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-lint/render-probe-space.ts: 438 lines of code: lib/design-lint/render-probe-space.ts has 438 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":"lib/design-lint/render-probe-space.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ff55f1b0177b690127df580b464ca0911d21ac2d33a73790cc01ba773a0b6d"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/qa-evidence.ts: 438 lines of code: lib/qa-evidence.ts has 438 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":"lib/qa-evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e1e1127b20f13c9caa235d614d32f5fc85a8674b17fdabbe891538ec402abd"}},{"ruleId":"R3","level":"warning","message":{"text":"ios-qa/daemon/src/tunnel-bootstrap.ts: 436 lines of code: ios-qa/daemon/src/tunnel-bootstrap.ts has 436 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":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"487337fbf047e38f08954e127aaa6b0aec9be44a5826079f8fdcf151dbb987c4"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/design-lint/rules/type.ts: 436 lines of code: lib/design-lint/rules/type.ts has 436 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":"lib/design-lint/rules/type.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53432311d0624afb8b01d9def103d51e1060d8261a21bc58bb0a2f912a3845e"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/factory-scorecard.ts: 436 lines of code: lib/factory-scorecard.ts has 436 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":"lib/factory-scorecard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f62f244b5752f03f168f1c873c955fbc29142615bd8ba3543fe504994d066c"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/claude-journal-records.ts: 434 lines of code: lib/claude-journal-records.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":"lib/claude-journal-records.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"982f3b4494fd59174201e4880aca0ac6ee94d1a5b69e3063e9911cb9c5bd589d"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/runtime-catalog.ts: 427 lines of code: lib/cso/runtime-catalog.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":"lib/cso/runtime-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"290e471540e1801e6d21fe7443a98211bb57278eb8828af298218e9012239fe3"}},{"ruleId":"R3","level":"warning","message":{"text":"make-pdf/src/print-css.ts: 425 lines of code: make-pdf/src/print-css.ts has 425 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":"make-pdf/src/print-css.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fc1b3bb4ab8374de239ce99ad909723175704caf0239180dccfe62deddd1d2"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/autoplan-shadow.ts: 422 lines of code: lib/autoplan-shadow.ts has 422 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":"lib/autoplan-shadow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c400894e2a010cf816f89a6d93c5d6760bdece271c68f0925a7338e440bf3c92"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/test-health-report.ts: 420 lines of code: scripts/test-health-report.ts has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-health-report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e127ac6f78a14de46901dc52732fa47b0394a46783e7aeb8fa47fd8b00564ddc"}},{"ruleId":"R3","level":"warning","message":{"text":"design/src/cli.ts: 417 lines of code: design/src/cli.ts has 417 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":"design/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"757b5cb60a1a6583a30611d50b198a8235aec28c2caf94f1dba35a9f19c31e0a"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/flaky-run.ts: 417 lines of code: lib/flaky-run.ts has 417 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":"lib/flaky-run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c002b8c5ce2de5ddfc2f95b4849c91befcd9baf7b14b51d7c354d3f8cb03b75"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/cso/image-provisioning.ts: 415 lines of code: lib/cso/image-provisioning.ts has 415 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":"lib/cso/image-provisioning.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06331f2b4175471bf69442c6675d09376c9dba542cda53dc31774034f0962a54"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/lib/shard-jobs.ts: 415 lines of code: scripts/lib/shard-jobs.ts has 415 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":"scripts/lib/shard-jobs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e26ca8dde13fb742ff590f65aac78603a3a4fc308956d57271b4b5d593e725"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/browser-skill-commands.ts: 414 lines of code: browse/src/browser-skill-commands.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":"browse/src/browser-skill-commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3d7d0b5f5032f1cc3cb3635280aaf63883dd49a654b55c33db6e5bdff6a330"}},{"ruleId":"R3","level":"warning","message":{"text":"extension/inspector.js: 412 lines of code: extension/inspector.js has 412 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/inspector.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"335d7383b991c350fccdf4e4813902fad4ecf246188ade5c666fe9fecec25b0b"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/run-evidence.ts: 411 lines of code: lib/run-evidence.ts has 411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/run-evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564a022d32d7705f0323f6a19e25cf2a122160e93585048ab7e41ae803a0dd4"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/domain-skills.ts: 410 lines of code: browse/src/domain-skills.ts has 410 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":"browse/src/domain-skills.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6850ea397f2f682b87f7bd281cbe6b5136d3f41af9d70e25a92effbf84d21bd8"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/xprotect-heal.ts: 410 lines of code: browse/src/xprotect-heal.ts has 410 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":"browse/src/xprotect-heal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514ec456454700e87180fb99224203a65d82af7732f4ca40c66e49386adf12d"}},{"ruleId":"R3","level":"warning","message":{"text":"browse/src/terminal-agent-control.ts: 406 lines of code: browse/src/terminal-agent-control.ts has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebe1308a8c12fed365a95a43bd3615bedf28b62985886f2be44cdaa0b7dcfcb"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/eval-bg.ts: 405 lines of code: scripts/eval-bg.ts has 405 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval-bg.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"405dedca899ef0112b0c55437dfd18101d73d2c6a8dae7ac927c6dfb5a0db714"}},{"ruleId":"R3","level":"warning","message":{"text":"design/src/daemon-client.ts: 403 lines of code: design/src/daemon-client.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":"design/src/daemon-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8d01a515c10a335ef3834ae8e9fc73b33a2d998d939db66ce3a4df4c194bb5"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/quarantine.ts: 403 lines of code: lib/quarantine.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":"lib/quarantine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec729b722494fa7b6625687e65ab30f205b1e9d66a63503be6bf296ba9a5e2df"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/fixtures/design-lint/tailwind-fail/Hero.tsx:4 imports \u0027./cn\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/design-lint/tailwind-fail/Hero.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2982359a2cafe19c610097e39f171a7b1abfdf0b6b20ab8d81229a8f5a2f50af"}},{"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":"lib/runaway.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0123a6a64a0e4ca57f333b1c3515b6dce403106cde4136b4d52bee4ad74ee2d0"}},{"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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c357303d4a46dca361a6240ef0eb57115a0fc7bac834a27936336e3153ac69"}},{"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":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff116240d86d8f6a7fdc85a4fa78f47bc7d7f80d5ba34ba5d5e6cdc603eb2bf6"}},{"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":"supabase/functions/community-pulse/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8600324d4297c630a2be9b55667773381e58223ebcd57bcc195e682cd0603919"}},{"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":"supabase/functions/telemetry-ingest/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa79cfc2a25da74daeffa2cd1374cb77bcedd18a4224ed445ffb6cefae49e48"}},{"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":"ios-qa/daemon/src/cli-mint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc96f034972dcdb138a99e2460508a511546621fe0866ed98ad22687c792b49"}},{"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":"design/prototype.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"663ce1f09670540b963dce74daad3fbbf624863b4db1c6b9d665b4169e368f58"}},{"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":"lib/pregate/regate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a085d92d8e6fb74c0efc25d949a665225698bedb208c80b3817bc4d5ebb8620"}},{"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":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4407b35f5c4223b1b28ea90a350255cb177ef3072d99eae41f536390ea30f5"}},{"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":"test-setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40da378ddd5803be13a424cee91df40eaeca6049f42914b349e5016b8b3ec4fd"}},{"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":"browse/src/security-sidecar-entry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8ca956b93806d32c60be3c5fc81d0845c3e77171477a312a94b9616321be88"}},{"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":"lib/ship-docs-result.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc684f789dd493fc31dabe0d5c4982f1be94132e6dd962f5da6a80dda4795550"}},{"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":"extension/sender-auth.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde67c7fd2e5f56bf928274e43beacd204bff54aeadfd1b9d86b99b310ab95ab"}},{"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":"lib/review-targeted-delta.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc2ba102889d8316af652e2b50ca7f3b4e35561ed6b7f6afe7a2c7e1b3ff6ee"}},{"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":"lib/remote-gate-stand-in.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"796b6fb0b608df8bd59cd0d742866408db07f4da6d3504ea5c6c943a73f76c54"}},{"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":"supabase/functions/update-check/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b373f73cae31d7f4a5017c47d19d36ed686db0fc5cfd947b794042b000ae5c7"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but test/fixtures/design-lint/tailwind-fail/Hero.tsx cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/design-lint/tailwind-fail/Hero.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2afce9d904a53b5655e4f3542b3b1099882f64d96f4ed003ea944a53a439b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~829 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/ship-release.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b12e3a8228ad47aeefdb637877e87c3b8a632756d8e1c712e81fabe43e325b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~312 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/runaway.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2c83cebbda70d2d3903fdc0633118f766d8753f6b212ee09e22608010d248c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~296 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/ship-queue-land-direct.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476830704fc59c64afaec547f48ee94a072ca5f663dfaf41614d61824f2542dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~278 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/ship-preflight.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef264bc6fc5ce8992aa7cc31032f0e5b2e32cdd92c389e78a901374e720603a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~149 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"ios-qa/daemon/src/cli-mint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1965acb11b9be4abf0137c6417626aa2d1a67ca4a3b6061101aa661335cf3c0b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~134 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/pregate/regate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a681a3fd9c3ba6d7d8574ec8451907fd59c89c5f9e11f3ec5e0eac510525dba0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~132 LoC): no import path from any entry point (999 application, 82 tooling, 2110 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/modules-cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1149212d25f6b2513f8c8e5ef5b419d7075a4c927ada7eb5f8e12282f4696634"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~128 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/autoplan-shadow-reader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1a32cf730608d987302a510c13bc97022e7601618b9b39d5296161ad5d0702"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~128 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"test-setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fce111d567ae2a4023ba4d3cd46b47750b51373f28a9467c4f446be2526f7b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~115 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/ship-docs-result.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89918c90394d5dbb27b8fcc154ce305e2d0b3f193e3b2ba5a15a69ae03010397"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/review-targeted-delta.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a5e5032a515ee9350c247309a9ae2c9980f933edf59b3f40db8b8ff5eccefb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/autoplan-admission.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4694812a3ff3f2afb4e1e60f8048102c9bccc7d2720d3882c316731605ea8a2f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (999 application, 82 tooling, 2110 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":"lib/remote-gate-stand-in.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d5b76a6789b57ff1d964928700b9c61ee0c4f860b1f43e20fbc3e64b1c1ef5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027installApp\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c75bb1cea8ae6d45d0bc4cfec5462aed162150fe55fd27f27ad906e2ec8262"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ProxyError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/proxy.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7489298b2b315233733ed2812d1f8ab3d16adb6e9cfbd72e37d3301c398f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027spawnAndWaitReady\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8bf0e4c40e548d05bfa182d4db86ea8f2a2a1bdd7df7c14e024f9c24bec2fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027approvalForReceipt\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-citations.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e8dc23ade586513c56d22cf4936b3750992c6b8598ba6fc012f99eb6ecf612"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027exampleApprovalClassesJson\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"614ac5e8b900d8dbaa69745420e64be41f87ce29ff7a3725798c6fc4e6dc8a5a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadWorkingApprovalClasses\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd699c7fa4c025c4ef2da5b2ccd8b870a84f22c44b03e1dbe5f78320b50a2bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderApprovalScan\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-classes.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8845883df0536b6b230cc6ab1812540b26f35300e3718fad9a664d49fce6b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027branchExists\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b76c8e8c6540a9e7f8fd141ccc7266a1f1e9a4db253e36478b5a96c46de8fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027syncRecord\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16fea7073496052a3d055af34c469397acd8e77b5bb5a7e74549937fbe85496"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027repoVisibility\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51c7617820d69cea27bca3fb5b6531b27a6d389ef51726228a0f1d0a843f2b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderMode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed701ffbbdc9cb67503fcbea75218ea76c75cd944629fab71cd5ccaab9806f13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkCeoOnlyFlags\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-ceo-only.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3518b8bf0911d3329f9e6aee67a8e318647af1a90dcd864e254620d2ee4329a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027refuseCeoOnly\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-ceo-only.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bd9d44b42a73169305cdbd7a57b1fbac36bf0d363271d7adb2675dbb6c8abd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkpointRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"106704a16c50db0b7da9e3ab2d47b28e98f5910a1cbae10a4e3233112bdb757c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkpointLines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"93942bf0bf956dca0314940bb13bcfebc84e651c8debd1780dbd840f026b7376"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027restoreCheckpoint\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5479b16c0b53a746bde15839060556ed798c5d2bdaf61c7e4396a5a41a3cf32"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027dispatchLine\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-export.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"616915be0706e8e35e055da26121995b3072adebcb6ffb4127cc26b37d75f45a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027gateCostPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate-cost.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4772c8843db3fe925a355375cf1b36ecb21feb7b6cbd65409013f025bed3919a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recommendGate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-gate.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e784e0ee448f2a815f94cb08f50f66b19f77d9e83dd6f75b9c18e5811f8cc1b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027migrateRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-migrate.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53e1fc64b74da3730093667d5ac74eab1fdba8c0a24d3571d4266218d1e3b10"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027reviseRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-revise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c32dc32e0eb976f723e7cf77f26639260bb240dee4d5fc917d667a1aef777ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027initRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0916f9c983ee388cc090872c3328f3afd20ef40dee11abec0794344af419868d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027nextStep\u0027: Nothing imports THIS copy of \u0027nextStep\u0027 \u2014 but lib/review-depth.ts:409 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep lib/review-depth.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a825bfaa53734043e87f593155c69c200fda0327227b3c6737472abc812f21d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027submitResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63da6262b8f00ff430b6236edbb87780f2da7dd236dbd4df0afcdf346b5591d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fitReservation\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b8cb9940843da6920b8ed70d8c269ba15e6be08aef00c7dece4c1ca625a8fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027markSent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ebd4e92089d061546e535fcab82c4a8ccca9155e6a5f601a28e29862bc194"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027retireAttempt\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f582e0a54ad77f27611e46c80064a8f72ad7dba0f20d757383dccbd6cb7226"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027markOutside\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d00709e1811f1f1c91e467718ba82530874c53b1c7ca732f3dbb5cc65ede8e7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resumeRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"55443d406ad14cebb688774f74dcc4c0dce57c73b7f02af93d25c35fd00d84ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027statusLines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6152d5eda0230be797cca33a2bb0e9fd2e03299201830f5120b2e292640410"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TERMINAL\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0b3c8b5bd64dd8afe88dcb597ded5f33148b6d65d191a4d670f1eddc5b2056"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadBannedTerms\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/banned-terms.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a731899baacb22a0b3065fd4906b9ba9b7049ddf27e4207a81ec48e378502b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027wholeFiles\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/banned-terms.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e8612ef5a0bf24223d19aa87fd4c911b7288a8b68fb86fbdbb298fb6c43cbc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027classifyLines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/base-red.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c39255a484f0c07bd07d5e3f9bb3cc0e5caef41b7be944ada52288532a10e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027gitBranch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bef0857b82ac93f716a48128a1654078458b2d16308d5992659edd7f225031"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027flagValue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b949353707ed678cd6c0f87c465ca7e0aba8885ceba4582ca3bb7981c38128c4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_FRAGMENT_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/changelog-fragments.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9116d083fb969c0a7affef3d37c1a8e281cf96579052524bdd6d0f65ce6015e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isTrusted\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1cc2b6afcfde53cbc1057ab7a9dd33c72d96540c00f7eb0bc18c2ebd1132df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recordTrust\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dc93e43eb62cd98d5c4408a2121180dcb780a4615a8298cbfe4f877ca6966f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027load\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d155c592528f02150ba3e7b41b259eb29be1630aab4060d47c350a18ec3b1d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027nothingToRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fe28d07f44bf356f02d201146c8f3080f4983ef1eb0373e873451e4339dd29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runChecks\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb4b4d5a908b7dc70a9b6d6dbe4a2edaa53f93b9daccfe8b4c178d6521111e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027status\u0027: Nothing imports THIS copy of \u0027status\u0027 \u2014 but lib/harness-register.ts:738 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep lib/harness-register.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"701ee70e0217b0ebcab81492e4a79cb29b50e5d128043cad29168447b0fdaf22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OPTIONAL_CAPABILITIES\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in lib/code-intelligence/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 lib/code-intelligence/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/contract.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8331e32aa21f4918f87107db1809847cf15faaed47147c369b491778918f2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SCAN_UNTRUSTED_PATHS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-detect-contract.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3638e911bc50d7cca4bceed3b3f89beec994f33eb9b89f255e14bcf8ecb3268d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ruleTable\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/report.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd39352651ecbd6d29814db218e86f9e90e14c0da288e9e14caaff97d35c876"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WAIVER_MIN_REASON\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/waivers.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5eba382e7f0da274fff04592f98a7e9a6e3370c5cf5b424289abf24de89016"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WAIVER_MAX\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/waivers.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6eb3d551a37aabd457f017ffccceab2ec5384b72ab59dda6119226f3f5735b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TOKEN_REF_MAX_HOPS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b531a881bf8b7e8cbdb836b89e52843acd3f2878f7676b58e61265bc7656b96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DOCS_ONLY_ERROR\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs-only.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a82bfc8dc4f2682d602ba50cce41ae04a1840362e53a61b28f02e99fdab1299"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DOCS_ONLY_ANCHOR\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/docs-only.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53a4136081ff72eca0725969bebff70dd8111d10ca73117f9212e5fbb70fda9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027dxErrorCaptureMain\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a57ebc1bfb72cf274a7e059ab8c621bece6b2f0f581bc6ecc7effc2bf43058b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkModelRules\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-models.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54805c539a389d782282693ffb10549dd14440988c3ae45e1e4ecb67710d6aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runPreregDiagnostics\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9840137562dcc47a2e04206e6a7f8ed5e5e38dbc9a06a9d2d5990d35fef48f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderPreregDiagnostics\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"180c4d090909cbad47ab57f091398df6251ea3e8c9e1b0dbaed094b034860974"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027releasePilot\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586266f2e8ec7cf7c948a1ce916a519c3ba36853a567520b4a9c42151c687cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolvePlanSource\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"deab70609588b7c35142bd752bde60149062a328394a78833864c6bc40826b2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027priceGate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c45175c1136a4aaaf5881ea1dbbe267271616e532e191888123ee7b655288"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderGatePrice\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e1baa661c396415525e33d440827a7bb0b37b4d1e4f875da54964d04d90c4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027LOCKFILES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b985dc45a73de278a6f916bf78b4083a4c2247ef94880ed0009a442422bf18a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PIN_FILES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba9c8cee8d528440f329ff3371bbaf22beeba3c426da9e9cac9120dc65e9817"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildBundle\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38a5ffed48c5d2547bda32a2b79ed312b4ba7ef2901196b7c4aeb8b32c00afd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkAncestors\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/evidence-bundle.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d240d1960599f2e776d31fa3c056abd6d4ebccc2814502422f7efd80b84ebb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ghSource\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ade00dda98622d30c9e4e0f9caf9dc1249224ff573041e07b374d9786044190"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_MAX_RERUNS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/flaky-run.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"906fdb73910fe93a523f3aef99e1d1ba84211c703fee6addd6f15ecbeb9ca35d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027defaultBase\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f53d0db5549f688d600df3b4b31a295462dde009053ad05121b82b773b51c64"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027baseArg\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7133eca6074d4103ab8679647ff96f9ac8781a86aaaecb669ea0751d05c342d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027headSha\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe952ebf4e597ddc493cf858fa676dba4230f0f5f1c069ad2c2d244f2ee09b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027diffWorkingTree\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"749c75471d51a38baa6a5b973f835ba0645f3466887c37130e052d0083da632d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027untrackedAsAdded\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5555945cf6ce860e43c610ec1d240e60f54a861a95944900e07bac64b93a31f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027commitsInRange\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/git.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7121651950fc35a41ac13c8c8403c36b678b5a362bfbb61b49ffbeb5eecc810d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderDiagnostics\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-diff/render.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b15004905f8fbbc6197df974187d4d08b971229aee5c267afa3ce360f485066"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GATE_DISPOSITION_SCOPE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d912d9a074027c7815c18e1b3b5ba1f98bd0fa5401c01b4e0b1374d942efe8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recordGateDisposition\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9540321674d42d93ab069821c4d35b1c654cb75b07990ea7a72ae95840d315a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027showDispositioned\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b4ef7e03f337ffa8c9c65f96127719270e0852e18f3e7bc27c745626048fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027spawnGbrainAsync\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-exec.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd51f641f2bedcd523ad9171f819608e6953554a9261ca633e7b9f049e887391"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027repoPolicyStorePath\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e83a0d3dcbd518309c0a78ba24f6ba739de2785567d10dc982e9889d3a5dcb6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027constrainSourceId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c25b78de662601148e72a30aea9fbf67c840b67f07ac0442b8e42a82a5c433"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027qmLedgerFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-qm.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d4f5a6289e9c051c8f1b6ca776be8e7e5fd2586e21bf633d717d883e043e9d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027printPayload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad25ef7279c473d9efa6bd7deb0f524d434d60d768e160457c8926f51adbe82"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027exitTableHelp\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff814a87014faf1c49ca940c567a235827459d5b84f1f74b077dbc2970227c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildInventory\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inventory.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b390efe221715964a3cac5735935e9afe68ff5c6f80c7e42c3d10bcb0a913a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderInventory\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inventory.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"63362957e01d38e8788a3acb271e9556895d6cbf41b9d0523ecf850eb33b964e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027receiptIssues\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/issue-links.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"deea19ba1d30e288a19ac6e1b29db31c908ec7bd0d5d9f66085e00b305f0167b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_RECONCILE_LIMIT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd2d371654fea87e0b998d8f30b16eddda480ba1bba9c61b1d0f7643cc611f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BISECT_AFTER_REFUSALS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b6f2925909d68011410c649b8bbf4eced550acfaf5f471e905ff3cbb6396ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TRANSITIONS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"32458a65d676ecb8dd4a8275977d8477d3380b6199d33e5078bdf3b55c6878b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isRetryable\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b3e185ca106547969d924b8a77de06fee2436b9f1d40d2d1f175d8560d2683"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadStateFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"176dcf535a710d30b52a91183a7fd9f0f524b16df51228f67c488df7a0726413"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseImportReport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5493007d5ea77dd36e4b600fbd29cbe8064e438f471adf28564ae6097cf32cc2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FRESHNESS_SCHEMA_VERSION\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-freshness.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"67383ee4b4db9b2622aa8559aae696c2517cb723f761002fb63303bcaa8e68d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CAPTURE_USAGE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/motion-capture.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee47ed1a1fc1886992a0f859b1f136ad102e704ecd02b94dcd620ad38691921"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ledgerPath\u0027: Nothing imports THIS copy of \u0027ledgerPath\u0027 \u2014 but lib/flaky-run.ts:417 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep lib/flaky-run.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e322109d891395bafabe039895f280c6532f44e9f54acfef6533c627f2bda648"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadOfficeHoursReviews\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/office-hours-review.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6400ad4f49a7c4ca11949bf2ceaa429a92e8556a77863be56abf6ebee723c94f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027apiTimeoutMs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-api.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"888f413008e5aba37fba070d98d7a23cac454c327cc340e60deff70d66fb2fcc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027API_FAMILIES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-api.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"93642627795e0e854fea1ef87200ee66b2d2613c7cf6cb248cd09bf1e24d1409"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027outsideStatusLine\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-voice-runner.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e2a0771889b13efdf9d095cf655ea6c7b15dd028379f0054dc8d099b06577d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027defaultRoots\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-reality-receipts.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d8cb6b8484d5599de976f7cdaf7ce1df241960d94f5a05470c2b7170769d18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readCapture\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284c478a1337e4212fa489d56d99d9e0a620b2339b07b43481c932c84a6eba1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027defaultBase\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c186694ee7ce50e3e551ee90fdc21d8f9a08533604c322fc98d884cd431d8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027scanSides\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-shots.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"008eaefe8aeff0131bf87af393e3d4aa220bf7b18e2daa8079801e57fbc2be79"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027explainConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"26105cf66f85580931f6180f926bb444f85b58feac82ff1909ed392c996057f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadedDotenvFiles\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/context.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f943ff2c59ba0e665d457cee73525beb799c2c320d3537d73f11193ab1dddd9e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027approvalGrants\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f39f55b00eac5ac3aae5d09655e69054a415cd017839a5a909f589e6bdf2f6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027describeExceptions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/flaky-exception.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c4460a9bf44e5f26939f86ed5b9de11f2a8fc4c7d6db4fbc57116022ab50e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isTest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/lane-selection.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf22dd0bccf4ad1345b7c7d61ed3d2cd6b8828a26390056fab23c640da110d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cancelActive\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"18acdfea740d1c7ab2b5afdcf2cdc164265add42b4d1cac492f829a27f112e5a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CheckStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/types.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8bc1f0a0836e13a0d311a5ecac3b166f9bf3491ed1032b5580282ae86db428"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027describeLane\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/workflows.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"91103d1ddb09469f9bf2c9e68552fee7dbf7aa3bcfbc1632c5aa64c86580530f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027lintFiles\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/prose-lint.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0a8393d7f80d3c0d67cfafddbac75ac8d5a227d4bc69ee6238523c754d2743"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027qaDeadlineMain\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-deadline.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"be98665365ba5b052b25b168148be091da27ff075973b7153affca7f5a481811"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027qaEvidenceMain\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca3a8c54d82b67a81972d887aa57c611632fd80e4acd6f8deeeb9dbc2353ea0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027quarantineMain\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/quarantine.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae93a4d14f0bfabbe46bdbd7f80a26c7ece5fd9f65b9fd01a74cb5c984dab8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027exampleRegistryJson\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"db41624259878222f5ad6e03ee6ea7e982deb5c05e6b1817ff2fa1532d8f20ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027main\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7cd9a799f28749d4c16326310989d9cdd6d59e6faddb18d3a3793953dbd1c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CONSUMER_SCAN_DEPTH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6795660d36bb8017094fb6f24c3252f6bdd69b5202ac74f15d2081aba3371b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027reviewPlanTimeoutMs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"00495cde864a3e9129f65452fdea886ea3421621970f53297ffe4c4c362bea4f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027keepCommand\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"292d99ed372c811b6f094b1236ae46afeb968b4650397e99d440326b97d46735"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027reviewDepthLine\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-depth.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"690249f9d0c7a7d94bedb88b532825c58b1cf7d51bb8221e9e54b0ca9893744d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkSharedLibsReuse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd233d22309418ec2c4574018ea515ac303add69c226e6d07c1e76c73a71fab5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027captureReviewStart\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c772548ce207dc30375338d3ef63a5df2970144a0a39ad74ed955fec886329"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027excludeLines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33ebc076b81be2d0287b851a36e17eff8d42d0d74b3a1c406aa44148b310f6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027disclosureLine\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"193db1d435ef68ee09b42cdf8dead543ca3c8ce912e69c6604c315c1bfa9f01c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseTail\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"945c58f79b3c4992fa1a6b525d3204d683428d8a487d10c942be7e6ce644d3d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ceilingContext\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-exclude.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54f9b5766258e2c05c645acba8bec86224f2fa8e6d7db07f87aa33790f225a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readersLine\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb30846d184bdde6f94d733864d2b6070bc80505e28e93bb41112f435497d89"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027eventsDigest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-fetch.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37080f43fbcfce0560ecb6304bdaf79900be03e111a8a5aa63ccc97e1ed228e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027withAuditModel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52c2d82183d58781fd7773c53a9000336dab2608da3b45a95b1aa23266b6a45"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027manifestPath\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ab4dcd7a79c5fa7d3da76cee24070e0538bce211146a9c7f2f5297d99adc58"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readManifest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e56d69e40f1e922b18e10b707a061de8a1ccb688c8eb010b236ed471223fa6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027writeManifest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"feffa7ffc0f8fcb4b6216b9c4c5493325ef0f14017bccc52394049035251eaf8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sentFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb78ad3b54f545bfe65a0c509aef0f5eda214e64371aedec372317041cf6f06"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027outputFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-pass.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca6e767ce3061c059b2bea6b897880e604bcc5a2465154ad0c4463053b1da2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027mayExclude\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-selection.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffd787baf36d2379d2dbb15350d727139d474b82305ad2e50263a03b62e3d68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SWEEP_MAX_ENTRIES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b287f08b61b25945aae6338bc19043cd71e5ea183fc054ff4426a7bae2e8a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027defaultRoots\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6129cd6df59a9ea3741448dbde6359ea86feb657222f4b5fed9614fb4ec48c54"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027rerunBlocked\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e77e420701a47ea9f43e5b2541f852cb20c3c68325681b1aed91e86547e5ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RULED_NOTE_SCOPE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruled-notes.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"355c028685e3620989f9048d56c1b473e1403e60bdb73798582371cbdb7c1f5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ruledNoteRow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruled-notes.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ebf350f6dad3ed0b64508fdd21b2476667906fcaeca8c377240955c11591bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027openShipRun\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruled-notes.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75eabbd741cc89c0bb7a68c9d530808a3c1a3aecb2c6883dccc1001655f0563"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027publishedCommits\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab8be4bed929630a9eef1c8b7c4e5d4984400f86635b5efd3c2a68535862129"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027rangeCommits\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eff4790a007028e5a362b21ad5f55af11c35aa1f67cd5a7a031083e862537e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdStart\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e9a45c38a38a6ecc1f68013a1cf247665279de54e3a6aaaead163dee01fc8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdCheck\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b367e2899cab0b0ff1b14717c41dd360c63a7eefa8a4e092656984c0b11a478e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdSettle\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e44812dea50e941c6dc1e2a5113d0c57bdc4c5feafd2f540a783be052f8d076"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdClose\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1412abc3d4b3c2fb87044b3013d9e3fce57587351817b695984f8a0fc2ebd12"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdNote\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4209a023408c19e4db35733738262fa09119e8c76f20de066baff75f6e4903b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdCalls\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e124408e6580eea288ed7baafa5b1f668b89c0391999cdccd5b8acec103322a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdResume\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81c63c1f7d690caca5098c2599f22e1c96be67f95ceea16560c8eb6eb246336"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027admitReviewStart\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16c9eb01fe2ad6a3f000459eb6c1a604cea9438a6e427c3bb3abc3db05c010e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027settleReviewFinish\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf13e8301987e6f6305844a9ef22f2cb226b31fad2fe4595f45238c0cb6acb3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027logShipCall\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-call-log.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d237e2ee87944a56204019cb959b502f6a895c51d3f3d6c7eb0739084cbe4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdHandoff\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"869ef223b68370fd95b5ea8cbab4d32f7bb758f0106899a47ee22dfc0e206196"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdVerifyHandoff\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f7c697f85de9f14b665cfa939325155db58d6c7b78a23e5e1af66205b78543"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdReturn\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16456c0904f41bd7623657919ddd11e486ece43fa8754e01a3869678786b260"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdReconcile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a66976788a9b40ff2763585cefaea30f0404ff5b74af3410e202d438f7ad05"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027cmdLaunch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-handoff.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b6c3b7837d4495babc1d243f858272d60f1b74dcc54c02a29a1243f9dc5d05"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027shipParts\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-parts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e549cc4fa5db9250da4136dde2aedc2ed6efaad2e77549e477d205b47d0444d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BOUNDED_LINES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-patch.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"02578bff488e7dfd4e70786038fad549f2bdd8d0f8a1303a73521c155dbf38ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027declaresReaders\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy-readers.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae4ad97bffd14bf627ad29313e925a628621d82bb1a02e317f94c6d33a38790"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027examplePolicyJson\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4c7e72a807e5a605f2a847860d2b144ea2edf2f1d3cdce2528cc5b7f395133"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027explainPolicy\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"582c0dc94f7504fba3b8880d87be31ebfc7366b69c3a3c785ca0f5939979ae4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderEffective\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"991624996a2d1b850f21b8c312f10a6f3be08eabf556dd819662b2367818cf24"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027stampFilesInTree\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"db13e1fdd5a361438781e7cc6860f9b64089b12185bf55dec5f970e122f427e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_RESTAMPS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bd74fdff503a6ae8e7f37c87d399aba6d7d31f5fba422f3e014d1b6e858e06"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027census\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a8073654f9a4ae996da3f2426f858dd469f7e56bd60ae00c5aef9f95be3249"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027land\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue-land.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"88be1fd6b78130c202ff514ff8412a00c72e590fd68712c73fdcc648a986ad6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027stamp\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"42460aa25a31ed7646b7b12b6502ed7b8a50204d78043edfb233a1db012f3bd3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027verify\u0027: Nothing imports THIS copy of \u0027verify\u0027 \u2014 but lib/review-ledger.ts:566 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep lib/review-ledger.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ff7003e7e6931a8f82df10a70fd7e55e34ad8c471a1a4b6283192bc77ef92f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027deeper\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"485962981e1fd536515caa3649bd26efb26f544ada99fbf0fc54f6055379a967"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027writeExcludeBinds\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e810d5aadf0fc01857a312312ddd004c140464b2fcc96c39f94290cba36978"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027receiptIssuesFrom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5c76ae1434ad2d1b1c479eec8cab535192bd3232757a1f978464aad28c3c81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderCensus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a23cfbe30531087cda900a6f09d19306bb3359277cfd4f16d3b80769d53897"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolveSkill\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-bill.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a8b376c1204074f748ba706b5f8c1ebfcc663022951389fb3c99eb393805a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readAllRecords\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff8a205128573c8ff8d89a0ef5a6c8c2aa47e7596ea807ffec218eb21b5beb7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isOwnedStagingDir\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/staging-guard.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2672d49296a78b8287265495d21ad1af70e7b878cb5da2fbdc1308503e2a45"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderStateMatrixCheck\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/state-matrix.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2744ee8a39173385b0a1f1ae5dba2cef71c59aad8a0aaa6e90035cc1cd81f99c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027rowsFileName\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tasks-prior.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c573b946c5c18e76abf992ea465377fdfd14ab5dfbdca9012e050046c3d803"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TEST_LANE_EXCEPTION_SCOPE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-lane-exception.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e574856b3a0fce914fa77362d67653e8e91e7e8232dc60dbb8880ad335ee0423"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027readTestLaneExceptions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/test-lane-exception.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de7f81bb7b576d903b013fc2d4c8f9424ad82017f747f2f13f091b56bbb0e93"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fromGateAhead\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"91885b327279ed7b2096e583bfabc04b8a7adb1e367b2c226c429c44f7c00398"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderReceipt\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da8adb460a6d8443854cbfb6067191a7f6382bfc1accf98bf00838bbd3747e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027noVersionNotice\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/version-source.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"787b4b5067f19b4a3dc3d3157d096c3f2831cd843634759d395c20e5558aee20"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolveVersionSource\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/version-source.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8e40b1fd129945076db2a01afb89390173c42f29e170f8151ee23fdca7277c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027REUSE_LOOKUPS_MAX\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/ci-history.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c84a3a4a2211643b73fd28283e601537e9b806d7b9e52acc1acba2a3c732887"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SIGNAL_MAP_VERSION\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/psychographic-signals.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c167ee8266a2947932be00e0ad84be8c586632be1d1e9bcf338f211dbdaab981"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SkillKey\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":"browse/src/domain-skills.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a770dfee0f790c028facb2e8531297f67895fc9120d2962fb4a3b5f7740d6713"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027batch\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":"browse/test/batch.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beaabae52a4150634819a810ffce45eb9337d493136384ca19db46f23dacf7c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sliceBetween\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":"browse/test/server-pty-lease-routes.test.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cc8b7a933f9473e28776265d69d19879203610a9960f8ee0e3fa69d05cd73b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ExtractedQuestion\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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0817269c00628a88656f52c9f97c76b79ce26652269a691be5772f6e634b413a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CONTENT_SCOPE\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":"lib/autoplan-gate.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22c28ce0a45f5425f27169ed48220db19b1d0aa23870da7ea889fbfa539f415"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027clip\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":"lib/captain-brief.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"362589ff6253914975f998db1547c577d91ccbeaecc0f0d96e0c1ff52d9ef970"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027runExecutionDeadline\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0ffe88e98854af06b37c42c52ac2f1af1f5fb603766231c03e79938ba1c734"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027isAdvisory\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"887b8174a6152e395d258767b415acb759fba6e11dcbaaa8b34e6a97832d5e37"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027closeContent\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":"test/autoplan-phase-order.test.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5403e3c8c1c1dca32e5dc7606ea25890672b05e860b44e13f816ce4e363f1811"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027handoff\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":"test/design-completion-handoff-scored.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31fad424b61b0b990e46be366fd895d859c5c1d377d70a2bd0a9395e87db9c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027exists\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":"test/egress-receipt-wiring.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26168589b53d03f03b3695a64b337a1abac2dbdfd31f16ed0e33db0e017c00b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027response\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":"test/eng-semantic-terminal.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"386c9eed6d9f169f6260d493825bf3f85ec71014a21dd4929a0da2de5468e97f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027gitStatus\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":"test/gstack-ff-update.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"228fef5fe61c31f180e995c88681127551842f0fa7f3332464b8d2546d72cdd2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FORBIDDEN_PATTERNS\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":"test/post-rename-doc-regen.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e608eab53366777a25e75a64135d7f77f3fe531c0c6a1ab949059a54f42ede3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027lines\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":"test/pregate-remote-gate-runs.test.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b6ce725b815a5a8810c9554d534ce290adc53f0b6875121e3a86015ac4c3d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PHASE\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":"test/review-checklists.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8d9c38d01d1b6c32d8012109d0b10c5c51307ccf7f862b320e2ab857c064be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027N\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":"test/review-risk-linear.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ae068747a3bd649707452cc7a7bd7e3ae8a29343d71a1d1af380681852f401"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027interactive\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":"test/shared-libs-fixture.test.ts"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d354be229ed4e39da1d69b3b6c25a5edf9a0794e51ce7a21e1ecd72c0969fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sliceBetween\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":"test/skill-cross-model-recommendation-emit.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b42a26168936736e481baa3535e6d10462e061f65eb265cb81257ae14daec6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PROS_CONS_HEADER_RE\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":"test/skill-e2e-plan-format.test.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd76746d6ecce4d3b1d590826cb0c68d558c2503d30d9ca9cca881e95fb54fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PRO_BULLET_RE\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":"test/skill-e2e-plan-format.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d0d3de355539b00490eee571602e95ecc213d2d79b967491645eaaa067893d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CON_BULLET_RE\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":"test/skill-e2e-plan-format.test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6244b0af588f5a898499bb65940e613d25edc1a8d8c0b767967b5f2135e17fae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NET_LINE_RE\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":"test/skill-e2e-plan-format.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"764f9b2737072a6883c7193c79e7a39e4f9a61e93693b11dd33af548eef3ddc2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D_NUMBER_RE\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":"test/skill-e2e-plan-format.test.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c404620da4eccaaa7957bd6388c718a91cc7f58784be7d673cbfb4fbcf3bd4ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027STAKES_RE\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":"test/skill-e2e-plan-format.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae564ce2608742c7a9c8f3e830985805c136064db58ad1a1bfacf1f84fc046db"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027adm-zip\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/dependency-security.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2543d1076324244192038b821866ad6eec6d1b425d09480ce725b4f7e3e9a26"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027xterm-addon-fit\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8bb9845aa502894568c358ccb4fad9d0132d7eae4465f6a0c22293362d0c8f76"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react\u0027: Declared in lib/diagram-render/package.json but never imported anywhere in that package or its workspace members \u2014 while test/fixtures/design-lint/tailwind-pass/Hero.tsx DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"687797ac2ae17e2e50815962d76db94ad43b636d944176d3065b34d20c17e346"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): crew/lib/ship-queue-train-gate.ts \u2192 crew/lib/ship-queue-train.ts \u2192 crew/lib/ship-queue-train-gate.ts (one verified cycle inside a mutually-dependent group of 4 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea2368df2cde21a041de0299f11c92fe481eafd1dc7d7f8a4c87b8bd46d2f7b"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): crew/lib/version-gate-train.ts \u2192 lib/release-stamp.ts \u2192 crew/lib/version-gate-train.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/version-gate-train.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf9bca79e0b67f2c9dbc45112e33eb8b043c49756f8159dadc6d1052323c06c"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): lib/autoplan-state.ts \u2192 lib/autoplan-carry.ts \u2192 lib/autoplan-budget.ts \u2192 lib/autoplan-confirm.ts \u2192 lib/autoplan-state.ts (one verified cycle inside a mutually-dependent group of 18 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-state.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a58e133b0bb2def4e1817cf4909943007803ad495d23e17fc535f61f19e2ebc"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): lib/gbrain-guards.ts \u2192 lib/gbrain-sources.ts \u2192 lib/gbrain-guards.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-guards.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9358e5ab5ea0836a0e49b6bd07094c24a97ddd68912013c2b564aef848161b71"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): lib/pregate/checks/lanes.ts \u2192 lib/pregate/starter.ts \u2192 lib/pregate/init-draft.ts \u2192 lib/pregate/checks/lanes.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5add4b77dddb7f76944b62c5c630f05d455e21135c402d84a140da44aa14f1"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): lib/ship-policy-bookkeeping.ts \u2192 lib/ship-policy.ts \u2192 lib/ship-policy-bookkeeping.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-policy-bookkeeping.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac0a6566f0525cefb9d76d515068d70ed6fbef5daef3c4c8a4f2ec5d02ffa2c"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): scripts/exercised-map.ts \u2192 scripts/test-paid-shards.ts \u2192 scripts/lib/paid-report.ts \u2192 scripts/exercised-map.ts (one verified cycle inside a mutually-dependent group of 4 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/exercised-map.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5756db69370b5f64cdef9e2ffb4891aa592fc92040b7cd2c48f2c6b0842d500"}},{"ruleId":"S1","level":"error","message":{"text":"Cryptographic key material is a compile-time constant: The value is the key-derivation salt and is a compile-time constant, so the secret this operation depends on is published with the source. A key that ships with the source is not secret: every contributor, fork, mirror and released binary carries it, so anyone holding the repository can decrypt what any installation encrypted, and there is no way to invalidate what was already protected because every deployment built from this source shares the value. Where the constant is a password salt the consequence differs but is no smaller \u2014 one global salt means precomputation amortises across every installation, which is the property salting exists to destroy. Read the value from configuration, an environment variable or a secrets manager at startup and FAIL FAST when it is absent, so a missing key stops the process instead of silently falling back to a shared default; treat the committed value as disclosed and rotate it rather than only deleting the line. For a salt, generate a fresh random one per password and store it alongside the hash."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fab5511cb975181f4197f694fb79170dc60deca9406d59242fde2b8be0d04b"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"525b2184dd6de11a4178541e643bc2843a1bc2eb991ce54e843f6109b872b73a"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b08ac249b42b98de41775971f1377cc8b4e233139715ef03d49a17fbdf52136"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"45db3f911cfb076f69ac6735a8036dcb08d4a1c81b0426d283cfe799314cefbd"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc517c09ff2a6fa9b1db3cae92c4ffd18559fcaae178d19e0fdf672d9b60253"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060createHash(\u0022sha256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-depth.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"579a6b47a9008c68781131b83ccedc559af13368d23ee045655a77bcb4bc7860"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060server.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/bun-polyfill.cjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"19962075c2a271258572edb9ceb7757743165f0def7ae94d9ba8bc27669b8ba3"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060srv.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/port-allocator.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa5c5de789486ad9799fcfb27e8ffe920c05e8d4710697d7f84ecedcce16db6"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060server.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602a72b169ab55d5bd80ab29358da179de17d8b4c6385b41b1b83a702e8eb94"}},{"ruleId":"S1","level":"warning","message":{"text":"Secure cookie flags not detected: The \u0060gstack_picker\u0060 cookie (\u0060Set-Cookie\u0060 header) carries who is signed in, and it is set without Secure. Without Secure the browser also sends it over plain http://, where anyone on the same network can read it. (\u22121.5 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e033b424414abb2c5b0dc61187df733dcc40e911f5457a41ac227f4074c27df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!value \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 lib/model-policy-freshness-github.ts, scripts/cso-image-matrix.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":"lib/model-policy-freshness-github.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a925d158ccd946c326ef4db64d97913bac130ccc945f33b53fa3630c919b6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(e instanceof TypeError) \u0026\u0026 !(e instanceof DOMException)\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa340621563e3ce9f8d0aee5b0a3c30a3ddfbd8afbe081c7038290bf9dd06368"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(data.cookies) || !Array.isArray(data.pages)\u0060 appears character-identically in 2 files \u2014 browse/src/meta-commands.ts, browse/src/session-persist.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":"browse/src/meta-commands.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ee8187b386f55b336871cb6db86ea4ca5984651d9ef1f992f36f0db6bab70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(score) || score \u003C minScore\u0060 appears character-identically in 2 files \u2014 lib/code-intelligence/gbrain-adapter.ts, lib/gstack-decision-semantic.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":"lib/code-intelligence/gbrain-adapter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd38ad42224e27d64cf4e31361c283d4c9809a0d5d96a1d85fd972c53c210896"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(port) || port \u003C 1024 || port \u003E 65535\u0060 appears character-identically in 2 files \u2014 lib/cso/cli.ts, lib/cso/verification.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":"lib/cso/cli.ts"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbc9f4d4d3317080d4d03b05b2d9d0f169f5583add802d3b06d0fcb65296059"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isNaN(t) \u0026\u0026 new Date(t).toISOString().slice(0, 10) === d\u0060 appears character-identically in 2 files \u2014 lib/approval-citations.ts, lib/approval-record.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":"lib/approval-citations.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84a6bd40256c0f7d2c5549a64e53163eab9a1db85fa8a0cb77e78386c6f6554"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!d || typeof d !== \u0027object\u0027 || Array.isArray(d)\u0060 appears character-identically in 2 files \u2014 lib/runaway.ts, lib/ship-policy-docs-only.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":"lib/runaway.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd41d7703ccd20d86636d70c0afd770040f4261b41e6880aacbb81adbb9054"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!e || typeof e !== \u0027object\u0027 || Array.isArray(e)\u0060 appears character-identically in 3 files \u2014 lib/base-red.ts, lib/regen.ts, lib/ship-receipt-docs.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":"lib/base-red.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f064015db30a9ad61255405d845468be5f0bfa88bee61e51d26aa940942983af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!newHtmlPath || !fs.existsSync(newHtmlPath)\u0060 appears character-identically in 2 files \u2014 design/src/daemon.ts, design/src/serve.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":"design/src/daemon.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"841d635476c4100320f935624da088d984f107e233ef7d3ddad2581bb71556de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0027object\u0027 || Array.isArray(parsed)\u0060 appears character-identically in 3 files \u2014 crew/scripts/release-cut.ts, lib/ship-docs-result.ts, scripts/cso-public-ghcr.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":"crew/scripts/release-cut.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffa19e64d141a1a4da7dea1219ca3ad1acebed6ac8c03449add7fc94ce2d160"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw || typeof raw !== \u0027object\u0027 || Array.isArray(raw)\u0060 appears character-identically in 12 files \u2014 lib/approval-classes.ts, lib/banned-terms.ts, lib/ci-carry.ts, lib/design-build.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":"lib/approval-classes.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ad1b73e8db4eb9196cfd67a6b8ab893c0ce43d717aa70c34f10e25dec67eba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!rel || rel.startsWith(\u0027..\u0027) || path.isAbsolute(rel)\u0060 appears character-identically in 2 files \u2014 lib/autoplan-scope.ts, lib/review-fetch.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":"lib/autoplan-scope.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3446e85eb03662cb664d1eade4e62bbefad1e5c32b9a4b53623fcdbbbbb372f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stat.isDirectory() || stat.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 lib/cso/cache.ts, lib/cso/preparation-container.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":"lib/cso/cache.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"702252a439e3d5866f7e87d1306de1d250923a477a0d7c8661f48e3da87f6c6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stat.isFile() || stat.isSymbolicLink() || stat.nlink !== 1\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-container.ts, lib/cso/verification.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":"lib/cso/preparation-container.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb56f66205c35b08acf8cb1df539de1544cc18bebc6b89fdcbde358d01f4769"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stat.isSocket() || stat.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-container.ts, lib/cso/preparation-docker.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":"lib/cso/preparation-container.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2532ef4a8bfaed4ec2709aa370544542770f2b068fb21e11bc027de3566bc0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 14 files \u2014 ios-qa/daemon/src/devicectl.ts, lib/cso/admission.ts, lib/cso/cache.ts, lib/cso/contracts.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":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"675177f44e83d48a9f1937c76f4e0cec3d49825388254b2619cca3b30831f8bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(value) \u0026\u0026 Number(value) \u003E 0\u0060 appears character-identically in 2 files \u2014 crew/scripts/eval-input-cache.ts, scripts/lib/paid-plan.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":"crew/scripts/eval-input-cache.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f224dad07626d1fafd6899e0830bbd20c51223d9dfcfa2b5f58bf3c389e6fb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.host === \u0027gbrain\u0027 || ctx.host === \u0027hermes\u0027\u0060 appears character-identically in 2 files \u2014 scripts/resolvers/preamble/generate-brain-sync-block.ts, scripts/resolvers/preamble/generate-preamble-bash.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":"scripts/resolvers/preamble/generate-brain-sync-block.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba260f9d494fd17dfef70a6deeb0ce91d9119875aab010193173ac5a5f73c76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.skillName === \u0027qa\u0027 || ctx.skillName === \u0027qa-only\u0027\u0060 appears character-identically in 2 files \u2014 scripts/resolvers/learnings.ts, scripts/resolvers/sections.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":"scripts/resolvers/learnings.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad33bd6983e4e491856d95b37d6e0b655bd5514de890620e424dc34ecb12f4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current \u0026\u0026 current !== document.body \u0026\u0026 current !== document.documentElement\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c667869dcb5186d5ae94a50d42101c27618c02dfada72069bdc9f134daf6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current.className \u0026\u0026 typeof current.className === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85764188e6078df847079bf42b38c3b4f75e32003f714bf3fdf001df50e7dcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.choices?.[0]?.message?.content?.trim() || \u0022\u0022\u0060 appears character-identically in 4 files \u2014 design/src/check.ts, design/src/design-to-code.ts, design/src/diff.ts, design/src/memory.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":"design/src/check.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4957223de7bbae827e4fb8dc4afb41e0720c417b27c2723f984ae9679e862f19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060el.className \u0026\u0026 typeof el.className === \u0027string\u0027\u0060 appears character-identically in 3 files \u2014 browse/src/media-extract.ts, extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/media-extract.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"237ef1497fb915c84220cbc22900ad35631141acbf123e674a52012543b2fc20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isSymbolicLink() || (!entry.isDirectory() \u0026\u0026 !entry.isFile())\u0060 appears character-identically in 2 files \u2014 lib/cso/verification.ts, scripts/cso-runtime-promotion.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":"lib/cso/verification.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b75259338b0b8910dd2bf75b8f1e4d54fbae9a6b1b14a909953e951f9960c7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.CLAUDE_CONFIG_DIR || path.join(env.HOME || os.homedir(), \u0027.claude\u0027)\u0060 appears character-identically in 2 files \u2014 lib/claude-usage.ts, lib/skill-route.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":"lib/claude-usage.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9568c93362e182696b3c6f788873c74dc19aecc8be312fe4684488fe057957c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err instanceof InvalidScopeError || err instanceof ReservedClientIdError\u0060 appears character-identically in 2 files \u2014 browse/src/routes/pairing.ts, browse/src/routes/tokens.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":"browse/src/routes/pairing.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23050d6a62cc5e16d04acfba28aaa3eb02a225bdb7ffca06229154db2f34c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.name === \u0027TimeoutError\u0027 || err.name === \u0027AbortError\u0027\u0060 appears character-identically in 2 files \u2014 browse/src/browse-client.ts, browser-skills/hackernews-frontpage/_lib/browse-client.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":"browse/src/browse-client.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c54cf92cc9e34b9e486ec128ca351b8ec6bc49a137aac4c8e8a0d6dddb733ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof CsoError \u0026\u0026 error.code === \u0027INSUFFICIENT_CAPACITY\u0027\u0060 appears character-identically in 2 files \u2014 lib/cso/admission.ts, lib/cso/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":"lib/cso/admission.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8edebf84f55e7e2247cf3f52ea93abed643717b5219860c60b884ec7bb383a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060failed || !alive || !fs.existsSync(ready)\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-docker.ts, lib/cso/verification.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":"lib/cso/preparation-docker.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"587c65b1d12997567bde93186c2aacdac23a7c4dc5c83c3ce02b9772b0eb57f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060family === \u0027anthropic\u0027 \u0026\u0026 env.ANTHROPIC_API_KEY\u0060 appears character-identically in 2 files \u2014 lib/outside-voice-api.ts, lib/outside-voice-runner.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":"lib/outside-voice-api.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7faa3f1337e66820b5faa3ed3c2b13516d30ff482c4aaedf53e999926ede711"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060family === \u0027openai\u0027 \u0026\u0026 env.OPENAI_API_KEY\u0060 appears character-identically in 2 files \u2014 lib/outside-voice-api.ts, lib/outside-voice-runner.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":"lib/outside-voice-api.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18981250abe84f883e3261749209ff107705fec22b48c9abdf3ea3c76b69047"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first === \u0027.venv\u0027 || first === \u0027.cso-uv-cache\u0027 || path === \u0027.gstack-cso-public-requirements.txt\u0027\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-executor.ts, lib/cso/verification.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":"lib/cso/preparation-executor.ts"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f2964a62279b5798f6b0abcc06a4b00d1fdc89386099b35a45487e6f3cd98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first === \u0027node_modules\u0027 || first === \u0027.cso-bun-cache\u0027\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-executor.ts, lib/cso/verification.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":"lib/cso/preparation-executor.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c75a448d2c0ecd80a04c45027f12452618c5866911b0de7dbb10d8474d292cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first === \u0027node_modules\u0027 || first === \u0027.cso-npm-cache\u0027\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-executor.ts, lib/cso/verification.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":"lib/cso/preparation-executor.ts"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac8c1ddf2bdf4fc95f77b5a2cdc5092ae82220ee3e5b36631a82dd031b12b8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060freeze \u0026\u0026 freeze.repair?.train !== t.nonce\u0060 appears character-identically in 2 files \u2014 crew/lib/ship-queue-train-land.ts, crew/lib/ship-queue-train-verify.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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9933abbda404894b640a5d3174646aa7780f8aae891126a75032c12c9367dff4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(target) \u0026\u0026 fs.readdirSync(target).length\u0060 appears character-identically in 2 files \u2014 lib/autoplan-checkpoint.ts, lib/autoplan-public.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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78ccb3aa03e94c3c840620b5d8dfcad9fc42524ceeaebfc3d5c8c344c9b9b9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gate?.outcome !== \u0027GREEN\u0027 || ![\u0027green\u0027, \u0027merging\u0027, \u0027merged\u0027].includes(t.state)\u0060 appears character-identically in 2 files \u2014 crew/lib/ship-queue-train-land.ts, crew/lib/ship-queue-train-verify.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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4166b56031a84c89a5a4360fc49a975262144d8dedf43111ab19bf0b86f88aa8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060git(repoRoot, [\u0027ls-tree\u0027, tree, \u0027--\u0027, p], index).out.split(/\\s/)[0] || \u0027100644\u0027\u0060 appears character-identically in 2 files \u2014 crew/lib/ship-queue-gate.ts, crew/lib/ship-queue-train.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":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9a8ab3a52b6bc4a553ef8538a24536331f4992e78badff799e012216b78709"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060h.event === \u0027reopened\u0027 \u0026\u0026 h.phase === phase\u0060 appears character-identically in 3 files \u2014 lib/autoplan-budget.ts, lib/autoplan-confirm.ts, lib/autoplan-gate.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":"lib/autoplan-budget.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7bfaaefe6b7d65d813760deab9090f027e68b2991c9d1c6e1c12a0b27c4724"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060header.length \u0026\u0026 header[header.length - 1] === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 crew/lib/ship-queue-train.ts, lib/changelog-check.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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c8fa3b4b4a5982314127cc6af76f80f33f5eadef9b27672bb876bc69254cf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.baseRefName \u0026\u0026 info.baseRefName !== ctx.base\u0060 appears character-identically in 3 files \u2014 crew/lib/ship-queue-train-land.ts, crew/lib/ship-queue-wave.ts, lib/ship-queue-land.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":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"216d984393ac131132b295262576a56eb5d8d03dec4b16c7f1c2d49d2409bb27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isConfigUnavailable(loaded) || loaded.errors.length\u0060 appears character-identically in 3 files \u2014 lib/pregate/flaky-exception.ts, lib/ship-bin-common.ts, lib/ship-preflight.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":"lib/pregate/flaky-exception.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e66cf6d42751793a9d1851bc6ac1b89b08d8bf34bdae6771cdf88aecd16382"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060l.at \u003E load.at \u0026\u0026 sameSkill(l.skill, SKILL)\u0060 appears character-identically in 2 files \u2014 lib/autoplan-stop-gate.ts, lib/ceo-review-gate.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":"lib/autoplan-stop-gate.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"90793e6a4ba236fc9da967c53aad80c17ac51ef1b25b498bca2cd155bff62cf1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.dev === right.dev \u0026\u0026 left.ino === right.ino \u0026\u0026 left.mode === right.mode \u0026\u0026 left.uid === right.uid \u0026\u0026 left.gid === right.gid \u0026\u0026 left.nli\u2026\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-container.ts, lib/cso/preparation-docker.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":"lib/cso/preparation-container.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0052ec534b4c9a145c85ebb5c0e79c7f198aa1e16d989751b52a2a6b665463d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lines.length \u0026\u0026 lines[lines.length - 1] === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 crew/lib/ship-queue-train.ts, lib/changelog-check.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":"crew/lib/ship-queue-train.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f701dd74513d99adee3fc6683f9846c3766a22cec33b61f4b3e8e154df33217d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n !== \u0027gstack\u0027 \u0026\u0026 n !== \u0027gstack-upgrade\u0027\u0060 appears character-identically in 2 files \u2014 scripts/gen-skill-docs.ts, scripts/modules-install.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":"scripts/gen-skill-docs.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7964b0318bc3766a7dffc4970ea847acbcd6b94537d7379f82962176220b1cdb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.clearStorage || options.verifyAuth\u0060 appears character-identically in 2 files \u2014 browse/src/cookie-import-operation.ts, browse/src/write-commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-operation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ad4dd6db50b1af5300ed94f721414e06fdbce0841f02d959f357132ebcfd68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.port !== undefined \u0026\u0026 opts.token !== undefined\u0060 appears character-identically in 2 files \u2014 browse/src/browse-client.ts, browser-skills/hackernews-frontpage/_lib/browse-client.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":"browse/src/browse-client.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ef67eae5894d2b04a3e17ab407c6d69de9683c6ebf04373483bf5ea799227"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060owner.host === os.hostname() \u0026\u0026 typeof owner.pid === \u0027number\u0027\u0060 appears character-identically in 2 files \u2014 lib/autoplan-checkpoint.ts, lib/autoplan-run.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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3f1cfe7b50f5dff4233895dcbb75399d7007a0d12af05a916868f4c2cad232"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseFloat(computed.borderBottomWidth) || 0\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6410beea0438fc22033f1546d48dddfccb7ef88fea750a2fe3eae2fada9c32f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseFloat(computed.borderLeftWidth) || 0\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b9a372ad011c410b18bd96e9ff3549d26198fdfdee7462fe48dd7512a4a08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseFloat(computed.borderRightWidth) || 0\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e709ee95ab4861d4f06c01276f2c5aa91617416cd74f2a99f7c811788808d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseFloat(computed.borderTopWidth) || 0\u0060 appears character-identically in 2 files \u2014 extension/content.js, extension/inspector.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a305d981bd82dd45f82c7f888b3ec140eac339cf7afe41faed2bfab5413d5739"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part \u0026\u0026 part !== \u0027.\u0027 \u0026\u0026 part !== \u0027..\u0027 \u0026\u0026 Buffer.byteLength(part) \u003C= 255 \u0026\u0026 !/[\\0-\\x1f\\x7f]/.test(part)\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-container.ts, lib/cso/preparation-docker.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":"lib/cso/preparation-container.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c0387df539bfdfd53884e358921894f4c1df8462a1640ecea31a75db0e3d79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.startsWith(\u0027vendor/bundle/\u0027) || first === \u0027.cso-bundle\u0027 || first === \u0027.cso-gems\u0027\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-executor.ts, lib/cso/verification.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":"lib/cso/preparation-executor.ts"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55a64d58b0c7c7bf5ac0909af18b68a8958ddaed84d0a77d132f96b2ff6796b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.getuid \u0026\u0026 stat!.uid !== process.getuid()\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-docker.ts, lib/cso/preparation-executor.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":"lib/cso/preparation-docker.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6ff86907dfc37f75f04e890a2a35415e67791a5c2149dc07a8113d639d8f90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.getuid \u0026\u0026 stat.uid !== process.getuid()\u0060 appears character-identically in 7 files \u2014 lib/cso/admission.ts, lib/cso/cache.ts, lib/cso/docker.ts, lib/cso/preparation-container.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":"lib/cso/admission.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"85895fd261f151428e1fe59d69aa168b6963206963087fa97c549962ac6eeb7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proposed.revision === current.revision || proposed.previousRevision !== current.revision\u0060 appears character-identically in 2 files \u2014 scripts/cso-runtime-promotion.ts, scripts/cso-scanner-catalog.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":"scripts/cso-runtime-promotion.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76ef358fc98d361a40d1dc7e36e55eba4858d5a46ff885c706a8e3b584c4978"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.error \u0026\u0026 r.status === null \u0026\u0026 r.signal === null\u0060 appears character-identically in 2 files \u2014 lib/pregate/lane-selection.ts, lib/script-invocation.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":"lib/pregate/lane-selection.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbcc22d1420536cb72327b189d4c62022b28f0b17bc5f1478d00f4cf588793e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.error?.code === \u0022ENOENT\u0022 || /command not found/.test(stderr)\u0060 appears character-identically in 2 files \u2014 lib/code-intelligence/gbrain-adapter.ts, lib/code-intelligence/graphify-adapter.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":"lib/code-intelligence/gbrain-adapter.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24cfa0864a4890c28bf0d8a0c0b80590434ddd16aa27502cdefdbb15b678334"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.error?.code === \u0022ETIMEDOUT\u0022 || r.signal === \u0022SIGTERM\u0022\u0060 appears character-identically in 2 files \u2014 lib/code-intelligence/gbrain-adapter.ts, lib/code-intelligence/graphify-adapter.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":"lib/code-intelligence/gbrain-adapter.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd40b61a7e1ba80cf66836e73398011d3f204b9f5b161eabed714aaa534d910"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.outcome !== \u0027approved\u0027 || !scope || !ask || ask[1] !== scope[1] || ask[2] !== scope[2] || GSTACK_ACTOR.test(r.by)\u0060 appears character-identically in 2 files \u2014 lib/ruled-notes.ts, lib/test-lane-exception.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":"lib/ruled-notes.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e881a79e5bca7ba8bcee5934c7d82ddfb8e43908eb3cd9af6af4ab0f465573c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.status === 0 \u0026\u0026 /^[0-9a-f]{40,64}$/.test(tree)\u0060 appears character-identically in 2 files \u2014 crew/lib/ship-queue-gate.ts, lib/run-evidence.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":"crew/lib/ship-queue-gate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ef8adbdb929be04ccce427a409a3f333fe4cde32664c1eba6bb329fc34eb2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rel !== \u0027\u0027 \u0026\u0026 !rel.startsWith(\u0027..\u0027) \u0026\u0026 !path.isAbsolute(rel)\u0060 appears character-identically in 2 files \u2014 lib/approval-record.ts, lib/autoplan-checkpoint.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":"lib/approval-record.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb41590d5c395acd364dfc73a3b2e621b6d09547cb288ccb133892cf162d4920"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060res.status === 401 || res.status === 403\u0060 appears character-identically in 2 files \u2014 lib/code-intelligence/sourcebot-adapter.ts, lib/context-bill.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":"lib/code-intelligence/sourcebot-adapter.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a974f4375320f445c8767e88e2eb3d2a1fc393e7f912f852d9a8cb65fcdffc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.code || result.timedOut || result.truncated\u0060 appears character-identically in 2 files \u2014 lib/cso/docker.ts, lib/cso/process.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":"lib/cso/docker.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c9530ff83eda35e1883100c745b401e2f64ddf27de5938adb1e1953a9b4ced"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.isDirectory() \u0026\u0026 !stat.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 lib/cso/cache.ts, lib/cso/process.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":"lib/cso/cache.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9a413f70e21242ed49763dd9e813fe8d7659121edb21bfc15d483978fac2f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.isFile() \u0026\u0026 !stat.isSymbolicLink() \u0026\u0026 stat.nlink === 1\u0060 appears character-identically in 2 files \u2014 lib/cso/preparation-docker.ts, lib/cso/verification.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":"lib/cso/preparation-docker.ts"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d2109e4344ce054804943886a49965034e113d7b1f3f49e5d5d44ea4b08f7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.isSymbolicLink() || !stat.isDirectory()\u0060 appears character-identically in 3 files \u2014 lib/cso/cli.ts, lib/cso/state.ts, lib/dx-error-capture.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":"lib/cso/cli.ts"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b1ee2a9de1728f707884d71916944367fd01d67b3ea310e157a7e2c4948b15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060summary.failedTests \u003E 0 || summary.unhandledBetweenTests \u003E 0\u0060 appears character-identically in 2 files \u2014 scripts/lib/shard-engine.ts, scripts/test-free-shards.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":"scripts/lib/shard-engine.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eb93118b1e2eea0a52a79c099e09f0c3d4d02097754bc22e614573abd8ce6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.tabId !== undefined \u0026\u0026 !isNaN(this.tabId)\u0060 appears character-identically in 2 files \u2014 browse/src/browse-client.ts, browser-skills/hackernews-frontpage/_lib/browse-client.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":"browse/src/browse-client.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4999e8ed21a5b8bb6eb87312c78a1dd11dc13bf97d3949bfed1903baa4652022"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokenInfo \u0026\u0026 tokenInfo.clientId !== \u0027root\u0027\u0060 appears character-identically in 3 files \u2014 browse/src/meta-commands.ts, browse/src/server.ts, browse/src/session-tabs.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":"browse/src/meta-commands.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddbe419daa76793c62136daeb17eee872d8a7cdb5f3ebe555fc5feb0e645694"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060toolName !== \u0027AskUserQuestion\u0027 \u0026\u0026 !toolName.match(/^mcp__.\u002B__AskUserQuestion$/)\u0060 appears character-identically in 2 files \u2014 hosts/claude/hooks/question-log-hook.ts, hosts/claude/hooks/question-preference-hook.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":"hosts/claude/hooks/question-log-hook.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30896f5b4f3f0a32982c9786ade5cbfa4e56397fea935b3d1d532f47f4c31c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof data.port === \u0027number\u0027 \u0026\u0026 typeof data.token === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 browse/src/browse-client.ts, browser-skills/hackernews-frontpage/_lib/browse-client.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":"browse/src/browse-client.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117dfbfb2bfb6e822b639bdc00351b90042c219431a68c48245f73fe1262fbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed !== \u0027object\u0027 || parsed === null || Array.isArray(parsed)\u0060 appears character-identically in 3 files \u2014 browse/src/snapshot.ts, hosts/claude/hooks/skill-contract-stop-hook.ts, lib/model-policy.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":"browse/src/snapshot.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"edae175c3aa00d3215001aa8e2f5d6f7f4986ad84dd4d62d9f84648b15a25cc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof s === \u0027string\u0027 \u0026\u0026 s.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 lib/plain-title.ts, lib/quarantine.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":"lib/plain-title.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85e58cc338239f39283366952399c66f9a4a5cc969cbbd8e8abcc0aca7b79a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0027object\u0027 \u0026\u0026 v !== null \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 3 files \u2014 lib/pregate/rust.ts, lib/skill-contract.ts, scripts/resolvers/contract-done-means.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":"lib/pregate/rust.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7568603e71b88e6ef634e9406b7f4e8e9537e53e6ac8698f3d67caabe8d4eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 crew/lib/gate-cost.ts, crew/scripts/eval-input-cache.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":"crew/lib/gate-cost.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5dc04210dde7c7d00aa1569e5c293762b772acc673f96500754495b0e8cd59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v \u0026\u0026 typeof v === \u0027object\u0027 \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 4 files \u2014 lib/autoplan-stop-gate.ts, lib/design-md.ts, lib/pregate/head-policy.ts, lib/tasks-prior.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":"lib/autoplan-stop-gate.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a14993ce3f304ea82024d82d1877fe301208eea82d9deecd438881caa6d55b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 lib/claude-code.ts, lib/claude-journal-records.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":"lib/claude-code.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0177926a778d0d1f99d6affcab3a0cec88d412ec9c58c44a312c8b2fb27a46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== undefined \u0026\u0026 typeof value !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 lib/cso/verification.ts, lib/model-policy.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":"lib/cso/verification.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b447cba0a1e62a90f2d82e7b9a9849f04879acff08c34381ca0db2b01382e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || value.startsWith(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 crew/scripts/gate-cost-replay.ts, lib/motion-capture.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":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1835b1f6ff5c5399dc537a4dfd54f105c7136b51f77459158b5b2544b9bc38e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.startsWith(\u0027./\u0027) \u0026\u0026 snapshotPathHandleId(value.slice(2))\u0060 appears character-identically in 2 files \u2014 lib/cso/scanner-executor.ts, lib/cso/verification.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":"lib/cso/scanner-executor.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4361b9db8ba2c64fa9db7c21ab6959e86352f890ffc3e24696c7334041281f97"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060dropOwnerFields\u0060 is exported, takes a document from its caller (line 230) and hands it to \u0060walk\u0060, which calls itself at line 233 (\u0060walk\u0060) with a piece of \u0060v\u0060 (and at line 239) \u2014 and nowhere in \u0060walk\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 \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-owner-words.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a47562dd141b36f1552166b8c8ae673d23ba1fbdd47abee2ae56ee6c237dd0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060emitYamlBlock\u0060 is exported and takes \u0060obj: Record\u003Cstring, unknown\u003E\u0060 from its caller, and it calls itself at line 246 (\u0060emitYamlBlock\u0060) with a piece of \u0060obj\u0060 \u2014 and nowhere in \u0060emitYamlBlock\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 \u0060emitYamlBlock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c48a2f12130154b8470f35e69aa78d74c659d00baca3d7e7ab56b3e7ca770e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060tokensFlat\u0060 is exported, takes a document from its caller (line 367) and hands it to \u0060walk\u0060, which calls itself at line 374 (\u0060walk\u0060) with a piece of \u0060v\u0060 \u2014 and nowhere in \u0060walk\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 \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-md.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8f00f86efbaa11ea285c41cb80d9bb1b1f3e2f649a5f45fe4b3d4c1e7e2307"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060checkSchema\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 340 (\u0060checkSchema\u0060) with a piece of \u0060value\u0060 (and at line 347) \u2014 and nowhere in \u0060checkSchema\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 \u0060checkSchema\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/headless-artifacts.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf27f60fb91021e2054b2eb613ae234d66770a33486ed48c59874b8913d038d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060detectRunner\u0060 is exported, takes a document from its caller (line 121) and hands it to \u0060allNodes\u0060, which calls itself at line 116 (\u0060allNodes\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060allNodes\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 \u0060allNodes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/junit.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1732062bad39300cabc48376635820d65b155a159ac526195e9c0688196fea2d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060receiptCounters\u0060 is exported, takes a document from its caller (line 20) and hands it to \u0060walk\u0060, which calls itself at line 26 (\u0060walk\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060walk\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 \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-receipt-prose.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1923bffcabe979d260b5e1a3422c26011e9fda7948b08e17cceb354f1a470d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 47 (\u0060canonical\u0060) with a piece of \u0060value\u0060 (and at line 51) \u2014 and nowhere in \u0060canonical\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 \u0060canonical\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/contracts.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5929d862c0673ebc07e8e59967d3ba85ff933056224843273dedec8f70fa9c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sanitizeForJson\u0060 is exported, takes a document from its caller (line 293) and hands it to \u0060sanitizeJson\u0060, which calls itself at line 279 (\u0060sanitizeJson\u0060) with a piece of \u0060value\u0060 (and at line 287) \u2014 and nowhere in \u0060sanitizeJson\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 \u0060sanitizeJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"567141fe88c7026e3eec74dcb106481f574c4a3ce36b7aa13a89fba93206f33a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060checkCanaryInStructure\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 301 (\u0060checkCanaryInStructure\u0060) with a piece of \u0060value\u0060 (and at line 305) \u2014 and nowhere in \u0060checkCanaryInStructure\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 \u0060checkCanaryInStructure\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6950c19247c10cf0bc70afeed5afd5021d27c07b43c5c2702b113454d6f82"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060runSetup\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060GSTACK_DESIGN_PROVIDER\u0060 environment variable (set at line 146, put back at line 162) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception thrown in between \u2014 or by a promise that rejects at an \u0060await\u0060, and while this function is suspended at one every other callback the event loop runs sees the moved value too: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or config read in ANY module resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the directory. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd\u0060 and \u0060env\u0060 options of \u0060child_process.spawn\u0060/\u0060exec\u0060/\u0060execSync\u0060 (or \u0060Deno.Command\u0060) scope both to the CHILD \u2014 or build absolute paths with \u0060path.resolve\u0060. Where the global genuinely must move, wrap it \u0060try\u0060/\u0060finally\u0060 so the restore runs on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f6a0ad6a72d0f36971ac75610f03e511e824c0a71e6b49577e67f7db8f7c9e"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 33/47 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: download: \u0060download\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"397ac53012235d22b579f283f00914edc665839994ca0a1ca342c54f234c1092"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: proxyToDevice: \u0060proxyToDevice\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/proxy.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"23214ed4b5da1b5972419a72053856592a15cd8616f9372f5ae2d0aae3d87c7a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: whoIs: \u0060whoIs\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tailscale-localapi.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a7d0dd3bff8ac505e68510ace46c480d03510b0cedd5e7388609cbb1e64e1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: mintSession: \u0060mintSession\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"918dfd5a47a37e2da071e380c5daa9bf6d9592fcbdcd369a1351b8976a0c77c5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: tick: \u0060tick\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa3767da2dfb3f3e5d73d4a93d710d1ec4ce36ccbbe68d1156edc0a202fdaf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: checkClaudeAvailable: \u0060checkClaudeAvailable\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"46426ba027f64a60694d2cb369e03147bef42d6ab3edca7e49ea9246e8f6b7ee"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: gstackScanForPTYInject: \u0060gstackScanForPTYInject\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0759b938a61adecf379eb89660936d38a7a1de05adf07c659d851c748bf635ad"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: forceRestart: \u0060forceRestart\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed12f0978cf1521afe2789e098cf09d01bd09249931bdf511239570520c8329e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: ensureSseSessionCookie: \u0060ensureSseSessionCookie\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb371afa0debc9fb8615b250185c9ffec816e13c337cf0f5365a99af52ebb1a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onclick: \u0060onclick\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1a54b8b09e48ae61ce5e3a3f7c076ce565a34f19837fa76070f1805f2628b6"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: publishBoard: \u0060publishBoard\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a1247d84ef9527c7d105981eab0eac4a6e34c382b1562d1f440788d90108d1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: superviseNativeCookieImport: \u0060superviseNativeCookieImport\u0060 holds an AbortSignal but calls \u0060sleep(\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: \u0060sleep(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"10091d44655458b50f208e9f3d421b3ad1c26857aaacb1ddc3b7640748da83c2"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadFile: \u0060downloadFile\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6a2d8a40270bd8a1485c920273c64aab9036cd5e71ef5b8ae3764ef52431eb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: handleWriteCommand: \u0060handleWriteCommand\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a5c2277d70a402a624ebb6562690d3bfa83dddd41fc8ae705f952d3b8cbceb"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060ROUTE_PREFIX\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through the HTML \u0060Response\u0060 this server sends with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03bc8a3c7971f8550aeada7852cc101d176601be6b5fbaa445999aa00b07d2f"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060svgText\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/diagram-render/src/entry.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"58310517304ab601d241b45a0994c27a212326061bef251eccbad8530e4cd09b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/diagram-prepass.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f962cebb27cc4c9c3f9eb901d9f71bcd758e892ed5cf0f3c36b6f58508f58904"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/orchestrator.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea5ee8ed5894a21ac05a6b5a543680085dd05a975f5c4ffadb616269be4a723"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"make-pdf/src/setup.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"76245a30235784328f7f0cf4240817fec8d357d026222e0402fc5f3fe234c8ac"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-citations.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a18bb96c76b0d5ef4fff217df04680ac7a27b5bd0ab28de485f544ed71196da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/approval-record.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d568fb7391460df21ab78545e00ce9f5e22e4fcf9a44740d84beca68731446"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b437228a0ddc69cc17b03f2f013a5cc015172eafc5a4fd78298c6f68813fdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b074db8af0f52544cef3fbfb09ca27dc6aa2098e3579f01bb30a861d3d6c9f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e513ed6a13c2ff5ee2df9db542a7af9273157b6b952f57f1f06b72bd0ecbf3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/aside-render.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1886f1866e13116db408f25a99d1353f2c91bd9f41e3b6c73f5108bc780a94c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-admission.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26314e6370a71efced98df5245092007ea84b18142f05bc865e1b4f0b578d6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-budget.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1ef65e39706b5c0dedac7c5b715b15fedf79d38f8818bfd932e9d2ae2190b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09c4bcfd13a113d41fdc6e720d456d0972911f533125857537019be1a96d088"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f7779ef6c1d34e0f472abc266442e29a0d4e2bcf2ca238c0fd8d30216416f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b1937e544b0f3bf3926fd36abc1a690038896fc8b0b9ec48ea226ff3c693e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-checkpoint.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38ec20030e5aafdf4115415d8769d57f3b2c77144264a4982bbfc5433759b08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-migrate.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4d1bb0c14d09e4ae94dbd007965e2cd8b9a6a64824d94b159f4d10b8544845"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-public.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"40213adf0ce08540e064049a7161b09b692fa4f87a320c0b534b785124859e1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-revise.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"225f6bc082917ae228e316cd721ca4deac93f695b69042daf53e646744ba6fb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7259cb56e8565d55419829ecf42997d709aba5567e188e71aac48f6eab1d143d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"da159af3978ac49dd53ccb9937a93ce5ecfaad446a449c2f83c234d95abd84b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-run.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3032115e54d1b585cb2018acbd3b5f0922c054c1c21f242ba727a940b79e12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"895c4b43007d241ca46a783f0b3b5b378887fe42c89b1fd0b7c5a077f3813507"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c013f3b0238e8cec15ebeaf8e3962d09920f4a6833769c950729e300b6d063b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-shadow.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"380796b22939adfb156d35d37cca240f175f8ba4df4562efa290bfa16583a9a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-stop-gate.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2c3e899e81dac726a8bf7b7258f149755212661e5df56b03e83b005824e1a3"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/autoplan-timing.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e45e07df8fee53873d84ab81a3c5a1ae757b2fd152bf899ec9518f65b60b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31cd9985bf364b57b804f7bd653d44f6a85d1befe16547a278f0ead75211a70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e5ae02298640080bf96c59bcc254c7933084fcbc1c7e893638cb216775bb9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6b48e010fea5658a1421b004d7363a9ec567bbe3e59c098b625c20f5e6a056"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0788c6a6b28312d23c774977e5e329035c824b5cfe9b67d72c0e9a1ac1f3c1c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d424acce33fa18e6bfe1665351940be822abd579f37e6fb9713f7de40a5dda1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ac811cbf3fe39a5551132ce5b9c63e6e6bd18fd9b52e15e3caea9dd1c62f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643086a80f6966cdc8f3c8d488e7efbc4b9df86dae6f6e97cf9a4bc2aa5c16f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d37ac780d9de556638bb344f4682f20e43578be2a177988974b32f8db1f5a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/bin-context.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf453bbbb1e56b93bf167262413a6c7f088d4fba04eb9edafaf2b63a2a65a1e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ceo-review-gate.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e708dfb49a5a98c7a38175c33bc27e24edb2dd6f5978c9ee7b777d11628db819"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8df99418f44bac0ee8f738496d2020cdeaaceff418e5332f8f4b2a61e1f4b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b8bd8e3cfd2647a2cb9b2f8fc2dc66fd10dae7d9afcb4bd9326f4cd51075c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"085df47c1e339154b2ec8cc561e6c4ae4e557131a1799c32cb333f9dea35c56a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/checks.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ed4fb42067407b84d8fb5608b766be67d93862b573a63d3045d635863b2761"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ci-carry.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"01117f49286fd07d808d9be6e6be878c4ff6ba5ab69aded65cfa979396763c8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-bin.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eaff6c19d3b02a44133133d92cf355f866e22d998b6f4c1d558f6332ab11ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code-migration.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d354a140774587df1d8507710ba73fea2c5d6c8ae8067cb7564b32ea5ed4e89b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7c7d807e0ff23672f7cb710814ac8785d5f72d52932ab42f8c7a362ab769d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-code.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b62580e35ad78d5c0e7169fb5b9accf6a126ecd7d20eb522c5dd71760a6f5c5"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-journal-records.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c80ec3aaab4697617d96dd6ff88e0ebba85dc903147990cc0d6c2a6646ba30"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-owned-journal.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bb2f5dc3bb90e774954f03e1cefede6e1adfd1ab57b9b51e38c7b90a0522d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-usage.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a682967b5270f8819ee6d9ce34e3aad9a6320f2c70b4785b098561e110ee4176"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/claude-usage.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"112dd702d41caf185248089e2eb2f110104ad2f2dd3af0c7b7613ca926cc80e5"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"86678b80b5907735f7b4a851300c37f046c41feecc718dbde72ab09d181ff94c"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"697f26b53992afce0b44e611307593e9480370fa09f3d16b7f7ba6170c6f1589"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0346848458feed7bcc643338b8d9d510c629d13f8d1998fd4892b7a8b47c9d"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e5956e3bcabedffef82d8d5e6933502fc5be3f9640be1bc17af6ebb1b07ee3"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-bill.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02b2d3186184c8604f8e846ead3a7012885b8c6cefbb9a32c1f5dbd34b7284a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-build.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"15be3269e76b8aeef9779f9d52d38c8ab61d7547214e429b06034ac146b950ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"188bd5618830e59483a87ddf2376942831c80c402679faee858b164c0487c389"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dx-error-capture.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b90ec10907b3b2fb8507bd00524bd28e8c6c0aed27a00788292d6415534540"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/egress-receipt.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fe2a8f5b067e6249a67980921949e39b2a259a85098b74a1e0dd073f252639"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/egress-receipt.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4725f54bc6c1df1c1348e2d519de6461b5840216e02defddc281380ba2d61a2"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/egress-receipt.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d23ceb93127973c1c983b9a2eb6549443780ca7751bb41ade5ffbded7a6044e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/egress-receipt.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb00e9c6d1364c5389df8517bb8e958c09bab96cfe959b83ce291df47bab453"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/egress-receipt.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90306233c1dda625aa50f105b6d8e77df28873e167d1cfd1c4be8c363f21c16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/error-handling.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"04080772a66d9b2102027b0afa41de2b2780a49a5b7f5fc8ddc0666a6fb93d7c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-plan.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e159a0117d0968d0f4fb091b5026bd5706a7cc3e24577147ad854d8eed4aefd6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfac55d3dbba56456dff1e99d040fa6f1a2c1b0d97392beebc576364450f549"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/factory-scorecard.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eccfbba03a093842b809a70f539e7761a383ffd992a089f3dc4d700b3466b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/fs-atomic.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a502988ea94e732a983fc6f90adda17037f302391c41e6e869254407cb254195"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/fs-utils.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ca653321fd1599de401f1850cb2f4a71ea06dd8b06b81586c627ea2092cff5"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4d0fc82f9e5c56a102674fb509e3e80a7d0a3f23434871f0d09298233aac66"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gate-dispositions.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0893abf1be4a9cfd548b3c92f7601fbbb0d83dffe6d9aec5ce08dd949ed67aa7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-guards.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8018786959d76d7833074b551aefe74fe27b31e70b025b9390f437fe77c72f18"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"debcc515548b0bc6cd497090e8a1ecf89b80d532296ac14540d33c065448572c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d2ad5448ec144051139751c1b9e0a87816e4d1261b9023a5c2bf6aebc5bdf4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c669e8ea51712735c9d59209a24cd9cfd68093c3d8327eb882f7074a383ba5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-local-status.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b5bf1873343c2f3b6e440bcb17ebf983e69598ce5d85e26dcd3a1a00717c0f"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-repo-policy-client.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ca6bce29daecfe937e128ab0eff90217dc8bd9f364a378b9019799bcdedd39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-sources.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f190b26646cf114132aee6d188322b40aed38a5cbc5d5c7fc76791defbab99a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ad4a2aaee872542e3f04d85cc94df80cf64952e2dcc34e28bad506ab199d7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba883077f79fd3371a5ce1df5cf9168fac5932e075a804e552ae812dbaa6602"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b24c060b4f9671cd8bbc912003eadd5c676210e3a89922f4a42d11cc3c09db2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-supabase-provision.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e4109b7e0529c56a8dd8356f1ee85cf798ed53e38fb28e4307496f8ed22b37"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gh-poll.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c3e374a1973468863a663bb54710e687a0614c233346b5e2dc6115079b77ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-decision.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a8fa6c1d86a7bb67d8665564105560e054795ebcc9089555bea55e3a0afa74"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34c27b6344b7c6232fa4e4d3c14634d6b92ad0df4892fbbf6b180e791c34b89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f890317a8e4dc6fb7788399d77cb64921ddcd283aad06181e2dbfb33e6b7fedb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8ff3125f8dfa7620c11bbe0596c5699bd04bd27d1e14469a527fd3f14c58b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-memory-helpers.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f507f2f5e2ae4d793a27baedc15529369affe5085bc2a48278c09fc5046bdfa8"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9def5523661e174fdc8ad5da18d61169ecc41cd87f534a22a98d24264aa803b"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7038dfff911e8daed403005bd80329b5267aea2518b571d09bb520378ac0cc23"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3be94bbce4d15014b6454ec27a13362204f552130dbbcc2af24d70e6c07db8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c2ae3532ac895d32f476ba9cd97e88f1b13771de9efbdf06b3d224de24478f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f9ae967e7a0753774bcba6a6c2eb47497d19c1317cb29fe854d89d141adc08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f023e1f97b22875506c3cb8f6a65d28057c9074da83eabf4a3ed70d9e87f931d"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-start-hook.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d7d505c84c5be7454355f704dc8d3b818f71197e1aa3e49a74dd5a31240a10"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/issue-links.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5b675626a692bc659b2c25c4c1f73f65e90464c460db26734a1551ae627a02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jsonl-store.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a535164129c972b598517647f2332b7a15c7dfab2ebfbf2ec614dd6254722cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/land-merged-checks.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4959af99848bc485ed23e280d5b7e24b64738fc41384efd33d345090286e20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/land-merged-checks.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f65bda69c4f531719f36acd22c2f2e40261d49b1767de6ce00124596b2e2553"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"98784227e5dd6b845bb8ff32d445a11551b0ce24fd47d6b30cad6d527acd9e66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571bf12670f73ab10f2c54d8b517687d7e701d3d09009cc1318f32b13a1b370"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/memory-ingest-landing.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a151ac98a0f09a26006626657803783739b0b6773ce25216c0f503955dbcbf"}},{"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":"lib/model-policy-freshness-sources.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e19860f90df62cab05d2e29db667bc29c32932471852aa2b883f9c9ed4fdb1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/model-policy-notice.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2928a5bfd8fc3d080b2394acd96f849ff1f5cb011e2e19d9fd74735f04bc4bd"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-review-result.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6327b910fc03d7b33c1e757dd79d6a784f0871242893c278d618169b824d484e"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/outside-review-result.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb38a9775258c6db367ea85696dd039639fc0a0b8c3674e8374b5e754133211"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d147ed6bacaadb00bca05c3b00179fbd715a56229c282ed32717e9026762367"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"79aea5a8f13a44687521d270be5d3691e752970b937f65903918054f24a0f6c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/plan-record.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a59261d619e42105126971918f102d7caeac10e6bc51b128ef923171cb79218"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pr-wait.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"419c586bc4275bd915841ffbabee2eeeb0bc1a309166e438ea452979151bc924"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-deadline.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"395d556be512ac43ddc6f5c9af8b598494b3ea9912dc719b8b9fd639eaae3679"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"336f9e0fbf54502ef05b2329982f3e3b1b3fd90a7c22e43519f7763b6706b7ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c553220ae4132b897a4dfc3d06d14c7a8814febe2844542a369009dc7be58a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/qa-evidence.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"54668cb59fb9526735e868c0f12589e32f6f071b1fb7f481661de3c2cb74b4ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-audit-log.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cada2981473ab21b9427f30b9696878badf0b559d38a6338134eac362b8da85f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-audit-log.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a891904c6dcd57519bf35c9dd60f4955be8fda96b6252eba6dd5654ba53ff1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/regen.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed5286f8d46452c3906674286631089b6cf2297807fd63ae300aee8e2375b1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa8f694fda1b55be304207ad08fc6a72e6b2c7ea9de20ce56c73d0a314b1239"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/repo-state-clean.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5efb42d42744f6bbe166ecaf23e6f9e569cf56e2cce64b17a58e200d027378d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e715c2ce7926ca9954bb323bf82d4f1b8ce0e000c03a9e9f14740eff5c5d309"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd7f0eaea65cbc90c08f4aac8d8baaa6b730dc3591204592e0c98db23ebada8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c2874d068609eadafd1a4a705f8838e006f58d4833ecea2f8b3df9e9b7b0ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/restamp.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ee8ddda6b244ebb20dfd4c60e7fce37afac20c816180555cbadeb295527947"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ca651f23aaac7214754529f6db358c5b84e30bf6015af2de6482aa4ed0d184"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-evidence.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2357215175d71f9e685cf55d063575eba7018d32e4c938813579716fabe120b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e305bcbbb75abd75dc4d6117d969b085ebc89606ac638985478fc9a76e12fca9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20f1aca98e66b39b9b3dbc47c3fab8a64729490a82db7657d32c8ccbd4d499f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f7e8b59e906dcbe0a98f67b4974f65841bb175e27fc4e85940d3032cf833ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-ledger.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca0470a51469b16a32cb35287db9b9a7fa5342ce0b9c2a8a50d2d67bb22ad2"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c9b149b734fc1f49327dbbf08c52b9ccaa04767715a004793ae81da2e0f19b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-sweep.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d90484df5414e187853f5a2169cf8f316c07f7ccd78d61407cb26936643c6a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8462b45bcc6ffc1f644ff36f92e09b244843fca3a4a80eac8aec3063ba02592"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/runtime-pins.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5546727f09b05454acd2640c658fed97a51ebf4fd4edb9bb0c19190dd24e2d1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/script-invocation.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37c60fae199783125e77e8f100cf3ac2a17a11d762b4cb8dada708a5356eb8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/script-invocation.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70b38b33d9dd1c6711251ca24e27736cad746fbeaa70ad3d38a0c8dd747c075"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/sealed-guard.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eb7c04bd365617ecf0c30f905bf4d58807b2a35e2beabd6003af1b6465478c"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-audit.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c82df874c56444a7991d0ed4f9f88bd3e8ece35929a30cefa8badb60cbea2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf2d05fc4a01c72c6525baf7c1913d1c9e0483627d8f547b9be344cf9f532f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget-cli.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad2a89d5451fcf77e56d8678a9226c9edc43cc1aa8969a4dc50393ac885248a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8412f0c1c5f7fba566f542876755f3a86353fda38404577917b2468224d622d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0c285eb6d1c283df474325e25c08bced4ee2bfeade10e759b41561a2223f4b"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-budget.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fbd68ba0f47f79558427ae2be944188dce7317c053829f06bed3ef1807d2d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-call-log.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c8def9fc9fc27064738b9939a35862542c8a5fdbca132d795a4eab3b0e33e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-preflight.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"036039e9e3d837b9d4040e416b9448ec40fc22578b2ca6698906211a7b4e3f45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"71649482e8b8bf74ec26ecd50f557f29ab05c4879e8f9514d68c8e81f7a151ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72c146181eaf5a76a97dc032168b1be9e66c392126879ad34a0e139782c9619"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-queue.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d0689af56ca8a862c11ae40c818f9b0166c3c8d0d270ff8bd8160fdb89828f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72727d5bce712d739d602528eabdf63e176fde1ea8762d87ce9818652399f70"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"36af6ba947b4228b659e8afedc5eacebe8efc04b82e22a651d1c42fb999db263"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ship-release.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"d972881d20cebac14cf4d670102658bca9a9725670f59cacf173285fb7357d4b"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"740fbbecd1c2bc2e9ef7c730b7fcfd83d8a406d4df34bec8efa24a370cb87ad6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-contract.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd90ff3e258642dffe0b9424d666cbc7227cde6b1e12bf261fad5b45a6be440f"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-gates.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9978f01a5d05ef3b03328fddf0aaa5031ad06c431c1629d02396a7fc6dbc51d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-gates.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53408b13d377a8be3661908b52bd2a2d3ff53adf46a043d3db62bc61c21211e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-gates.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdddaa146ef6bbbd1d2cbc98c483e3ac421c31590b6a58d47f802cbbeb50499"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-gates.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9ecc0661066b9e81da55ac1d6a8914411fe8e2f37543774283f1264d1ee030"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca538d560ef9c6c48f2848ded2d9cdc3961ec8823e9b24a097acabd1edb28b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9451c72f54534c300ab52a86c6a383e8da69b7e9b92c24472e06c242d45ed033"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b6e689d9b9042001aec641f5bab1eefd96129711b1dd14f8c1bb349300f29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e19ce3b57f19780973344c5e7839f3995756f88dea8361bede6d417f4c9d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7132724a43af8f5e5ede7b2bb83317c1cfc84f01e8f94f19f3380d75342650f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/skill-route.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a4aad90de75e62fc4fb443e8f83bb848e6c9f11d8e6225417b9218dc3f1b68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/source-root.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d928d24bfcd15f9795897741897b5dde6b3589979bccb6e0a6fa92d477e08e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f668e761527f5616d23bd9fc30841f3dab5f574304f0497b4dc2b9673f3edf00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cd3d4e5d48f94328d074e2320acd63bdc87bdd822803caf7a31367ab84096b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4366556fb96e4873ac2926ce77abe3f0783903050cc98321db80f4e32e7de6c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/spend-ledger.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8104ad6d22b0998a7d1e9074b7b97939a91e4c921ba030e2e805b1f4643cfd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/stamp-only.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2221c26de1d4d83360f541f57da8ede9456f0cecf08398cfbfe11586678f1b"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/transcript-consent.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"529a3c5aa8d3ae2131b54c6e81971e34a1a3eebfc0f262fef1ab819798d51e59"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/transcript-consent.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccc0aba859ac263c0351b43b62bbcb43acfebdcd352aaa7c6186cee37f17795"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/tree-receipt.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b119affc42b53aa990e5b9d49bea142b44f7104ed8a77160720d3c06c70c4a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/worktree.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b626327b98626bf49864be3511b88b3575a927a951258ce1b75e969778226390"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/worktree.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e4ae28579f75122e96d6b56b5ee7940822b113b813510753df9c88aa79e21f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/worktree.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"09df7dfba101f0eaa87b38a510eeadd854e662959ddad351cb3d9c493a5e2c70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/config.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2189e8b25e80681148573e55fb135fa81d75a70d0235045a4f4d8037c513035d"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/import-graph.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd645bb55f7d68381f65bdf828333e5089088dddd92a265661cf200ad169a898"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/index.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebba6801839b2938e90dcf7da1bacb6694c4a0b7274ad63c8c5c3705e6d2178b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/run-scratch.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda11ecd44003e9a1ce3d8ab699eee51a55a7a480da476944596b4f2ca5522a9"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/run-scratch.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"029d6cedd8f3358086bb5f321bc62e5fe440f683e185f4e9cc87a3c46de9eba3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/run-scratch.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e549a1a9b169f42a5a50dc7f6e6878c590490633e4d005654566fb4047d6b7"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/runtime.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"343c50237ada49a6b581bb8d6874e77a953133d6c727f73a2e6dc58bc8569ee0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/runtime.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d147708ddb3c0cc1df0beb0f6add4896df60cde921678e142bb143c08cab6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/runtime.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"300cab5196500960b8c57f87b5e9eaeeb7ffa560e939fe7bc06bb85cfa4853e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/rust.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0740d0effc464f9aecda478592cefd229d4baa67e6cb6290731381271e556ddc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"08db7159454e5638438815ed0fd62239ad9b997d0fae94874e01c3affc5e3dcf"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9a9699047f306847e29a0bd2fb1eb915eda73f304bf6634ae9ddcedcf5a67b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9e0a4ad80f4020a2f22cb82426d7d8b3b6d53993a1dc4c4cfda50326b7c58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe531a7b2578a096a9f1431c861c5beece4276bad3306116b6ee6a407eb1d95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/supervise.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"790bf54e3d13c8acde8cf64606eca44087e505677400cc4c8d0106655ccdfd2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/workflows.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f63166009ba304d4132fd18f10036c5a6a796b22f276e1fd17c00f3d067eaf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/lanes.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a5d5e5654f131d13b14c21bda4ec2f18666a9c311fb36d524047684c408db3"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/literals.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76a29673b2720a45ec0731350a4935c277449768a1f1e912a2591f8584e809a"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/literals.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f0615c0f11559c1458fa4b03ebb1c66128de16add2c4980c44f3e6649977fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/secrets.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0624cf257cea3527768a67031b85d19c324ab0bf55785ffac7a86d1b59bbb29b"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pregate/checks/timing.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"806018e264ca9df71f4b9564ddb2b2824d20e92e3c01a731bb08120838f2300e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe-app.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79e21a3eb1e0c6ce450e9db4461621da98a1f2a040bbd6d2dd85b2edd10946"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cac8b0969b055b64a33bc9419cb9c906b2990401c49a1cec6253b692672f388"}},{"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":"lib/design-lint/render-probe.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6165db26611e33de270eab6b390c0a31f1e6818e21b51d98093932c265167f77"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aae6902b4d26e4ef7f4b0c119a947900615e27e9c6c36839d4ae7067bb6f0a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/design-lint/render-probe.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f147034453167d969d7675ece4a1ddb603fb2839e4547e8228f3d1f62e66906"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b104144bf6f544b65363d589fb9b665ee053a4d6c3d982549db2b63b9f04f2f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb8b88ba6b92ff1f0403c92fd0474b9f956d10baff9b5fb65b136fac4e25685"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/admission.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb7d6bbf9817e72ef695f659b8ca4a46466ee93aecfdf55228de739c6d22382"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a363dcc95e3f9b66e1f6f4aaa473fc9e495f7cb4777109293cb31898b8c67d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f93503b801e2a07797a58f1b6ab171235eeb9f2f4a4fe37f8dbe17357112ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b8fa7972d152534a742435b03e4cbb1d54a816fd29f06abbe20fa5d5d7b4df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cache.ts"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15a9b47f44d2ef74330f1b042e5f847f371966341a55f20db499998d0861d49"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4459e75b3e79434212d9c4b7a2f3e6adc12af1ada4d3d8434da5897eb4f056"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff27421c012c5f8064a98db79805b3d4be2c4db5d642f8993d275e1188d26c40"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a67a9168c8732153219faa4e975dd8e6911272d0857fb1f056876485401fce3"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"db77303041a1277b6970ebfc9f9d6cfc81d066a71e421107be00989dbe2000a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d9d8e50a5715c35dc3492d5616c5e55044d7ae6399c4881e026852b188ff7"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ff860966104aa575ba97a6c13dbab93a2e2ebd9656c845dfae632b8acf47f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5534fb95bf641dbdaada588dd108bb77f1ebcc4b5c3fe468bd019bf9dd1d603"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/cli.ts"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"053b862cfb2b8dd9fad68f378dae14220baea996a5418fa3a3a41733d4feb0d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f39dc289cd346092b4a7f7ab18b0a0e694c333c5f2e85fe373ff30da0d6e17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"16167d64dd755863b81ab11845ce2fbdd3f18585acaa1712558f9e7cd72bbd3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/docker.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9778ba2b1ded6672cc1f186aed7ddeb5e02ab020da8de3d780ebc57b2ced3f"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/history.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb20f639b5e12765506961da3a1fd1b47160711d840e1ca474ea274f1e4bdb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f07c0c799d2cb00ef5a6d896b25c31178c7c870d0ed52ea2d6b5b2312ac138c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6b9888875b3ce4920205f2a199d9f989a5fe75b4f3cf874fbfc06f3f1abf56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-container.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ff66b2cbcc773bf52c886ce0d0000b893ff10dfa19717522f7bb53437698cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"070997a53f1277397e753ae7c6e84a4647e34f3c9005ed57b4fbb981392c6ca9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cfb4ccc321c45dd64af1142dfc94bc911537530965898317cfacbef920d4d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"da967b87db48b939b7072034ab501058c44c1bab6c3bf1ecfb3ee08c753ab24c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e45ba5b5acd4652f19527de29d63aec84bbbfcdb0f4a20a1f169c080eff5f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fdd26e3b0b8bb869e5fc681b0a534073510a7546cca0ad7fe5d7897fda64df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7cdb36a19d1ebe12688429cbd363f66bb6f45ca9eb70c5600dc67e3a621045"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7552d0005b0bbe33cf45704d67316c9c6e177202564dddc217bb7aba625067cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-docker.ts"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda31c3eebf4ff614c0f3226c62227e39e3eac8ee1d6933ecc3b94542893db6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea963d6d9ba753c9f911e7317ff41a33217d3f14df0425d95077669fbd1d92c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"560aad1ab5f22f91592cae0f7dbc16afa64d93636c15989d3a421f13f7accc60"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4445109ceff544b5d903b0c42181c830892d961445357eeddfd3cf6c9287a3fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/preparation-executor.ts"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9a8334007939cea84000e9eacecfd29da90a21455e5c2686e66424353c83a2"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process-identity.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c701a529c0d51d2776a5ee194dfa45795347a078c5a7bdc38eb761d3d629f12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process-identity.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"16be3b801590c09367823992c72b32ceb6446ff0c4566823b01238b4209122ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4ff44cbb1ca77f9f37c4926b6dcf1119dcbec285ecbd29de173a0b098b3a0a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faae4e7afe578135c291aa8d77913eeb983bc35fc48daa5f53268f0d6ec0ca4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/process.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dd80bdb4613dc7b226d5a36b2757d19d9677ba7d25540155d270b08bf434fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/runtime-catalog.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c577f7e6d968a2019db2fe3956f8db3cd461819ab7479dbc75d892acc6ed36a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4d3504bdfbef80f85dca2bc4b261273044b5f58c069fd559a30a0144f491c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/scanner-executor.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2798484114c64d7beb5b7b30411f5ebc2777bedf3066beded86198c6d63b40"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/snapshot.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d43be1ea2ed028badd0a6b4a923a358fe61ddeb8c9a47b329bad81de3fe7d0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bb4ba26a163d2cb391835a4d50aeebe7772afff390269b0b730b3898d867ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd98aa0df3cb01bf8480d8034b2236130dcef3dc76cf8f61f4ac33ecd5146c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06388687e22a3a2aa244ed83923581d9c1e449cd67ede24744e1e427ceced53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e12629e6667c0db28313427757c5809b72cd90684bb00d951a6472950a6b0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5fc7164e153a51b1347094655c271a36f6cb480c1df753d7e67a116afbdbfb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"627d9a141e93607ee0746f0c18e91644550c36e3145d9a6cc43b0cd27c39776c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"304ad8788fcb1338b872173605c814a10127d88d8799911cdc711e29be76519c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3073cb91fd73cbb6ee230422b72e4c82ab08f4a7ea8a69a4b9fde5b05f8a4a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f289612f332652e87907c87c597a078b33dc417ab3e8898f1c8efc422efd2e51"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa1981fce8a786824ba49a472d2cf53dd9b6ee9ad3bbd3c76d2a3c31565bc03"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"355ddbd462222a15192a03503b5f6c2d8e036074c027e7f642bef3ed66c0d063"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/state.ts"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"278f7b117763c3e6977ac3fd319e48b8b59df3d0d544a6412c4824ff0de29ec8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee041e5531ce73b992411cb332ed1edd05ee9a6436e80877e16511ffcf0830d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/verification.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c267c5de3f3be1556809a708cc7bfde815922a611439f6ad3e212611e31655f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/windows-docker.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"89da56e0e479696e3d5bb47236101dc26c3fb9a1f544ee0ad4acd8ffd454ae9d"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/windows-docker.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8cd03bac8e3a8ec24e479c46653d94ad41db087f50f7808db234cc72bc60ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"307f3ecef175834646a0312c97b20d0ced3b914e106ce318eaf8c1a5e7b7fc6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cso/witness.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"77482d0e6b5f7b91aac789c6855c3aad9f9b49fbca3ed246d87a774dd63fae9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/code-intelligence/graphify-adapter.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"89414f10cf39e240f156b90f2b3381e43e2cc964248262d5620dbaa0d75e88d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"792b1de20d5342d79424a0b1e264e989dd18f6d25e3cbd103d0242543514aa80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9511e82d72d8229e4a9f913189971e6140b6514a2906c16ede50f3d8540d0fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fabbdc98e06de66919fc091a4dc33b8e8d37774e10362701e37f34ad541502"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/audit.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"debd646d49f3a8723939ea018926beb9876c85f5fbd2e096ea449c354bbdb05f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/audit.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71caaa2c24170d842c87fc93deece1616de2d88ad0f23559883df6fed5a48c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f38c24dae5071c18a2b91e762496f3522d0b4d027f1dd53c96c3fa428f7744"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a1ee4e4450cf9c659c691d5908d59dbaba241cf0ec5202b6790088c8e6a9a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073a66f34a6535ba2fc4d04573c3c1af02bb18207cfea8e34c2c5f165382e2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb135026a32ea6ece33074f73222cc29f54118fdfb89d30a748a55200747731"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c710567fdade0d61b432283b005dd561b6decff3dd15a544f9fe59f25913e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ffa8c2ee3860ed153e454202ee1470c1f1140e03816159e045aa50dc8a6b27"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/index.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fcaa3a210d18909749e2ac8b7ed2087e8e523401363b147024d34dd9cb1a0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/session-cache.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10b3a0b1c3da57f6a3075b85ef9f6121770d4d528204295a5d2531730acc2d9"}},{"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":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9640d2d5d676ae02fda535ab32e19aa9f7fd77c8b91ead2f33da93a877207b8"}},{"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":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dc082866d2f13d045563aa53fc0e112b652953fa070eb030921a4bfb1ae409"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3367b7f4066b2c77af6f70117e7882395aedf5b01b36bc9b7fa704e4b058ad17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/single-instance.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fde349853d68f7dadd19756a46a79dd8df07db2d65612ed1e352e54310119e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios-qa/daemon/src/tunnel-bootstrap.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa22cd15f6db91393cd7821cd37bd7b92a2f58c063845eca46eee1813b664b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/ceo-review-gate.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcc8773e7418c6cd82b3c7208167e63b3705e8e03162e5f3d5fd7f852eaab66"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/hook-log.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c175ca58e9c2e8ee0b4437b41f0b72736e97aa0ce6c5b8427b50a1051e0b2f8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/hook-log.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0433ebd544362fd60f135ddebd20421286807bdfb5731b39fdf3d36b36d86ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/hook-log.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf45c19772ed4b5a4cee753016c62ea3b75481effc1239ee05675281f38cb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"138ed3450179224cf52b19708c85b5c3ea7a9bcf7588986606ecc2a4b9862975"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bca129d1fc8028985ed42e1f77972d539f2899d94beed0e8fcf3799be8e989"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8619ddde71896baf63684fdced337e4f8b0db1735681c8cf5df30e6427eaff0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0866295c073ee8d4cd5bdcf776e960598a10d015e3a0fbeac3e6a2342a37c4a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c810f0b0bae76f3bd28bfafae08ff147af7bb3e4bc569f2ea95032fc9ba308"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/memorable-user-prompt-hook.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5243918aa889f32af74ca5e8d5075e550944177404f1ae1ac6c243dd98e3aac7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"21efd696134be373f8dd735fceb05e75b4dca7e3c2075de4b8f2bddbeac22fa5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/question-preference-hook.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc36d215afae9168644ccec59726c072b9e455742e6963ab409081a24f8207fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/spawn-bin.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e08ab3c6ad674975b94af06703ca321394a0b39344416f95bd87e50250bdb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/spawn-bin.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9919b978486501e1d173b6232cec7b80a95a8940022fd10359918cb20011b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/spawn-bin.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"144797cf153ab8cfef31e2cab5e88444bb7ec48f7591be5a88a00dac4f5a0c96"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/spawn-bin.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"894cdd712d9c4c18f871e79417676b25911747b39fbc9324a0bac222f592c66f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e9abd3c01fb406393c1099f82039acdbe62ef4923a6abb039a62b802edac1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"54127a5dbe8dd2ca8479341f57ca3e7de482dacebb57af05f10f145be9730b13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5fed1ba9d9171ad0d34e8d8fcd7cdead359e40efe364964791d1d21824a24e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a57707ae2eaadd6b96d228f1e32f34f751299a4fe754cbbdda767df0071c89"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeee35db252cbc50c0937eced772edff7292ebaab99d14b0236e092a4adff263"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hosts/claude/hooks/timeline-stop-hook.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d80417e552d90799f5f310557711f5dbca64e8d6ea52e9f572f002fa4e5199"}},{"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":"extension/background.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4057c1b5252356e55ff0f121413fcfc7caea9705d93c571c47e191839d6f2e7"}},{"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":"extension/background.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4035e4f8f894b3efa2f68455e423521ae4895a579a386ea6074625c41bd6a7"}},{"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":"extension/background.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f09d6ae5922636ea7f63fe52d3811c83e3db53e5e35bb43e463b2f1c9b0706"}},{"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":"extension/background.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1455e4442012377d3d85f528db69905dcd7f9ab5bbad5fe0a7deee2727334a60"}},{"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":"extension/background.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1728248336907f9eb1df3ba33337e4ee0ee3e7609bc7e1b8f2770ae77d8cc2"}},{"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":"extension/background.js"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18b0c0a4c8fc37f200614e1eaa8b115335210f1c31a57f6fc7e3dcbc8d97856"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2d72573f2d5b307b9fd96273b8d69f20e7ae032326d29b9b939ee6d580739c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35093604389064a6f987ae1beb6d96fe13685915f620f6e5a890cd01050bb0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2933c60260e8dad2c8d77108f7d5ec9430c636a0847aadf024bb357bcdc3f130"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad3d4f3f77e951ee11dd079921083b740e4dd03dfbf58903c53025e0e799965"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33b26b1b06ef25a7a376ae798895452ae4a18e882774cdaf43acd91c1765f8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"293fd360ac9be7252f1f95f681d2a18c396822de0f9583c5771a8d6a8494c55f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"670ad6fe4fa4503fa20f95ef19e21d9ed8fc210a273fccc03828511bf67b122b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b3d20d062f99e47e2bf4d60959d510ea543bc424a0edaa00b7d9d4f1bdffec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"3937c39bb59d447287213037bb9ad78203f23f550ca64e11e918b0946007fbc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a07bdb838490010ee89c8fb9b9fd57ea7cfb15a46ac13410c4a2f939f056f18"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b194103ed4401a8780f46ef37231d3926ea73eb935f692647d3de5325407f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed653c8df05a6c6675bdf85c424fd774bbd118ddf46ca2fdd68e533e21aea379"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d6489a1ba37495b9ae43d044ff51d06d57f142dba058e4d0bcd08e6d316321"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61bcb6162bf3086e05f56e46463c963bae44afe3dd00dbec865987061573410"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c20235d834f231732922923c3f52f036f29bbf9c3961e9b1db74debd79e137"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c15e3177ae320eb00c80ad15d11ebfc9be729fdcdd5fd108f0874b5d65945a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d638f2dffe74ce1eb3774ede1b9739aeb9b2c1d0afaf9b62ced9d46aefe45b16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"410aa022a389496b4d7fc87c497e36f7e1a95fb25cad9233f7d5bcf60ccf1fa0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0236c8497054809dbe1e0bb229d03d1bbf804b4f070f86314c794ca7fcdfa0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a9af8b3a4ccd7a7a96c01cda8600075bd3648ecb5b4bc8bb8948c7fe38e2d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9ea79853164d37cba217447d590b5ae93e953cd19eb4dc7e204a343a1a23d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c9c5beeea2d9e47f5015357ee4334ceba98f77f80e177a7554b22297a93319"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9b46ae69712bb18b6a99178941c2b33f0e1cc7d607801a43dcdad17e8bdf95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"938e48eb5e9163fec83a927d2c436ea5eb6a9b23d48817cf2cea1d5b695e5c07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"1288693ad446866c33487cd5ab306a738569b1e5fb6b71de22681acccd3bc488"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15396531fd012136a4b9504e2a3d2176ffed06348fa44e6fa2bf552e9c293f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d92ca29e51768ee31552671db121183d990d7c176b8b9aa66e74e99fa600e14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"225ce582dddfa1a044291de57eb8e84c9abf8e5200ea49a7820a17089307a1ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b520ce9bf12c9883d56981cec48ae9444ddc605c31bfe1bf10865bf6960fa483"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"890bea5bd72af0e4ed3c4e06a8b99586a97720f706cb89d8f903644a5310ca53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb594cb4665c8bca17343199834973d7a656929888eed618d492ecff1f642386"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"445cf34182b54df6a51f92efdafd77c41f4fd1b9719bd9d595fcd9355f55d583"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"79acaf2125c616cd6119f5bc1f42cb2df542ec28b67cc7dd53c210dd1ab98199"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890d5cfbfdc7f7b4a6faa315764cbf40c9ccd2b29a41d4fc78073c3991c9c2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87508e006e5c1d8ea20a06a10960220bd55bb3fdf092fe244ccee03c1713f07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a1a6b6f6af11a0b98ba613f4363d9e9b1fa1bb9ab64643de803ba1f6a0c4a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ed3604d7c67b608d0968ce05e51f4c972ad80933a9ea4e8a7974465c30ee77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1f7b90ecac3daba4a6eeddc78bb7bc019c43f6527f8f08b787ccb0fe3bf970"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel-terminal.js"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"91edf48229d59b9d60c1979d30daa005e5826cfd83f158611d46b5fcce4ac698"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97ed344f704fd48e97f53a67218870eb0bf32e71c2be634dc7515f1471512e8"}},{"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":"extension/sidepanel.js"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f07857c1ee94fdda0ca30980364e9fafd38af7d6bb4d8b0e6b964d723d0cac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/sidepanel.js"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5717d54ad7ea7e563901575d71e74456b2e7b7bc5e5e4e8226464e7db3a1a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/auth.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"38adcc4969c276a95b692919c821af3a71104be4c41fdf469fd4dd4dbb549577"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/cli.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bfbbc226e146e34b6bbb1adadb6596ce9792139caafe9aa8d93142d2b2c5a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c726f3751b1f22891f516f1e4b9d60520b276d1465f3c61cf13e442b68ee06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af1643be494bd93f2061a14350dfedc8ce6feb685392ad3a2b6e81c027c9489"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e567b803b1ea2a74bbc3a021b0f3333242e0aaf5be1e3c80ced57d00eaa7d2b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-client.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade650b457ef7493e07fc1e14ae60df7828a0a7e3145fc7a7d1bab2924433155"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-state.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"95767c98968f121505ffc30c7f152f22459ce2794a06f3898832e8b9afa72ce4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-state.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae45923a319a74925712ec3cd404e1216a17d39a9532b608bd0d06f6ac3077e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-state.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3509387f1999b64bfdad8902cb0d8ddc3903c82e6c6d35c34896f2bbddcb1d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon-state.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"94586c083167d2e64370c9be3c44c67409f9af3fdfa1039df8c5123050b6f0df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/daemon.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfffcce3d3e74301ea89a36dd63b27598961273746df260e055452e3ecdac4f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/gallery.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca7cfac0fd77c525795ba9bcb3516429012ee5ec31059f258ef166a2a3f4e87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/gallery.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2190b52e0df95e8c9574cc5147cc82c7895447d2c43c31c25d6a907530d84357"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/gallery.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e6fa0ee12d52566bffed212cbc435b4f2dcee7a4655a50596138d41fe245f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/image-args.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"324adba72079456ace5fbc8949e1cf21b841297910744f4bac2ec8ff9e244ebb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/persist.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eed18b73c16a789aaa6d8cf00b0196e882286dac969dd5d2cf126936a7b9081"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/persist.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcbaa3d4fd09da060e82514da14fcfea40d30fe4b8277ef01d1d4d4c8da62ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/persist.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8a051aeb4e19392f1b0002dd0f556ce751f0be8ab53ad5974f9745d7e4bcc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/persist.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59936163e3e77ff64593050ab23c61918e52eaef5415b1c9e8d18177417eb40"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/provider.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393b9decd1a860016d63b89640dd62a99130635e95df57827ad62ac4e0bbee2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/src/variants.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a35593aade158d8c0014b055503381a1b8b08edd00d89c2a71f3653836ebcd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/scripts/live-gemini-check.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee40e85db7ef766aa59af16a6a29e56c595cf4aeaa9db19fd576ed2c51caf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/scripts/live-model-check.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8d14c4816a3f6ee6fa17660ada4f414ce4e7f18362dd03f169a1e9a134e343"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d0315f2e4134f1d2c346136395c01abcf907034dd69a8fb4bc93f181881573"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/gate-cost-replay.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9db6122d946e7f0049443d97d3532cdb95982cef560d6a70af0b633ff494b3"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/recover-receipts.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b49b18fd652811edbede5a00966a46de626a526e40fd058cf5f74757fd78e72"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/release-cut.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"14494088a61494e1118cf90b1b5f08d01bb757e11ada882ce650736b3df2539f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/replay-pr-selection.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"edba83d7e70663b915ea6ecaac5b2b7c0c1a6aa492875f37121c3793c090b04a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-backstop.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a36c9f282ab865b217d903054b6a908b907d571f9a68e4461e168acf6a0d7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/scripts/train-gate.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d5bd747b6e7bd021cc712250917a89b75d2ec5835ea9977e8921e8d0c66177"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8179c9de7926b60a89ffa0bd6ed9e3be279d7173bcd24b0c0853220e76a7213"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-screen.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"363f8fdf3a9a239cf2eded20e9b0a7d35cdce7463125353d722da524db867493"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-gate.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8b19b9d000f9df7b97c67d0e3b360d3f3e0677b7bd2a4f58759e2a7eb837d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-land.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"defa004404a8486fcfab4345e2f699cb7e715d11cca78df9781d3e6526f0184c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-ready.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8e663517bc5c30da600263dc477460acf7535f4f6a0f1f95c7c57d65633cab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-train-record.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6d472a36217c2f1377c69831870f5905f7b8f545473dd9c5e24c765ab126a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58214ac19b727b23f415fecde2d9c49948767d9b4dd3b74377f7f4038746c8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"077cb3b1731506e410da9a76eabb2cd80a1d95e5d75067d6a9d69637b509e95f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/ship-queue-wave.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ecb4d9808d857c9638fb6a9238e3aa9266b99c9e7e94eca94a16ee84b4a6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-skills/hackernews-frontpage/_lib/browse-client.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a408687a371ca5b5272633647326c6bf883f764ca2b2fe873e8bbf1fde0595"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/activity.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0dfc751a69918936c07c68521edebdadd4816e2000ffe6354e944f0b2eae54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/audit.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d18cece8c4510b75beceed2f825a91e4a6667716e5e63f513ecbab74a5231d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browse-client.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca024dd1742dd2054f8ee7ca1f7f3ec637cd2bce30db6e1a669fb9cc5b3db32"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"be342f92e5158ca1d9e5197ec23b6d87508aec48a38a1b84b802871a96166b05"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bd1e8bd143d4d49c8cf9f24793ea752de7eac48e7ff426647c18b16cbe34a4"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b61e26617fb780fe28c8ab6c540480a50993d7bb995d8519400da6c4ce8d69d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"1595feadf627cda1ace35a8f47eb8485d6b0d17cc2cea52210602c6b35fd27fd"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4109e71a806ad2b137a08277b6ca01e8de57f5560bfd9f7f502ff353375e46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfe1c87974334dc58ccc3689e01a71bf3c48ca3a7e1104691f3f91adf50a3d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd6d2405cb1e2d8acd73b2103b9e2574ca832e54e9d08abb7da0c563289db3c"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2396d8e0517cab3bd75fb070c314f6c538e7d15a7aeac37694c558a18f34fd1b"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421dae027204249405967bfb3456e8acca874997db4c7539248a00504ce3257"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"95004d024e6daa265c20a8bc9c1af9b91f28a53cd3c5e0d474f5442d4382b4b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83cf78843f213991d9787778ccaccb8770b81870fa8cea3803f649fe7617f61"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5ac5cece7432696ca3a706015b9a8f80faa3b6c5f60497769faf6550ef184a"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"8780f7ae219b3ef7158cd08629146f9f3248cea379c1481627326d5387f33001"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"023e1429cfbc48c3dd1cd0991aed6902709742ee91f46b0ea894b70493276b3a"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"841efb6f46175e7cfbd9e84fee183bc0db184c91888d2eeb55c92677c00af34a"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c69c5c1b3464cc1073af0c0b9025b2722260c6e2f0bdc43ccae7a25185853d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"830cb71bd7a12f8bd6548520c8df2dfa6581f0f18029e7c35cf8b31388b9ed55"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"151392c54322c520f71ab52254877d6c41b8d2953e4eefb3e60241fb9c90604e"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c9595520af711e9dd4180997e0360ce58f6e2568b0761b265ad6894a874311"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1a26a33aefcb350d01a84a71755360ca0e2e3f71377cbb55e4e3d4e9d0513"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fda99f5c37a62718b29c922f25face0d99fe41dcdaf33ba5536f2779295c7a"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6121bb5b5dfb3a5ba79a556b7c7bc64b0ccec308a25a0444dd2c6d0fe29a82"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"31827f90395c4960d539e94adb583775e935d48a408f450e85258bf90c20e2f2"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b2e04be30ea3f60dacc9322d56c0fc2d6f26aa029e6a9705a580051f28a205"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3057eab30ca15a77af83dde3c2b78fb275eac9c6a0114b115db3163d95869feb"}},{"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":"browse/src/browser-manager.ts"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba15ad0b9446c72def79eb9a4937d487c335adcbf0a9aa8857442cfdf5e16320"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"219036b4a4093ffcfd948f5dac8cff3e43e7cfa7ece9cf247d76f56da9ae0afa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-manager.ts"},"region":{"startLine":2542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc502af9549d7d4b08c022feeb87c20d4b08c6db2fa426ff05d594dbbe74c44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd3327f97c7f07d4b8f129f093dfcd9df696eafa5515b7340af2454bfbdb955"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-commands.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"99040708b69bfde2e346e1cbcb6915ce072c3ce3f3038235dedb63b9ca07645e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-write.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebf80a9e6b9d0d659588c828fd1a439324def95b972d41a094a62ed87fb5e35"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skill-write.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a340b37efdde9722502cfcb625c268a98ba122511d11b86e9cd9fc9735dae0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef03e62a2547a0c99c0b46b34955748cba118a5c71fac78e6e3a711c7990af0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01aa4504c9f30f11d98646417d02da5657a1497cbe1dd512a34dde4ea2e6cd5"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0474c7945d3a85d1e2fd76803cc4fa72d2da334a95b2f694011984053877b8d5"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4036f9737b1d3e06b8b70e29c3d53c582bd8294a4555fb9df25d4541fdbdb278"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a26470d77dd67506d2fc9a5370e629774bd884b3fec949d8680866b6cac375"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/browser-skills.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f170528b68e78c5dc32adfe4a28fa4fbe65e11c24c94ce05ea398819d72aad2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cdp-bridge.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c818de3b67749a691176156c33adcec9cb6c6431697c143b9378bad47a1c88"}},{"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":"browse/src/cdp-bridge.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c3cf1a8cc545f4d83ff79e8ee5c91a343fcecdca2fd2438cc038f6965f727f"}},{"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":"browse/src/cdp-inspector.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1cd1bbb5e280a2237567a9483bf84755ad7b9c7f5730f97c2bdc8dee11190a"}},{"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":"browse/src/cdp-inspector.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bbc792a2e02b1ef4246e6e86ad4723f14438c5cea92a164e182c792d3d1b17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/chromium-profiles.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4434de6176cac53f15c12e653554350a51bfb7d56091ef6880134bd9b5a98d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/chromium-profiles.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"70df6abe901ffb36becfd2dc21581d09279bd38fcc380a977513fb2e2992c692"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7adacae6330573eb8574540e0d5de5251909d06871a4150161b61d2bb8ad1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01b29d5b1ce5d2a891817fa9167be2e2fcda2ae3b6086489ca5c6b7da3a74f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ce4cfc3d0c55f1960a3cb18aec13adc49f9e65854c5adf495ca3adfeaba16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"5369ccbe59a117054a2d7191c49c9d33e598618fa60ccf874876ada2544c2d47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa759f8a01d02acc6ea813ddb04123c2dc3cc417f15acd1926e73b88fc1f5ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"792b917d97c598afdf250bd9c116bcead73294b10b572f30dbf7d53a822e4578"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7d41fd53cc42ee99d242d0ae7ba77c35fda84326cbd2b73793b9a0c11b9032"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e512d659dbf833b9d1ebeb8c06adc2367b56735cf8277b8bfe41d58505447f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6382e29940997d9a966f5e954076a20b04dbe9656d3865c7bd74a4d5561b35e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cli.ts"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed4c734c1b6480e8a54c777fefb3763c134803c2fd0dc9ffc1c9f12fa0a2a5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/config.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8df3d470d16ca7b1084abece90c764c568553554d8617275c1ee00622c7a40e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/config.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7245c07cffd982c82d94b4e10063df5a9e0f230168272d0bffa633b058047be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc942661307430febfef8427b927560c69aa47254374482f8f05baf2eb27c6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-auth-verification.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aa7bbe8d26ff8ff5b3692c903b305186a77ca4179d7513ca1050f82e238141"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"848def295f3d2a964893848059f846f2a06c7e6db13f89ed07fb1fa71166525d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb510d1f970aab34802f829eac08412685ee7f3353fe38ee69c0a91761e3af4"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d274da79609c623c829fe31430304f24e17cad50f850e2296d65acf8aa45b39d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b718060d192d463a794e2f27e7c9f3ef66f282b5ec3197ade2221212ae11d20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9927aedec5f727c9de2da53bcc156aa2c9bf42b590067cfffc5ca169b6d449"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cae9ef18de2566be55812e8e3e72a6eb6b0080f41af3530ae9ed63638cc7681"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaafc1eb60168fd1f5057f5fcd19e284079b852d0cb5add6379cc2a41638cbdc"}},{"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":"browse/src/cookie-import-browser.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"29478b61a26a36e9f5acf980a5ffb2ee574a5a869d5e49b40930acab42b4ec2d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-browser.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f24d57bc4af95c5ce23013fdcd1530d13ea285c4bf6d56d7606a60871ec6f53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-job.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a2305b0fc03c59522af57ddd49d912c7a8de3cced1e383b9592f4b7af71d97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"078133573c2bea633ff63a6b84dcebae9a6ecd6242b91aa6a89e3135a772f25b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-import-native-worker.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8883f1032c77935a8c01b0e4ff3fa3322bf61b85ca195fdc7a96fa9b6542dfa2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0d2143641ee730d19413b716e5514f09992a47c852bc0d503029fca544d5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea90048d532a5aeafd892f20babc7985e4067be5297d29b6c26e043ef62bdb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-routes.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe904eaa7350a5e0f8e95c4605494f1d0be7808f104f0c903ab024f8908e188"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/cookie-picker-ui.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"772b4fc7ed4615cf1e47888d63587d0dfe6e0daa0bcacfb40b8cddecb71429ed"}},{"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":"browse/src/domain-skill-commands.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afd76545adda0b4c6199a6e4813fc180a784bc341a2b77ab541f5758641c1be"}},{"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":"browse/src/domain-skill-commands.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b08f2a2cef62f2f0a129081eca38567913a5ccb7a012e7e9c4327043a8c7cd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05bdd524d9a9f32923ca01ceab502851b052f928f99ec6da00876375274607e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/domain-skills.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf43136126b14af441973c60157b19d136135bfae9662c3b06d29f2525d840"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/file-permissions.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"461c4ba5feea11342b84429f8ab50d47e346f62eb14ac527c32a804733f6a8cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/file-permissions.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"80451108ac60e8455305d4660a0f96359e09464d714b2b6219d3c4908718a643"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/file-permissions.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"526de64de697e7cf7e137d21c25bcb36981446cce87929f22097368f346f6851"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/find-browse.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0e6160fe3b1c5b31fbe8fbd50e27da26176b89af15f8257a5f2e134d609142"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a49ae58fd3635518b282dca1f0371d1a07e56961f18b910fc4e2ba0ef3c899"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/meta-commands.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db2f48a13ab94960fbb4be484adfae28b4c155f399ed0f0bd7e9d40d0645fe2"}},{"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":"browse/src/meta-commands.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"73df2ebf06fc21619b925315c5b0bdc0b273b3086930896fb39f864e12e964e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/project-slug.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"181baa1d1881bd5f45ba8eea8e86dc92978f752fd978bf23c860cde4b4b691dd"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"36101f13a1346d5f0a79629d3e0b1cd58c1eadc3a2530314971cea7cb09f7d6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/read-commands.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76559a0476aabce7edd01d3fb5224210ffe2e4dbd82b27e89e4fd740337c604"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-classifier.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e69940cb8799c0063d6167348a0ed93c172f6c1d90f3ee6006a110b7e7d04b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/security-sidecar-client.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9c5a3ec73e510e2125b0140bf9e7fe7da61daa5dfd4562afd98ada67b32b58"}},{"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":"browse/src/security-sidecar-entry.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c7c343ac7711296b53c178ff2244562398c4db0fbc52e58a5e7769f5c72f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbae13583ad4f1f8786a71b3f150e1ff5a8780ecf6601ca8a0622ffe0d2d51"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1216d27d7b28d50748eb4926a6ffe3058677211cea3fa60742ab241bb28822"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d77441cb2453f1d0f0c47f002ce7cb111f6d24715bf694856630c4c972088d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce4f6a87b8574a40490677ae4838c36e0f146b2ae2d303b86c333ac30eefb4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8e7221e5786f64fafc3c0b0a86edd182371a6accf2c69d47e71f241ee0231b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f3974908ad7892cd5e54c4cf43fb1635f02e8901f8e5e3f654f409337a6df7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf7410392e16c2edc29e5cd14235fd800abaad418b54b5017e7eac073cb6487"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"775fb68e0181e507fb3dd26e7a1cab8f74e9ffcf2976c95fa45a148bfc0ed545"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd62a263138ad79fa35d0bfbe8648879a2a4326da32627d18acc966d362a3c2d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9136e853c1d07043c6ec1998dbfeec2b50f1cec72376cb5a5d96e1206e1d51"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698dd04a0b7bf5ebc5512e09e6f887dde71d55707685da94e6b28ad90d8fe33"}},{"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":"browse/src/server.ts"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"676ed6a2339c0f803f9ef98f78d72428c0d2548b7d0a62437f0ef16e425bd8bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6a2cf4eea263cae670e8e29c29ef9a4d474dc7c366b9650bf80c1812e36c50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/server.ts"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf52f47863235a6fd45f79ca0d6b91b6f0a66e9b97b8fbd788e57b5eef25ed4"}},{"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":"browse/src/session-tabs.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c09a560197f1a93e953466cab1613665a6c813fd05e78fc5c60dc0e91b555"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0304ee3ceebfdba25c437535f8e4fbe3e1e383649a58ca3d5a13da6a15fcda46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/snapshot.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"67051b71aad288a26584fb923ebade0129bd2b066473925a4c2e8604cf0b7a48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc1946586ebcbf788a5585798bba450a2821dd47ca2c3d50ad5d688c36c203"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceda5721fd81c0dfaa05be1691eae9d2d1113dbf958f9bfa05154d2fd5f3864"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5247ac1e165d8f841b77be48c57b78abaef3e5c164e3950e71dd69bd50f9e858"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc2543e0d3816ca3be9a5d6832e91cdfda3953a3f6122d3f7c68a0ee4fc9b88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9770c28d167bc29deb23a70e8da6d174f628877fd19029bdfac848bd0a24e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab80d98f8c0ee44e8f0062c5459b0afa6c7487c6f7b4267edb6caee5be64124"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/socks-bridge.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aa09b2ed8553ab5264c727acab8fb814ded8c12d51c93e21f1fd712260a87d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/sse-helpers.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c203198bedc56a42bebbd1f6dd21031722087766e0933cb288ed14dab55ac182"}},{"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":"browse/src/tab-session.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"187f04eaee8c9b9b2dad513c3577140f783638533ba649b5db0f70ddd43255fc"}},{"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":"browse/src/telemetry.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfeeeee15a053594962911f2db8dbff8fe24a0f104aeb9c214a10fb0d468f4a"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4d1d2afb653da9cf26edd74f23edeecc01b41d1499e83afa5eadc928397d5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1db2c4aebe86c473de0bcd3e7848d48e1d28cf0ef5bc48d63ef18a41967981"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2f4a8ac1690f5454acaf475138da5e5c222d781a90c33bf83466b2dc21c6c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent-control.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"95db0fb666ec4d0c9b0c37461181bd1e1a2c75621837e64ac88f7b843a678e5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"34baaa3c6c519dab518c0622628eca3aabb7ab37470ed9344731b9a1ade90809"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8ec8ed214db483aef6ad0d252b68fce1a43fc0e303c50a67c65bc15b872c23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56429f421a305df8e528144e6944a9b71f995e7d219646865f31783814557d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0c97b69a5b078028874ff9e1dd44f1b39e6193b4b308b2178c98506ce9629a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a3e8725fafd2353359e196d764280782532b9330ef7ed958002f52247ce70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f598e19fef45b3f04a054325db06ef60ab38e2d094414fa5264d6891b2f5402d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"19129bbc3a2f7644134cc91e8626c3b4054575a4eb192bd1fa8b48693af2d113"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1600134828cfa8fff81a7752e971a7ebb492065abbc62571b8f85909d9b3bdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8ba278f20a2ab0897414c1f061407fefa1e679e7ef0ff76b2c014c7d7c22ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b1097e98ceec3ca7bfa623750ca29b8376d2df987182ac1f912a2bd209fa6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"88074bf9bfa90fcd97ee94cf5c405c5caa9f8ada434dc935be8f371dcae31ea2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8394cc142a2ce52812ef9ecd34d4d062f04998f45899fe493b31d4d0208da58"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"2053749becfcf6c45d00381bdfe3ef05f5b29a1a1290df32e71cb12e27bb9d78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e5f986c483898978eea754d2cf6fd6318f342e17877da803bb94978f51255"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"5371ff92efba2d875fbff1938b222e8a4f405d450f9dc7d9819819a191fa3b7a"}},{"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":"browse/src/terminal-agent.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e81014a3d7e8a3209edc621ca5f91efd5813157f365af78198b0f4ff87064"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-agent.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e95cd66ce5594742245526d13387c6b86ccece77efb2bf8c01db39e919956e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-pty-lifecycle.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1903d6a4ac9b34a9747de7c8d5befe4f409fc106ecbf727f840df3eb11de2f17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.then(\u2026, () =\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":"browse/src/terminal-pty-lifecycle.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8585b0f7c00de315d545fa7ac92ac4b458c307f17128e96f28ce2cbac8288324"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-pty-lifecycle.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"13442d8dd678dc9e32958ccea3d39847a933bf133524c8dfb58547842b4a1961"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/terminal-pty-lifecycle.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8981496a57b17050592bbb1acc7b227ab678034fa49d75cc65df5741fc071aa5"}},{"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":"browse/src/touch-commands.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4645ac32123461af833f9292df37f6b20bfd71f259934c22d6eee68b427b1ccf"}},{"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":"browse/src/touch-commands.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0438503e3e46d3eb1a158ba267ac832430dbd888b4375f5e2bb5b34f90f42df4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/tunnel-denial-log.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6e0334fd4d0f2251d43ca4d4369248fb0174acfda6a7a49f2abb0b486b1a99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/tunnel-denial-log.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"16937571f4ba198492764c306e09dc640644efd5d1a7a0f164dc18e8146a3b49"}},{"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":"browse/src/write-commands.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33d11146b66ec032f4843bbd72fc5a7915b03bf9cc898e24c4c164829f455f0"}},{"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":"browse/src/write-commands.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eea3d97132edf00f1d647f04b6912e4fbe92e379f6a064bcdfae1b7fbed562"}},{"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":"browse/src/write-commands.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3884d062ebe76c19089b916c2691a4a4bd15373c1bea65bf0f8865ec29e8cfa"}},{"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":"browse/src/write-commands.ts"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e8555c3cdd61c840515bcddfa7187d0ec446f560b222bae96b95dfb9c08941"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/write-commands.ts"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29502ed51717e41e048a832db1a7761e7fad4056a4d2d986bb094d76f326be9"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xprotect-heal.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"52090ebc92655a20e13acb0d751ca2203b9ed3145b77bc1bf62c6f3dd88d68ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xprotect-heal.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8700aa3d60baabb0dded7fba504079411432efedca9ab66f88dd531435bd70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"546d2fe8ada176d8a457f55e3aa28ee179f3efbd17af232766b4d4294b523e1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e655ebd50380d9c50caf7b828e8836ce26bd91cc4f56d4c79214c31e7d166c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb6b392d9614401de138d39a9c25584ab5d15429cde83d6524d9738dbd986e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/xvfb.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69b18e4ac2716d7a1989d3196d32abbf01a7c0f2f6f6773bf65d2fb298ce8cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browse/src/routes/tunnel.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dfea7398cd35a2a3aecbc86ed37cb99ede43dc16dafe4c186e4be95ed60727"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~13.0 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 2153 assertion(s) across the 165782 source line(s) of the 569 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: crew/lib/ship-queue-train-gate.ts (61), lib/ship-release.ts (54), lib/eval-plan.ts (49). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gbrain-guards.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1699552b9edbb37b490190f9ab3561fcba69bd81107c23c09a1880040060b73a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gh-poll.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5764e31c9cdc266748f42e369637fbc37031b6f917207ed01305b33cb63de38f"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/harness-register.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"78977bf0673bab3e0854c685359206db4542e326c55ff984b94e23cf44f178ed"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/no-stop.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00b9af25208917862b979a5b50db1537fafbb219d57d59e88926bd6066fcb16"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/redact-patterns.ts"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3553d9153d439b987be6cff04ff8fe87830a5dec0ee1e170c3cc502845a2a84"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/review-collect.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"582371c90f80888c08550c5d637efc0b3e4ce788e314efe2faa372f3565567e1"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crew/lib/gate-cost-history.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"335fff450a1d93a67e1ec8a27cc486771b6f6a1bff6302159afaafaea7328db5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060extractVersion\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":"lib/version-source.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc583cd8a2384db08f37fe420b5e02d418c44d68ba54a685342b6f21898d2d1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060installedGstackVersion\u0060 swallows every exception into \u0060return \u00270.0.0.0\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":"lib/ship-policy.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b8282e5565522146351e98d04ff8409132f99463e73d91f187d736076f6402"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060linkedWorktrees\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":"autoplan/bin/phase-publication-hook.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc2ce8d91d08f3077d46241d247a0957b32306c5cf19ea479b8688c8777a045"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readShebang\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":"lib/script-invocation.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c04238e8d999a171a01cfdf45c845735d3d3bf300c16aad2b385dee26f569"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readJsonl\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":"lib/jsonl-store.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"109f33b7e25167022e07fd7d58927696078874c3ae1b18798d5a6f5c954a124a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060simpleGlob\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":"bin/gstack-brain-context-load.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f73e7930d04ff89ee2d140529a5e3603b3b6d8ddf407f645c88d4372c751bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060tryStatMtime\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":"bin/gstack-brain-context-load.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fcd07cb2cfe1c2373101f8a4eb25e826f285ea4a8885215e41b948ccbf4225"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readClaudeMd\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":"lib/gate-diff/git.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5080a2064e353dbc0a50ae23229f836e958184efdb014ab2046dae388807a1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeReaddir\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":"bin/gstack-design-detect.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddfdcf6140b06127d6243cdfcf74078857ddd668495f27830b3f7ffa74940ab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fileSha256\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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd74eda719fde3a1ca07bbfbb84c96a2c917fe9e8a6c10f22cbd19b94656a70c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveGitRemoteUncached\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":"bin/gstack-memory-ingest.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e47b53cf66c4d27bd26c0e5a69d004d60288ddf80ce7ab988db3c0b2a1b0a6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scanKimiCode\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":"bin/gstack-global-discover.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec7bb64f4b6db16d3f81a7315e8e7e80548cc13499b88ce15707e55f7bc2fcc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scanOmp\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":"bin/gstack-global-discover.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58e777de289a0d31e647919eb98b058e0f900cc1d0f37e62150c5ea45bdfd28"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060countAntigravity\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":"bin/gstack-global-discover.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7727987899f336e8a2208a05196813764cfe2b2d1549b7c4a2b5f279383f8dc5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPidCmdline\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":"browse/src/xvfb.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fe064b1651c4b9af43a5c12dc08f65796998466fbc86cc165d0a51ffe327d8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPidArgv0\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":"browse/src/xvfb.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d955447405325d2390cab4eb990ce4b2e0c867b778657fc31e4e6d0f184574b3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readParentPid\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":"browse/src/chromium-profiles.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0684be8753d7e8e29f58954cc9f00eaae0c24f7e5de5cd6c747c0c5923763a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readRegistry\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":"browse/src/chromium-profiles.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069970162e3e3711978e43414c3a1093f6adccb547f88c7d84d8e1dd4b775ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getRefMap\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":"browse/src/browser-manager.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b43d4592f60807626b01cbdbba098846a5068a34e61ca01540d83e02567082"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getCurrentUrl\u0060 swallows every exception into \u0060return \u0027about:blank\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":"browse/src/browser-manager.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b615c92c57ecfa28293d3462d04b11b0078f8fa6ba6d6682b884be660e9208e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getMemorySnapshot\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":"browse/src/browser-manager.ts"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f69749fe0a4f42a4ea224b029da00158e9800f0365cd2be5df30351f871ec6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060findWindowsBunExe\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":"browse/src/bun-child-config.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f57289698a1529fb6d2272edc158207b8716c447e7d391b9041bb70382aaf4a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ownedGroupMembers\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":"browse/src/terminal-agent.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a174b65942cc70efa89b7f38743ccaaa9fa807ac2b0f01ffe162d1b605270ddb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readBrowseToken\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":"browse/src/terminal-agent.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"0842e3fc98e119331140c2cf296325b24c3a1063eb931c3b649687878dcd4d03"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060frontmatterName\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":"test/helpers/skill-census.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b564ea2a96a508d87a7b5c7c5f0b303031e98e8cb62129340eb9e4450e946b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSessionLedger\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":"test/helpers/session-ledger.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8df881c3b5683c79b0f7002f7182c1839b7e030996d1ce8301be2a1aa9e8160"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060jsonIn\u0060 (in \u0060listEvalJsonFiles\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":"test/helpers/eval-store.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dd635087cef29f35f6f3c0e46cd6499227f1f9c615d07fe32843171906ca1c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getVersion\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":"test/helpers/eval-store.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1636ff6b059c243155fe5d9f7089f4979960e501eb33f5e1bca5a925b122633a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadPaidTestDurations\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":"scripts/lib/paid-plan.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"365c1be883e173477d954df38f26ff854314850421d2cefb024dea7ac866e84f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readLogTail\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":"scripts/test-paid-shards.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb11077d8517d85c7261724672ddea332c1bcb79c9b5a83a59a7d295be7eb4c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060negativesFromRun\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":"crew/scripts/recover-receipts.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a6d73dc846c98dbe4b78cccb84a9aa13c15b756f844970a7d241a7b44c7712"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOptional\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":"lib/outside-review-result.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2605ef16f7216658dabdd87571db1d491ba923b45f730681e9c5113604ea1eae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060recordPlanReality\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":"lib/autoplan-run.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0319e76e904e8e4de41eb1f76beda3068d83e5f94d0aced560f1e6e5aced6947"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readJournal\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":"lib/autoplan-state.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"163b0ce5092d3fa66f0b7ed8c87c7d737cbb3cbdc6463b7bd2dac968ede2ed1f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060newestRevision\u0060 swallows every exception into \u0060return -1\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":"lib/autoplan-checkpoint.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"46368553c848743fa8b698405ae8b2ad61188a8f2d13cf46a1bb4be3941c587e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060markerIgnoredReason\u0060 swallows every exception into \u0060return \u0022not a regular file\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":"lib/bin-context.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f77d4c83c8d8af6590783d2c8c6a806652be6be2e6ee6ad9f591c9a41d6ef4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060captainApprovalsDir\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":"lib/approval-record.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f2e44e4c8239402df5b3dde840d668066c48929c2ad2395042b618c49cf4a4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060discoverLanes\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":"lib/pregate/workflows.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f6ca1ebe40b10bf735900de48337f568a9f93b29b793558231518c7e93d8b5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060generatedOutputs\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":"lib/docs-only.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f96791e0d3fb27d908a39d06235d97399a5efa7324094d21a22ef8fafa79173"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060regeneratedAtBase\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":"crew/lib/version-gate-train.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaa79d8cfd721a17fcedca5a2c94e4415fd9407e8ed4a06986c236abce1f0b6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readJsonl\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":"lib/approval-citations.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13072ff0546bb75a221bd745400f8b0ccb02dea7adadecdf0990d5e0f2c288f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060receiptRuns\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":"lib/ship-receipt.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea822939a8dea5c37373e29ee5f5cbdecced41d73bc15f3dbd7bc9ab77e204"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060declared\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":"lib/review-exclude.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0086f978bd982256d57fc2dd1933c27bf3ad224aa9f395ee24ce6c4501164f5a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060headPatterns\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":"lib/review-exclude.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"278e920fa89c76a9937f39b02bec54f3e3eb1693fa76fbea3f2e8c1b2c84a7a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060targetedBriefSha\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":"lib/review-targeted.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ed59c1079d976f89af6230c0778f16c984c56f518b082f9fd5090ad3cca3c9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060taggedPaths\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":"lib/ship-receipt-depth.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcef511900787fc163eb82940a66ee8b133249810e3db39bfc0388b2b36bd0cf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060linkedSegment\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":"lib/ship-queue-land.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"644f48c3003d5397052831fff51f4487bb0b405abeed5ac302ebc0d7f97944f5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060releaseRecords\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":"crew/lib/release-gate.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efca009ee8f1f02cccadfb42773cc4cb56f3be5484565761eb07cc04647ab7f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runGate\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":"crew/lib/release-gate.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5210a2389588fce1291d973c96ce9c92554d2046b72b7646b9681b599b6608a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runsAt\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":"crew/lib/ship-queue-dispatch-ci.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"13086fb9e609d16e1aa67f71bfc066481593f00fe450d6445578f6d64922e567"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fileBytes\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":"crew/scripts/review-dispatch-compare.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0043adb824740ad9f0c50fd48378e9c7c34ede5f1e878523702ab48f01afbeb4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060noteRecords\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":"crew/scripts/train-backstop.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"63746904952ed6373c8a01cdee2ec7a6df31c8b5ec5bb1ac5e26a8a707f1c9f5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scenarioOf\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":"design-review/templates/preview-fixtures.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88211873af695bcd54c812fb95a9bf85a95a4a0407e811587a7994d9fcafb76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060generateGalleryHtml\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":"design/src/gallery.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedb01663f110ff870de6b8ccffb6925d38c80fa57898fe12b789982d4305050"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ceoPlans\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":"lib/ceo-review-gate.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df35088e6cffbce5ddd99bdd055b43dc6996efe88045a50c6f32c42b7e3ff9e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listDevices\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":"ios-qa/daemon/src/devicectl.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7a414c1f146ec288703481bf630be0c8e4a5ca8130e301dc2fba8856180e4c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectToolGitRev\u0060 swallows every exception into \u0060return \u0027dev\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":"ios-qa/scripts/gen-accessors.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9810b7e585930d557f24e4b0bfc83066c3a7c3cedc94e00a93fa3a136e103e4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060healthDimensions.listDir\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":"lib/checks.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"350d6d3d54fa2b191ba2b2978b7f12adbccbac7af9c79cf8b8e162351be411a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060packageScripts\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":"lib/checks.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57b45021c507614e874860bf93e0c4ac896bed36289c4d362062d370d936e71"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060retire\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":"lib/claude-code-migration.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2621004f218b18ec0d34a60c874465e1a7f03376b89eabf0ecedd37d6979b038"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060projectDirs\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":"lib/claude-usage.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33b332b5a7840ee6fe9899419d2dd1e200fca23a542a409ebf19f0e208a631"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060boundedMarker\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":"lib/cso/state.ts"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d85a82a16f7ff86161e93113536f0a1bd539de870e6da907144e5564f601608"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060linuxCgroupAdmission\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":"lib/cso/docker.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d7ab2feb3089339fcb0a929111121b00b891ded41ec28d4350bc282b31a09d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060regularFiles\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":"lib/cso/preparation-container.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c4b7aaac7f130e71db94819dc8e5ba49115a85ae9358491fd52c73f82d4e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scenarioOf\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":"lib/design-build.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b78db5dcb6553cdf25223975a0eb3f6e120f7422bdc832c1a998c1a58bb21a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOr\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":"lib/greptile-early.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04937017650d6dc274e8066cfb84e0b6929666398ebb7bf9ecf863c9472ad56"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060visibility\u0060 swallows every exception into \u0060return \u0022unknown\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/gstack-post.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aa09a710ba535f6a60460ceedc47b63cc81acb79e7c2a299db7957c7e6f667"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\u0060 (in \u0060repoReleaseVersions\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":"lib/gstack-post.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c7d22efcf0da4b977302df10252beaa6733a87d68a5a6e7e33c0896fc49f31"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060latestMtimeMs\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":"lib/qa-evidence.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d927db379726f4b7a3b6ff31eb54bdcb72b167235d211278dbd870a911e161"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060requiredRemaining\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":"lib/qa-evidence.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"84303769eaddb41fc1e00e28c926d4890ff16ce63cd13cd74c5baa959e8ede8c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060staleCommands\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":"lib/qa-evidence.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3470d470630bc68c483fa13177ade5c5b3ffefd2d01790f0e33b736dc8b34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOr\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":"lib/review-bots.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"05591770cdfd394bf8d92471adbe777272677258ce48cad803742b693f51d55d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readLedger\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":"lib/review-ledger.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"45af2d31460ab3e5e9b2705896753a92f1c3f081747454f5fc78ef8772570cc5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060redactUrl\u0060 swallows every exception into \u0060return \u0027\u003Credacted\u003E\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":"lib/review-sweep.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50641904b415981601717c0b27b256e71e18f3e81657d14ccef3252eae0c485"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060quarantineStage\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":"lib/review-sweep.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f47383508c142172bd63c1161640a1b4b052e73bff7a781af973a1ef000c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060specialistFindings\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":"lib/review-pass.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e3339f8b0c46650fd9807ecd9b140e7cc7eab0ca7778bc271182c266c675b8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060stampedFiles\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":"lib/ship-bin-common.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cd075e0dbcc3d308bc1a7424fa32d66b491aa377b5c75a6a8c8617b5f5f945"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOr\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":"lib/ship-audit.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d5e6825a3cdea353347cae0f6f94cbbaa5536902f725fe8b323195358926ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060treeStarts\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":"lib/ship-budget.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cad12079ab8541ab6d21433741d2d45a6a36f227380ddd086f67b611885726d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060unreservedDispatches\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":"lib/ship-budget.ts"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a24e94c5a83e392cc5ca84b41770917de4f81bbe11be5763910c7e19c4f43a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readCallLog\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":"lib/ship-call-log.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a730cdb3ddf37c81640b690d0f2a9080e86c166b7d8ed8b6f220bebd8232d95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readMechanicalLines\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":"lib/ship-mechanical.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894eac57997d10dfcc61fa0844d51587cf6f0242cee304f7c855680ef249343"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fixChecked\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":"lib/ship-release.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c98459b50e53af2f0364ad89bec792fad2cd313be2875588ee039940e8e33"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060frontmatterDescription\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":"lib/skill-bill.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5684a92c8481720863d9d30ace95683782d363d47d66734d5a296812521c7229"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFreeLedger\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":"scripts/eval-flake-rank.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f56b68589cf709201f12f125343b390f65855fbc73288265616f661a76449b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060enumerateCommits\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":"scripts/garry-output-comparison.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d04c3e589dd9960c6a1d97d0222a4cb7be0704cabceab642f0f4ec33b560c29"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readDesignCommands\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":"scripts/gen-llms-txt.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e82822aafbab3b866338d896c8373cedaac66c4fa099179dda451a3300124b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readText\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":"scripts/skill-bin-drift.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"25722a1cebc4c9d8226d2fb92bd5869e20816b2306c2e2cd3ebafc4519772e2b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060webFetchInput\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":"test/helpers/plan-skill-question-events.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"64943fe435e85c17f18843712a0bac77337ca66ebd0e88e38af41a1c27905f34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scopedTranscript\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":"test/helpers/plan-count-pending-question.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c15e4d8d58467447616ba8aa936a9a61a70c330422640c144cd77de7b48564"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scopedTranscript\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":"test/helpers/autoplan-artifact-recorder.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d151acb82c6f51788957b7ef032513425dbc11d3b5555d1a5aff9997f479b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060newTranscriptSessionId\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":"test/helpers/pty/transcript-cost.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbbc45bb86929f3e32eea040b206aab840a1ee102aa782484a0c3000a401b6d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ptyTranscriptCostUsd\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":"test/helpers/pty/transcript-cost.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097acf430c8e13dcfe5f4ea6579ebdeb4d623f6ff10dad74e405e76e9c3bb14"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060structuredModeDecision\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":"test/helpers/native-auto-decide.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec9fd630a6e196964ce8d68ff664b25f05800012a5456ad87bc5e0d55e84e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060codexOutsideExecutions\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":"test/helpers/outside-voice-evidence.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3b5f72d336cc5c7d69c7842a588245c1c6abb2ac63eac6ac964a4162e17ebc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseScores\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":"test/helpers/benchmark-judge.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"434a744895b74b9dd6f2784746ac46d06559d02ed0b732629cedfcab1577b8e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060succeededCommands\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":"test/helpers/codex-eval.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7852259db57da8e163f931f7ced42c24a9bdb5e3ec5a7581f8ebc671f5463d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOnlyCommandRejection\u0060 swallows every exception into \u0060return \u0027fixture root does not exist\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":"test/helpers/read-only-commands.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37b3bd71ba4cb9a0df93375eb671e6b9d00140be734bf1f2bff53cb1e734cea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060expandGlob\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":"test/helpers/read-only-commands.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f219e3c7d97be4b3d5745d3bc9ff76efcddf0da7f0701ee8dc2bd48e85b36c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060nativeJSON\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":"test/helpers/qa-checkpoint-evidence.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f63f32cf716baa611986d7431bf46ea8e0b59cfb87830fb9639d9ba0d7575d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060zombieChildren\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":"test/helpers/process-reaping.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee16d785a19bbaa6d948688ba578d239df60d6c6c7cac8bd08c3211b2ee9de8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createLifecyclePrerequisiteActor.beforeTool\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":"test/helpers/shared-libs-path-fixture.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"211decffcf9785b7a9e5d5f337214d35392e07e9e9aad11c363ff1f1519c5860"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060jsonFindings\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":"test/helpers/test-value-fixture.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8f4eb84368af5438458af6703321c4895b7128cb5ce2aca2b45642465e283e"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-310","guid":"97174724-2e33-8455-b7cd-5c3258d1cb8f","name":"CWE-310","shortDescription":{"text":"CWE-310"},"helpUri":"https://cwe.mitre.org/data/definitions/310.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-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.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-755","guid":"ac8136dd-f77c-1c5e-bdcc-3905bbad9bd9","name":"Improper Handling of Exceptional Conditions","shortDescription":{"text":"Improper Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/755.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-807","guid":"7b9d7bab-2171-935b-9279-889089164770","name":"Reliance on Untrusted Inputs in a Security Decision","shortDescription":{"text":"Reliance on Untrusted Inputs in a Security Decision"},"helpUri":"https://cwe.mitre.org/data/definitions/807.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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"}]}],"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":125,"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."]}]}