{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"ShopTab.ShopTabBody (cyclomatic 145): ShopTab.ShopTabBody has cyclomatic complexity 145 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 88 belong to 42 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: packages/dsh-plugin-shop/src/client/ShopTab.tsx holds 4 of the 45 methods over the threshold \u2014 including the worst \u2014 and 193 of the 557 points over it (35%), 4.8\u00D7 the next-largest file (registry/scripts/src/repo-state.ts at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fff6753666bfbf351aa02d45d0d36f0132dcb20410ef7babfc8b8b05b545fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"ShopTab.EntryCard (cyclomatic 62): ShopTab.EntryCard has cyclomatic complexity 62 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: packages/dsh-plugin-shop/src/client/ShopTab.tsx holds 4 of the 45 methods over the threshold \u2014 including the worst \u2014 and 193 of the 557 points over it (35%), 4.8\u00D7 the next-largest file (registry/scripts/src/repo-state.ts at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1acaf3043c3353752d7a07330869030e523a22731ea637a41544ff8bdfa114c"}},{"ruleId":"D1","level":"warning","message":{"text":"gate.gate (cyclomatic 45): gate.gate has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/gate.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"76990ad1269ca94a2cc7d03b5f45a66fa3573d3d1c1335fb543b19a8eb614b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"catalog.loadCatalog (cyclomatic 41): catalog.loadCatalog has cyclomatic complexity 41 (threshold 15). Of this number, 26 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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2333ed35a8d7732cdb28a0326271f4d55f2e168b35f5845d0c113b7163a2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-gate.gateRepo (cyclomatic 40): repo-gate.gateRepo 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":"registry/scripts/src/repo-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6a75f463b5db644cc59a1e9e1c53f7f9e2f3d4efb7c74851c7434e6ebbdcb3"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-state.checkCarriedDeclarations (cyclomatic 37): repo-state.checkCarriedDeclarations 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894fcba82399c38b93d83c81a6735d7e46432f7b62d6f3216c2d72ae3249660"}},{"ruleId":"D1","level":"warning","message":{"text":"github-stars.fetchArchivedFlags (cyclomatic 34): github-stars.fetchArchivedFlags 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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7645929daae271dd5999c99709479f41bb01e56d97b01789c1f265de3b406af4"}},{"ruleId":"D1","level":"warning","message":{"text":"icon-plan.foldIconResults (cyclomatic 33): icon-plan.foldIconResults has cyclomatic complexity 33 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ec2093a5b33607335728753239759e46f2201e768c8fb8dbf21b7f8f7f690"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-state.parseRepoState (cyclomatic 33): repo-state.parseRepoState has cyclomatic complexity 33 (threshold 15). Of this number, 27 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa9fbad2118272bc9b24ac60c71d2cf78bf5bd192f86e8fc64213f36933c89e"}},{"ruleId":"D1","level":"warning","message":{"text":"github-stars.fetchStarCounts (cyclomatic 32): github-stars.fetchStarCounts 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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"83799047bb6831e16b4d08a963d7e00911fe4d08911746e83dc6d577c5c5ca35"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-manager.outcomeByRule (cyclomatic 31): plugin-manager.outcomeByRule has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/plugin-manager.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"313d3b1c602acd4382dc82e949c0b532cd7807dc56facae9f1fbe19efe1e3317"}},{"ruleId":"D1","level":"warning","message":{"text":"feed-state.parseFeedState (cyclomatic 30): feed-state.parseFeedState 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d750ce033220a9514d44ed751445e17fe540ecbc9082c05adbcb4c24243f84"}},{"ruleId":"D1","level":"warning","message":{"text":"ShopTab.InstallPanel (cyclomatic 29): ShopTab.InstallPanel has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: packages/dsh-plugin-shop/src/client/ShopTab.tsx holds 4 of the 45 methods over the threshold \u2014 including the worst \u2014 and 193 of the 557 points over it (35%), 4.8\u00D7 the next-largest file (registry/scripts/src/repo-state.ts at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43543939ceda1770d0a71b0ecd1e2daa9bca01e239dff6a0255efeeb482927e"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.projectRepoCandidates (cyclomatic 29): github-client.projectRepoCandidates 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d038e53bca295653a3ea1fb45b3c7f250711ca3edd53abafbf74db577eed767"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-client.toCandidate (cyclomatic 27): npm-client.toCandidate has cyclomatic complexity 27 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 10 belong to 8 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af36acd63743a40bf5449a3e3bbafa09d77e57b26eaa0274affec464b291cc"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-feed.harvestFeed (cyclomatic 27): npm-feed.harvestFeed has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-feed.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f7af2b0b1103afbebc94348bba2e28b97971a62beae2c2315cbad1dc1eb45c"}},{"ruleId":"D1","level":"warning","message":{"text":"llm-client.runBatches (cyclomatic 27): llm-client.runBatches has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 226, 247). 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":"registry/scripts/src/llm-client.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e5ef23b87fa3449cb7c1bf465c301a2ad14c330c347520f8db67c518e6c418"}},{"ruleId":"D1","level":"warning","message":{"text":"ShopGateway.install (cyclomatic 26): ShopGateway.install 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50428ae31425cdcf1ae4aa31a80cbc79651f73305eb5619a5cc9e9ea1b900e8"}},{"ruleId":"D1","level":"warning","message":{"text":"tier.assignRepoTier (cyclomatic 24): tier.assignRepoTier 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":"registry/scripts/src/tier.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"60142f66498315c96eb64da9b4e854bf46d42a2808687a8b3e4588c9dee379b1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.apply (cyclomatic 23): index.apply has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 7 function items inside it that branch (hostCatalog, openDshPluginPage, version, \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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f244f3c24a4c2367316d80d01a9df14f841b53388567994486ca2108c90ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"ShopGateway.setEnabled (cyclomatic 21): ShopGateway.setEnabled has cyclomatic complexity 21 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"980fd63327a14b8897a58e9f699d6a3c447c1e2cbfd6d3a45a34d802803c471c"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.harvestOnce (cyclomatic 21): github-client.harvestOnce has cyclomatic complexity 21 (threshold 15). Of this number, 18 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d8bc3c6ea9e50d5b2d7670a17c236319f31d0154465a252bb246cf2a1d377a"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.rereadCandidate (cyclomatic 21): github-client.rereadCandidate 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2880}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b41a14e7dd2b78d715a15bba10260a7f959409790829204866f31d92dc311b"}},{"ruleId":"D1","level":"warning","message":{"text":"icon-normalize.jpegSize (cyclomatic 20): icon-normalize.jpegSize 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":"registry/scripts/src/icon-normalize.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6255c7d9e5f4f14318f773f1220ec88c86fcabd884e0a09ac22c5dc90b4ffbd4"}},{"ruleId":"D1","level":"warning","message":{"text":"hot.parseSimplePatch (cyclomatic 19): hot.parseSimplePatch has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fddf7944ea6b82bb3a5ac29f94411a6402c9f20ca7fa4de2702015091748b8"}},{"ruleId":"D1","level":"warning","message":{"text":"hot.hotMount (cyclomatic 19): hot.hotMount has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb35ead04f54b1f83e2ea5d04c1332030a008417c2ba9cfc7930d84b61a70938"}},{"ruleId":"D1","level":"warning","message":{"text":"state.isRollbackRecord (cyclomatic 19): state.isRollbackRecord has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8419ee4f80f11ff34ef382d3cb94f908c08cdd4daeff2ad8555548551183d145"}},{"ruleId":"D1","level":"warning","message":{"text":"state.readShopState (cyclomatic 19): state.readShopState has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17bd978e7c1d0f9952cadc5e102be15f340c76fdb9c13bb1f67706825b3fb98"}},{"ruleId":"D1","level":"warning","message":{"text":"ShopGateway.installed (cyclomatic 19): ShopGateway.installed has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5317d3104934973e1b84bf40eaf21b1c5ed7fdf414dd080c3634447c6f93369"}},{"ruleId":"D1","level":"warning","message":{"text":"icon-declaration.resolveExportsSubpath (cyclomatic 19): icon-declaration.resolveExportsSubpath 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":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3230ffc225fccd2309a100cc59079a0138ac8a0351f8bcb88aada1ae838b88"}},{"ruleId":"D1","level":"warning","message":{"text":"feed-state.parseFeedRunReport (cyclomatic 19): feed-state.parseFeedRunReport has cyclomatic complexity 19 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"07539a55eb2635d653b79ad4bd8205a48a99d6264c38367161fff3f0f60d822d"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-client.searchByKeywords::keywordRun::runFeedStep (cyclomatic 19): npm-client.searchByKeywords::keywordRun::runFeedStep has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (npm-client.searchByKeywords::pageCell) 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b454492b9a7d31208f4bbd9e86b44860d4b5b2f74ae7921cca4c752b921a3cf"}},{"ruleId":"D1","level":"warning","message":{"text":"tree-size.treeInstallSize (cyclomatic 19): tree-size.treeInstallSize 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":"registry/scripts/src/tree-size.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b54be392c486dbcca9f7a189843ba12d482c8ddd0a8d7cfec2db3d8b2cb3b3"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-client.searchByKeywords::pageCell (cyclomatic 18): npm-client.searchByKeywords::pageCell 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 (npm-client.searchByKeywords::keywordRun::runFeedStep) 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e929090d322a1e19dd6cdf8198b863a9b263a2b5bf5129a4992c23413aed3f"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.searchReposByTopic (cyclomatic 18): github-client.searchReposByTopic has cyclomatic complexity 18 (threshold 15). Of this number, 10 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7528768da05cd1f753d921ed0c0207345238b4fb1eedecf4ad72b615ebb2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.probeSubpackageCandidates (cyclomatic 18): github-client.probeSubpackageCandidates 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb0ba1be30363ab07ad29154e581da1c008bcd23d7fe4f6f46234eabc91d25"}},{"ruleId":"D1","level":"warning","message":{"text":"executor.spawnPluginCli (cyclomatic 17): executor.spawnPluginCli has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 884, 838, 935, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb161fe30a54c2332c2a61c365df1dacb3c6d3a3bebce8afd2332c040c9938d"}},{"ruleId":"D1","level":"warning","message":{"text":"ShopTab.OutdatedSection (cyclomatic 17): ShopTab.OutdatedSection 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 3 function items inside it that branch (updateAll, a function literal at line 1782, a function literal at line 1822). 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: packages/dsh-plugin-shop/src/client/ShopTab.tsx holds 4 of the 45 methods over the threshold \u2014 including the worst \u2014 and 193 of the 557 points over it (35%), 4.8\u00D7 the next-largest file (registry/scripts/src/repo-state.ts at 40). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4515955e07f6ea1fb604f3776daa82f1635a033f0b24e867508c0a4dbf6f15"}},{"ruleId":"D1","level":"warning","message":{"text":"subpackage-select.selectSubpackagePaths (cyclomatic 17): subpackage-select.selectSubpackagePaths 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":"registry/scripts/src/subpackage-select.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4299e7921bc14bd87a37d131d63b12dfe1f5c3aff50c01b52f487e1f8c15ebdf"}},{"ruleId":"D1","level":"warning","message":{"text":"icon-state.checkRow (cyclomatic 17): icon-state.checkRow 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":"registry/scripts/src/icon-state.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18964083375cb61404aebb1c645e0c6636caeb6fd805217d0c7f8f3de8372f0"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.fetchRepoCandidate (cyclomatic 17): github-client.fetchRepoCandidate 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fe8554d446e924af7addb0ff90f5100a4100f405d5712996d481f2c424855d"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-client.parsePublisherAxisReport (cyclomatic 16): npm-client.parsePublisherAxisReport has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27b06566267eaf95d3108b7fdbdb572acccad3662758c5c31558180cef5da0"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-client.compatibilityOf (cyclomatic 16): npm-client.compatibilityOf has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"22adef0836c627935b0579e13b38d88ac7b737f3b0fa1cb12d0d6c625ec99024"}},{"ruleId":"D1","level":"warning","message":{"text":"npm-client.normalizeLicense (cyclomatic 16): npm-client.normalizeLicense 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a311f4ac47a4de25a23d13fc59ac500a63b8fbd8e9aaaeef344456f56ac52db6"}},{"ruleId":"D1","level":"warning","message":{"text":"github-client.writeDeclarations (cyclomatic 16): github-client.writeDeclarations 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7ee60b7bf3b48728c2e6d7be9f2b7926d219065b472662413bb0eba3458a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopTab.ShopTabBody (cognitive 162): ShopTab.ShopTabBody has cognitive complexity 162 (threshold 15). Drivers by points: if/else 49 (61 pts), ternaries 31 (51 pts), boolean chains 36, loops 5 (8 pts), error handling 6 (nesting depth added 35). Of this number, 53 points are the body\u0027s own statements and 109 belong to 42 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4581754bdd6783454df9f54ee0977cf00de7816c09ed1ba12c875979d41d00"}},{"ruleId":"D2","level":"warning","message":{"text":"github-stars.fetchArchivedFlags (cognitive 80): github-stars.fetchArchivedFlags has cognitive complexity 80 (threshold 15). Drivers by points: if/else 12 (28 pts), ternaries 6 (23 pts), loops 8 (18 pts), boolean chains 7, error handling 2 (4 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-stars.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ac5c5db8de1911257aef1059bab6e36b8ea9244c6bdebeec81560e0bdeece1"}},{"ruleId":"D2","level":"warning","message":{"text":"github-stars.fetchStarCounts (cognitive 73): github-stars.fetchStarCounts has cognitive complexity 73 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 9 (21 pts), ternaries 5 (19 pts), boolean chains 6, error handling 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-stars.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dd236146b132e3ee0e926f501e90e087519997f8f1c7fe36380f3077449fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"catalog.loadCatalog (cognitive 60): catalog.loadCatalog has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (41 pts), error handling 9 (15 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 20). Of this number, 39 points are the body\u0027s own statements and 21 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d575e569336c64735f18b13961e515de224a23f357e4ff96810d4f3f64f07"}},{"ruleId":"D2","level":"warning","message":{"text":"llm-client.runBatches (cognitive 54): llm-client.runBatches has cognitive complexity 54 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 7 (16 pts), ternaries 3 (10 pts), error handling 3 (6 pts), boolean chains 3 (nesting depth added 30). Most of this is not in the body itself: 11 of the 54 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 226, 247). 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":"registry/scripts/src/llm-client.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"301ad06d6db35eb4f18c1f18fe7b14707e68dca96ea34592f57ac68e5e3d834a"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-gate.gateRepo (cognitive 53): repo-gate.gateRepo has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 13 (18 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/repo-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c544bee4bc04c1981c0317ceb6dac4708c8dd95095573d7014158733aca2dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"gate.gate (cognitive 52): gate.gate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (30 pts), ternaries 9 (12 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/gate.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6280d2c3c4721421b80161a07580a32005db6f1724923ccec810558c5d0f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopTab.EntryCard (cognitive 48): ShopTab.EntryCard has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 33, ternaries 6 (15 pts) (nesting depth added 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":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a760abbe804ed583cd61ed7db7ea7906b1bbece3f904037469b848d05f9af7"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.harvestOnce (cognitive 48): github-client.harvestOnce has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (28 pts), ternaries 3 (12 pts), loops 4 (5 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 27). Of this number, 41 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f536e4ec4431e6bf1fb9e50fc26e80b2f9508fef5af2a55326de7584386800"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-manager.outcomeByRule (cognitive 43): plugin-manager.outcomeByRule has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 7 (16 pts), boolean chains 9 (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":"packages/dsh-plugin-shop/src/host/plugin-manager.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b3cc269ef6bf86d25b4f11b21ea19c317adf988807714696c7b210909d7285"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state.parseRepoState (cognitive 41): repo-state.parseRepoState has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 11, loops 1 (nesting depth added 15). Of this number, 33 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/repo-state.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c696cf1f16d7d4842ed63e473fb4f5ec32b6da3f5e7364a65d9180a88ff0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.searchByKeywords::pageCell (cognitive 40): npm-client.searchByKeywords::pageCell has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (7 pts), boolean chains 4, ternaries 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. This shape REPEATS in the file: 3 other methods here (npm-client.searchByKeywords, npm-client.searchByKeywords::keywordRun::selectPublisherCells, npm-client.searchByKeywords::keywordRun::runFeedStep) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f977fb00eef169b49b68c9e7605e361356e66242e1ec9c9671ea452c522fe236"}},{"ruleId":"D2","level":"warning","message":{"text":"icon-plan.foldIconResults (cognitive 40): icon-plan.foldIconResults has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (30 pts), loops 5, boolean chains 4, ternaries 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"58269e4680a77d978bf68c8b11f518c030a9015035caaea286cc7af2f76402ba"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.projectRepoCandidates (cognitive 39): github-client.projectRepoCandidates has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 8, ternaries 2 (7 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b52f9a8a9818c129f12e8423597553d2c02ba16210c2665c2c53a00f70e8c6"}},{"ruleId":"D2","level":"warning","message":{"text":"feed-state.parseFeedState (cognitive 38): feed-state.parseFeedState has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, ternaries 3 (7 pts), loops 3 (4 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a4b9cff840e446cd786d83ac435233d52f3131be01381d7988e639726a6c5"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-feed.harvestFeed (cognitive 36): npm-feed.harvestFeed has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (7 pts), boolean chains 5, error handling 2 (3 pts), ternaries 1 (nesting depth added 13). Of this number, 33 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":"registry/scripts/src/npm-feed.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c019baf31e9e643544a366a5504126265e9153279e5bca543bb00121f7ec144e"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopGateway.setEnabled (cognitive 34): ShopGateway.setEnabled has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 4 (8 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"4223f1fdd1835b718165884d35b09a866756582d9b8f95a45656303097437a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-state.checkCarriedDeclarations (cognitive 33): repo-state.checkCarriedDeclarations has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 19, if/else 14. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/repo-state.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dea9f7f395dbeb9c276d47b6597361faf4dd33ee3ab87ae9ec459b94dbae05"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.searchReposByTopic (cognitive 32): github-client.searchReposByTopic has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (39 pts), loops 5 (14 pts), ternaries 1 (7 pts), boolean chains 2 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (github-client.searchReposByTopic::pageWindow) 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec56077cae54c41120bc90ac7285c95102bd7cb3b6778ccaa687f8179cce66"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopGateway.install (cognitive 31): ShopGateway.install has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 9, ternaries 4 (6 pts) (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77f4037e14d048eb06f1a9b3939520ac0f799a7f95dd456cfe83b6b4e6f530a"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopTab.InstallPanel (cognitive 30): ShopTab.InstallPanel has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 13, ternaries 8 (12 pts), if/else 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f10f88280e39faa8890e93fba8bf949e3cb536fe19df5dd8a79967834fc636"}},{"ruleId":"D2","level":"warning","message":{"text":"state.readShopState (cognitive 27): state.readShopState has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 2 (4 pts), error handling 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaf69aa35296ed6c078722371beeb032612cecc6188e1a4b822eddc290ead6e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.apply (cognitive 27): index.apply has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (13 pts), error handling 5 (8 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (hostCatalog, openDshPluginPage, version, \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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b02ddc3c40f5f444f7cb085e76b4cc1a9a0cf68559aad3999a429063122b10"}},{"ruleId":"D2","level":"warning","message":{"text":"hot.parseSimplePatch (cognitive 26): hot.parseSimplePatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 2 (3 pts), error handling 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18191a89041409f766ba418ca7c65215b51aadd2070c0438ae6c52cdc3f1b04"}},{"ruleId":"D2","level":"warning","message":{"text":"icon-declaration.resolveTarget (cognitive 26): icon-declaration.resolveTarget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf526a0e084dc16e8fef3c17c455143c92639c6170c759d57e6c945b01aa17a2"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.partitionKeyword (cognitive 26): npm-client.partitionKeyword has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bc959d77628be6cff4563c4a71477539e67d91ddccc1aabea218a7aefc7e70"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.probeSubpackageCandidates (cognitive 26): github-client.probeSubpackageCandidates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, error handling 1, 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c4e2e6bed38bf05546f41d2b9aa45a57ba284aefe83e58115e3d3e97237cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.rereadCandidate (cognitive 26): github-client.rereadCandidate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 4 (6 pts), boolean chains 4, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":2880}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb00fda88669b44511d0d1bbc9e0447ef48568517e2913a3ec7bf7e5dd5a9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopGateway.installed (cognitive 25): ShopGateway.installed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 3, error handling 2, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 20 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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe8606e4a035a2d3a5edd0e5ddf9108436b5461911dbe8b158b25a14517105b"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.fetchSearchBody (cognitive 25): npm-client.fetchSearchBody has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 3 (11 pts), error handling 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d48714e6813ab3c043ea96a82d554fdbcb00684fc13adee8eae9ac385dac853"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.searchByKeywords::keywordRun::selectPublisherCells (cognitive 25): npm-client.searchByKeywords::keywordRun::selectPublisherCells has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (npm-client.searchByKeywords, npm-client.searchByKeywords::pageCell, npm-client.searchByKeywords::keywordRun::runFeedStep) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5991a004e4c35f5569cd5dba2e248793290257f1fb9f157369d09d43163e845b"}},{"ruleId":"D2","level":"warning","message":{"text":"tier.assignRepoTier (cognitive 25): tier.assignRepoTier has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 17 (18 pts), if/else 3 (4 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/tier.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2126b88ca4c30cde8adf45c426e68035d861d313d45aca8b28649ed9b49141c"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.normalizeLicense (cognitive 24): npm-client.normalizeLicense has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 1 (2 pts), 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e356a3457881c125d84018d8ea877d880513f7e1f10d1b5ca6fe4a395b64307"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.searchByKeywords::keywordRun::runFeedStep (cognitive 24): npm-client.searchByKeywords::keywordRun::runFeedStep has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 6 (10 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (npm-client.searchByKeywords, npm-client.searchByKeywords::pageCell, npm-client.searchByKeywords::keywordRun::selectPublisherCells) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"763192f83aff71f92627d7c576ce06fd664d5d16faddca690e739466b074220f"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.fetchRepoCandidate (cognitive 24): github-client.fetchRepoCandidate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (6 pts), error handling 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 9). 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f13f9c9dc5516a36fdfbdbe06e76fb8a8986176eaf854a8b5906009ddfd5c31"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.toCandidate (cognitive 23): npm-client.toCandidate has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 14, boolean chains 5, if/else 4. Of this number, 13 points are the body\u0027s own statements and 10 belong to 8 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8da05a13df167dfb0594a612af500e75a8c43298f77f20b0d3a16fd9bf8ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"executor.spawnPluginCli (cognitive 22): executor.spawnPluginCli has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), error handling 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 4). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 884, 943, 838, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eca847e86bc52b8df70ed99493eb9df2f2194f605530133847237b1cc18ec5"}},{"ruleId":"D2","level":"warning","message":{"text":"release-asset.patchInsertNames (cognitive 22): release-asset.patchInsertNames has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 2, 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b665041d418bd4d7dae944cbd5bf3ecbb3f2110394f1dc58fb900c90fcef82"}},{"ruleId":"D2","level":"warning","message":{"text":"icon-normalize.jpegSize (cognitive 22): icon-normalize.jpegSize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-normalize.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95ab19eaf2ed8ac117ed8a1dc33a88491902189f563bbcb039271caec2b4cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"tree-size.treeInstallSize (cognitive 22): tree-size.treeInstallSize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/tree-size.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7410193478eba5c550d1b6478ba4408607393add796929f199fdb2a34e41486e"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.writeDeclarations (cognitive 22): github-client.writeDeclarations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 4, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f126fb624a6f465b83978471bd53b5271e82408065c7fdfcaf7ba61eea5a29ca"}},{"ruleId":"D2","level":"warning","message":{"text":"hot.hotMount (cognitive 21): hot.hotMount has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 4 (6 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"47172c30cc8a408384e4a91f6efd96c048c58452004bcb6792f62eb249f62fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopTab.OutdatedSection (cognitive 21): ShopTab.OutdatedSection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (6 pts), boolean chains 5, loops 1 (nesting depth added 6). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (updateAll, a function literal at line 1782, a function literal at line 1822). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f6409ab6c65724ff94f606df25b2c043c45cf328d44b908026a2a9a7f50dfa"}},{"ruleId":"D2","level":"warning","message":{"text":"icon-declaration.resolveExportsSubpath (cognitive 21): icon-declaration.resolveExportsSubpath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aec8a508a9d97e432785757ba2777c93f1f8ec5e4093d152cac3842f623ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"feed-state.selectFeedIds (cognitive 21): feed-state.selectFeedIds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be783563253481bbd43621e43f682af2549781d0a37c8ca95a82bc50443adb8"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.binNamesOf (cognitive 21): npm-client.binNamesOf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts), 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56f2e9dd2dcb4a8c52da73f2a0e323b9b7b64d8c01f869c2a487bafd2af6bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.rereadDeclarations (cognitive 21): github-client.rereadDeclarations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a62028547f11f1269f0e6e66cf70b67b5695befd53617acc3a68249e42bc1a"}},{"ruleId":"D2","level":"warning","message":{"text":"peers.incompatibilityMap (cognitive 20): peers.incompatibilityMap has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (4 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":"packages/dsh-plugin-shop/src/host/peers.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45b274c6efb02b6114b44ce5ae121c9529a760958b9f9b28d823c08c4afc861"}},{"ruleId":"D2","level":"warning","message":{"text":"icon-state.checkRow (cognitive 20): icon-state.checkRow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 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":"registry/scripts/src/icon-state.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"02803a146e4bc66a2fb5203ef1fdb924e27220c33244ed639af3417d90057f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"classify-select.selectPending (cognitive 20): classify-select.selectPending has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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":"registry/scripts/src/classify-select.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"958c231b2e180498f1551282484fb6a2195839b2bbef384d091f9d4cfb0ad0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"install.validateInstall (cognitive 19): install.validateInstall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 2 (5 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":"packages/dsh-plugin-shop/src/host/install.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"044b2dde93f8a8d703d88d0e44cfc4cf71e31c09a6b8f19ca4bec6e8a0ada124"}},{"ruleId":"D2","level":"warning","message":{"text":"restart-monitor.startRestartMonitor (cognitive 19): restart-monitor.startRestartMonitor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (8 pts), error handling 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (probe, a function literal at line 266). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/restart-monitor.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca194c389ef63d7e37630d17f83be347780c1c1bcf0bde3bf8e5a334a54a24d"}},{"ruleId":"D2","level":"warning","message":{"text":"ShopTab.RollbackControl::run (cognitive 19): ShopTab.RollbackControl::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5733b6c0515c62064c8891b3f461dadb18fc84106a9b723455fb53d4ff43928a"}},{"ruleId":"D2","level":"warning","message":{"text":"subpackage-select.selectSubpackagePaths (cognitive 19): subpackage-select.selectSubpackagePaths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, 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":"registry/scripts/src/subpackage-select.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ee357fe726371f92324215bde0d5c9a417f380b22011a1f332948d89b0d1be"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-origin.npmOrigin.probe.load (cognitive 17): npm-origin.npmOrigin.probe.load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 3 (6 pts), error handling 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/npm-origin.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47958fec41b702213cac1bbc7a6c63bc15593ffe755474c8e73531b3adfd93a"}},{"ruleId":"D2","level":"warning","message":{"text":"catalog.validateEntryCoherence (cognitive 17): catalog.validateEntryCoherence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aca4fa06637ec5d3b39d5f2e85afb9c37a01bc0a01a0220607fa55b4bb943f5"}},{"ruleId":"D2","level":"warning","message":{"text":"present.reduceInstall (cognitive 17): present.reduceInstall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (8 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/present.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccde69532625675cd05b566193a03fa837e4dc8740aa5e7d2574b6ae6f3e9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"config.parseRegistryConfig (cognitive 17): config.parseRegistryConfig has cognitive complexity 17 (threshold 15). Drivers by points: loops 7, ternaries 3 (6 pts), if/else 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/config.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34e1a05832bf7a3afb87621b9799ae63f921251de65f497278413653154b95e"}},{"ruleId":"D2","level":"warning","message":{"text":"npm-client.searchByKeywords (cognitive 17): npm-client.searchByKeywords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 46 (90 pts), loops 23 (35 pts), boolean chains 12, ternaries 6 (11 pts), error handling 2 (3 pts), match/switch 1 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (npm-client.searchByKeywords::pageCell, npm-client.searchByKeywords::keywordRun::selectPublisherCells, npm-client.searchByKeywords::keywordRun::runFeedStep) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce04d7e95cf68a1de3e91b49bbd182c1a498f893acb79bcdcf394ca9d58b97a"}},{"ruleId":"D2","level":"warning","message":{"text":"release-asset.verifyReleaseAsset (cognitive 17): release-asset.verifyReleaseAsset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, boolean chains 2, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/release-asset.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"1671454c52835d9ef7f870147358bd75910b354f549490e8f56f9223ca4a1b40"}},{"ruleId":"D2","level":"warning","message":{"text":"executor.refusalDetail (cognitive 16): executor.refusalDetail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"58192542b109e89ab68ebf7f22a464a25692550832e2f3171dae403cd5fd4862"}},{"ruleId":"D2","level":"warning","message":{"text":"release-asset.archiveCandidates (cognitive 16): release-asset.archiveCandidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (4 pts), error handling 1 (3 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"909cebf2a093e069856c6b633c25ae82f85d1aa19c77030a4bfe442d51668dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.unmatchedRegistryNotes (cognitive 16): pipeline.unmatchedRegistryNotes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (4 pts), boolean chains 3, loops 3 (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":"registry/scripts/src/pipeline.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dd2e3c7216662c637f0c3999fdf23671c39d5882c46cd71540d6a222e4a608"}},{"ruleId":"D2","level":"warning","message":{"text":"github-client.searchReposByTopic::pageWindow (cognitive 16): github-client.searchReposByTopic::pageWindow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (github-client.searchReposByTopic) 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"63129092e653c4b9a44b456a7730a34e17939456345e42ded221944f68af79ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/ShopTab.tsx: FileTooLong \u2014 1951 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1451 over it, 3.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8688779ecf26a4e1e608585abbb98e82a8103e6cfa6aedce8d32f508001de8c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/github-client.ts: FileTooLong \u2014 1122 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 622 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"158a588b723c8dc27e5c875ac40a2071c8c3072b9225e0b55a6060c6858a2f26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/index.ts: FileTooLong \u2014 1098 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 598 over it, 2.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598a9f42b988993cdf578f723b4d7badc75e110c1b6213393bb8fbfb2ea51d75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShopGateway: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"613750ca4d37b2555a89bc37c544e701966242de6cf2aaa6e0270bf1dbe59c3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/npm-client.ts: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 528 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e2c63aa6c923ee9fca3dbdfa9cab4b0ab271f90179c1a90ebe6a6b8680e2ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: catalog.loadCatalog: FunctionTooLong \u2014 loadCatalog runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb4e96197c35e76a2cd97190983f4e15513766a774ca983a8154af5a9bcafd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.apply: FunctionTooLong \u2014 apply 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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"824bdf1d5ee1546f79b0e279af3eefcea5d6772ee84cd85cf9543b568333259d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: executor.spawnPluginCli: FunctionTooLong \u2014 spawnPluginCli 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":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e8485976055b5aa3e097ff3cba3fa386d9e31a4078193b2d836d9cbd160372"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page-store.createPageStore: FunctionTooLong \u2014 createPageStore 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":"packages/dsh-plugin-shop/src/client/page-store.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1eba5fb2b47b59433225e0ba5be9a38576dee2aa570afbe9d7fe27a813d4ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: github-client.harvestOnce: FunctionTooLong \u2014 harvestOnce 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a073d34327d740c559b3bab18fa12b105769d916556b8819163ff88651e48a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gate.gate: FunctionTooLong \u2014 gate runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/gate.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"070764f8efbdb10d1f8ba8c7533578f75790ebfc87a71c6d5e5191ac363eaf33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: prefetch.createPrefetcher: FunctionTooLong \u2014 createPrefetcher 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":"packages/dsh-plugin-shop/src/host/prefetch.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"343c7d1e7e19c3126fee733040a69902605c6a4e2d7724c97e162d7ebae591df"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: never throws and never counts a declared entry twice: 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":"registry/scripts/tests/icon-plan.test.ts"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa39a1a83c4db04cac14be3a631ef7644f4b606faf4308432920b9aa4627b41b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: records a helper that could not start, instead of raising an uncaught event: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/tests/host/restart.test.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f794a1e20626662c6260aeca1c42e575e4c9ac2e9f4c370a4e7d44edf39893d6"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: runs a task after every command already queued for the same profile: This test starts work it did not wait for (\u0060second\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 0))\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":"packages/dsh-plugin-shop/tests/host/executor.test.ts"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a10e367e1d99e62e3bbc2e414a90b609741e1b6843fcd25123f22c70151ab8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: drops the warm catalog once another process answers: the old one\u0027s verdicts are not the new one\u0027s: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/tests/client/apply.client.spec.tsx"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"201531a4965940eef4921dba51ba8f5c91eeaae636fa7ee7b06c2212073a483b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: keeps the restart it is watching when another is confirmed, its clock included: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/tests/client/restart-monitor.client.spec.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c2827d63642e2a9711bf885c02f65eacc97584c7eb69b57d241f6c7fb972e5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: asks again at once when the replacement registered before the old mount was torn down: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/tests/client/restart-monitor.client.spec.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d2de8bc99494fe7e62755302b23e5c2df8cf545d671617e1731d2bff1abc15"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: prefers the newest registered path to the pressing tab\u0027s own: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/tests/client/restart-monitor.client.spec.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7db42992d07f9ea70f0c3ee949b66374f05ef092f50189e6b6de49abd3eaa9"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-android-arm64: @yuku-codegen/binding-android-arm64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2654b8b35eb8da6427df6e189c828438739a5cb15cb64079ceeedde962b0e36"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-darwin-arm64: @yuku-codegen/binding-darwin-arm64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"241111a12bb64f2569167a84483c88964770037aa8a92e59c4c52f889b05b344"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-darwin-x64: @yuku-codegen/binding-darwin-x64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bff91757e2d0553d9d10d3f1dac892cdaaa9c0f0c9f074e06f9b57a6990a43"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-freebsd-x64: @yuku-codegen/binding-freebsd-x64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbc07026361dda16c12c4f0f685e7d601d4bdd8ed73472421c70871d23bc59b"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-linux-arm-gnu: @yuku-codegen/binding-linux-arm-gnu 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0178409e7c742f8a2e2c6401cb180d5610309b06c351f38ae12b28caa24614bc"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-linux-arm-musl: @yuku-codegen/binding-linux-arm-musl 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c460f881ffc063a0bbb1bb25bdb203e468d0fcdbfc2bba430629b6d267f8b54"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-linux-arm64-gnu: @yuku-codegen/binding-linux-arm64-gnu 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"923770043bf83333bff33dfdc4c71aaaf7a7181c83e778a9716669c3779d5b83"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-linux-arm64-musl: @yuku-codegen/binding-linux-arm64-musl 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e47f2f39f22e6137eff1bab41932328d3ff009c9029c0402ac27e7c6837077a"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-linux-x64-gnu: @yuku-codegen/binding-linux-x64-gnu 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"631d942d0fb68cdcc61ed5017904f53455efb39dcdc0df86199cdd6177299499"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-linux-x64-musl: @yuku-codegen/binding-linux-x64-musl 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e60de255ab97b8c5044609b31e2dea45742e9fd0d03f0f00a4c94b47443750"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-win32-arm64: @yuku-codegen/binding-win32-arm64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ec3fe7dff7cfaf5c17a8bc424f32f792d7a46c2b2ff4b99fb16702cbf3360"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-codegen/binding-win32-x64: @yuku-codegen/binding-win32-x64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-codegen is pure JavaScript since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b047f5369674a3c08036f1e738cbfb596066ea044bd70d71e611cba840d82a5a"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-android-arm64: @yuku-parser/binding-android-arm64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30a98e148d8a365cb83b0c12b4a0a608ebdda51a4d05ce21f0f7dd2344f37c5"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-darwin-arm64: @yuku-parser/binding-darwin-arm64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a508abb7a103c39e53866aa3e2c2e23f8ba532f71770a15ff0d3e25f20993700"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-darwin-x64: @yuku-parser/binding-darwin-x64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa3b603f024691167654a9007a9e91679a75bcc0bb717df4c97734ce56af689"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-freebsd-x64: @yuku-parser/binding-freebsd-x64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"05594c63d4f3468e41dbb2fa615a8800be260f01aa4035912cab6f7b5ed3242f"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-linux-arm-gnu: @yuku-parser/binding-linux-arm-gnu 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"16607cae807ce52747ec4d2f54accf56f8030d8664790cd381850e058aa77e63"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-linux-arm-musl: @yuku-parser/binding-linux-arm-musl 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df631eb9e8c470bc74c5aebc595b9d4c02519f70fc97e1760edb0519e903968"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-linux-arm64-gnu: @yuku-parser/binding-linux-arm64-gnu 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0a329d09f74aa326161b1188200addee9110125047b09471e3542c3f08a0f1"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-linux-arm64-musl: @yuku-parser/binding-linux-arm64-musl 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c9ffe7338bb211322423f7bc246c322f6cdc8b89fc612b3693e0a87c24c860"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-linux-x64-gnu: @yuku-parser/binding-linux-x64-gnu 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e139b2e94a64eab851040c81552ddbf3d4c8d0fd1a45f8c452f54a202b6d1d2"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-linux-x64-musl: @yuku-parser/binding-linux-x64-musl 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3136b3c6c985171f52ecc87064b8be57acbb1d72b397dc7eda5b03deaa4a00cf"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-win32-arm64: @yuku-parser/binding-win32-arm64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa87f06bc93692ec56965d7065618217b5dd8060da17b48300fcd63d7c72f891"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: @yuku-parser/binding-win32-x64: @yuku-parser/binding-win32-x64 0.8.7 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022yuku-parser runs on yuku-core since 0.14\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e855bf01addd03dfad6856fcde431f4f8e7962bd11bfcfe3eb500bc1d6ef589"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: whatwg-encoding: whatwg-encoding 3.1.1 is resolved in pnpm-lock.yaml and is marked deprecated by its publisher: \u0022Use @exodus/bytes instead for a more spec-conformant and faster implementation\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pnpm-lock.yaml"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5cb7df63ff21258178b12434d5004ecefac7867185f56a1bb3b907df58d8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/client/ShopTab.tsx: packages/dsh-plugin-shop/src/client/ShopTab.tsx changed 129 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 145 in ShopTab.ShopTabBody at line 1961. 60 of those changes were fix/bug commits, and the other 69 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/client/ShopTab.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c66c5a24a365fbb87dbb2015f1d076c5d4640559fe65af05deb68a2aae09c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/npm-client.ts: registry/scripts/src/npm-client.ts changed 108 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in npm-client.searchByKeywords at line 2704. 63 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/npm-client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d233b2b53ea5501aa54c8b13bbfed7b1ad816b32bc796573695d1ce8c90f9ac0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/host/index.ts: packages/dsh-plugin-shop/src/host/index.ts changed 92 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ShopGateway.install at line 1510. 52 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26c3df5e5142307e635b7f06dfc17152d2fa57ad6e24be4350571a03f7f42d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/github-client.ts: registry/scripts/src/github-client.ts changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in github-client.projectRepoCandidates at line 1958. 46 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/github-client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"710da3828e02962bb61ce2e0b2cdd6eab2b9750c136188712d27b6a314bb63e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/host/catalog.ts: packages/dsh-plugin-shop/src/host/catalog.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in catalog.loadCatalog at line 553. 15 of those changes were fix/bug commits, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d907a84bbc7d7cd41998d5eb68d1bfc25a27da9b4300f7d6a0f4e506141c3a24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/repo-state.ts: registry/scripts/src/repo-state.ts changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in repo-state.checkCarriedDeclarations at line 277. 16 of those changes were fix/bug commits, and the other 18 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/repo-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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe27a36249b96fd68986f7ddf4c77e0ff1a95803c4fd510132f498d4de4a975"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/repo-gate.ts: registry/scripts/src/repo-gate.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in repo-gate.gateRepo at line 186. 17 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/repo-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":"registry/scripts/src/repo-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f68d079956fc17b4054bacc65f91300fede5b791b6f622b00aa5cb9fef6b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/gate.ts: registry/scripts/src/gate.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in gate.gate at line 279. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/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":"registry/scripts/src/gate.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"18adc0559c306d35f20377dad8c35f2f2025b015575940f759cd7997c365f2c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/host/executor.ts: packages/dsh-plugin-shop/src/host/executor.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in executor.spawnPluginCli at line 743. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/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":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"05288fb2c40d4593af31e9a55a0d29577b16a5d4c6e7027d6d2c8d65f8befdc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/client/index.ts: packages/dsh-plugin-shop/src/client/index.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in index.apply at line 160. 9 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/client/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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98cb9188bdbafead8a910e5f105b5db715d3b494a81a7876e6618e26aaa7c38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/tier.ts: registry/scripts/src/tier.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in tier.assignRepoTier at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/tier.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/tier.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f504e100187073ac0710d6c2b707557e48de289e4521d2bc677dbcc451f8e759"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/github-stars.ts: registry/scripts/src/github-stars.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in github-stars.fetchArchivedFlags at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/github-stars.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-stars.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0d5c4635220e878f9a18f9ffbe78bd7f5173d1b4c55d3a55f69805e52cead6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/icon-plan.ts: registry/scripts/src/icon-plan.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in icon-plan.foldIconResults at line 482. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/icon-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":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c5f93357be7dc09c0254352105138b3220a4d61921e2a4c7a7809e9a33169d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/host/plugin-manager.ts: packages/dsh-plugin-shop/src/host/plugin-manager.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in plugin-manager.outcomeByRule at line 437. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/plugin-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":"packages/dsh-plugin-shop/src/host/plugin-manager.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bce830b47eaa7c236db7c645c5f51466af56ed99f2b9224438007e7abeca9b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/llm-client.ts: registry/scripts/src/llm-client.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in llm-client.runBatches at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/llm-client.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/llm-client.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7187c99c377398e73c0f64e8464c21fa667c8ec5c81a960060b21e59487f31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/host/hot.ts: packages/dsh-plugin-shop/src/host/hot.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in hot.hotMount at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/hot.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e73f4a883bec3eb089badf4fb215ec1c836ad27e72a9bd4432439857c09b1f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/dsh-plugin-shop/src/host/state.ts: packages/dsh-plugin-shop/src/host/state.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in state.readShopState at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/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":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a048ad05be73da05fb1cac541b2408729200502c26529dae6a001a817376fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: registry/scripts/src/subpackage-select.ts: registry/scripts/src/subpackage-select.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in subpackage-select.selectSubpackagePaths at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/subpackage-select.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/subpackage-select.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e540afc07b32c5cfc89ddcd63ed1fc9ea2c91f881acedd02a1d52854cee3bd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/build.ts: registry/scripts/src/build.ts changed 66 times in last 90 days and 39 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is build.spendPublisherAxis at line 176), 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(registry): a null handoff is refused by name, and the sandbox claim matches the tests\u201D; \u201Cfix(registry): the docs, the guards and the tests the red-run axis left behind\u201D; \u201Cfix(registry): hold the red handoff\u0027s real write, every guard, and the third array\u201D; \u201Cfix(registry): require the whole keyword set on both sides, before anything is written\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/build.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/build.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c0072056a29403dafaf4bc8d668f4db21f01eacb3b8ce47e9393c77cd1cf05"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/classify.ts: registry/scripts/src/classify.ts changed 30 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is (anonymous) at line 201), 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(registry): require the whole keyword set on both sides, before anything is written\u201D; \u201Cfix(registry): require each keyword once, both flag spellings, and the reports a failure held\u201D; \u201Cfix(registry): refuse a handoff the axis mode cannot account for, and name it when it does\u201D; \u201Cfix: make the prose match the code, and fix three tests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/classify.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/classify.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"849d15e1a74312cb665182ac4bfc0642202acf587963a44d251817c4f20c3f86"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/publisher-state.ts: registry/scripts/src/publisher-state.ts changed 23 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is publisher-state.readPinned at line 222), 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(registry): retry the probes whose failure stops the run, and classify answers by class\u201D; \u201Cfix(registry): record only what the publisher axis can stand behind\u201D; \u201Cfix(registry): the release note names the exit its pins left through\u201D; \u201Cfix(registry): judgedPins owns the evidence rules, and reads a skipped cell\u0027s count at the end\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/publisher-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":"registry/scripts/src/publisher-state.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cf057562c2bccfa348b43a0a71bca85aee14ec9e9d08082435fe0e3405a9fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/pipeline.ts: registry/scripts/src/pipeline.ts changed 20 times in last 90 days and 12 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 pipeline.unmatchedRegistryNotes at line 313), 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(registry): every matching loop spends the files budget, and a deadline from a failed clock read is refused\u201D; \u201Cfix(registry): the icon step and the declarations re-read stop before the job\u0027s own deadline\u201D; \u201Cfix(registry): stale withheld-icons rows get their own heading; a legacy npm name stays verbatim\u201D; \u201Cfix(registry): no published icons file is an answer, and a refetch\u0027s 404 never overwrites a published icon\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/pipeline.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/pipeline.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eeebde6654b0fa33b02388469cea00d791b6af1fafb9e896ee0f91eb70d9f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/release-asset.ts: registry/scripts/src/release-asset.ts changed 18 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 15 (its worst body is release-asset.patchInsertNames at line 294), 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(registry): compare a declared path in the spelling the tar reader uses\u201D; \u201Cfix(registry): a carried subdir, repo or commit cannot steer a raw fetch; an archive\u0027s root is its one directory\u201D; \u201Cfix(registry): a stored icon read is never none; comments name the icon declaration\u201D; \u201Cfix(registry): refuse a release archive whose root is empty, with one honest reason\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/release-asset.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/release-asset.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"466c7d92fa847950d778836be1fa2648769b6411397c29c71f7b99e91c3f3a00"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/install.ts: packages/dsh-plugin-shop/src/host/install.ts changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is install.validateInstall at line 78), 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(shop): clarify user-facing messages\u201D; \u201Cfix(shop): refuse to change the desktop profile, which dsh manages only from its app\u201D; \u201Cfix(client,host,docs): one rule on one input, and the badge says which problem\u201D; \u201Cfix(shared,host): a spec we cannot read is not npm, and the reason says why\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/install.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/install.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e577cc6373b3d8841c9e61955bb470ab3f5f0360ccfb35a3f565cb9c3991c57"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/icon-bytes.ts: registry/scripts/src/icon-bytes.ts changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is icon-bytes.isNameChar at line 293), 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(registry): label a shared icon with the type its bytes are\u201D; \u201Cfix(registry): read a big-endian SVG icon without the decoder ICU may lack\u201D; \u201Cfix(registry): every matching loop spends the files budget, and a deadline from a failed clock read is refused\u201D; \u201Cfix(registry): GIF, BMP and ICO bytes under a label a browser draws them under are drawn\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/icon-bytes.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-bytes.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"903324ce9bf36e0785f91308beba931eb608de42cedd6e1c83ec5d3d4c45b2c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/icon-fetch.ts: registry/scripts/src/icon-fetch.ts changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is icon-fetch.fromRelease at line 601), 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(registry): read the name a pax or GNU header carries, and state the backslash reading\u201D; \u201Cfix(registry): compare a declared path in the spelling the tar reader uses\u201D; \u201Cfix(registry): a body that is not a catalog index is an unreadable icons file\u201D; \u201Cfix(registry): the icon step refuses a declared path that leaves the package\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/icon-fetch.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-fetch.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b57d185f5cecdb840a87f18beef8598f6dd6d9661c768f1dc2096ec91838bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/publish-catalog.ts: registry/scripts/src/publish-catalog.ts changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is publishedLatest at line 93), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): stage a Pages directory holding only the artifacts the spec lists\u201D; \u201Cfix(registry): refuse a publish whose dist/v1 predates the published latest\u201D; \u201Cfix(registry): make every entry point importable without exiting its host\u201D; \u201Cfix(registry): make the deadline cover the body, and retry a gateway timeout\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/publish-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":"registry/scripts/src/publish-catalog.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"92770a75e59e2ef86e00822c2ca8efeb40deef079ff15fdb362749705367800e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/peers.ts: packages/dsh-plugin-shop/src/host/peers.ts changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is peers.incompatibilityMap at line 319), 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(shop): ask dsh 0.1.7\u0027s pluginPackages before walking the disk for peers\u201D; \u201Cfix(shop): judge the running harness, and walk node_modules as Node does\u201D; \u201Cfix(shop): look peers up directly instead of through require.resolve\u201D; \u201Cfix(e2e): read the loader inventory through the a11y contract, not private data-*\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/peers.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/peers.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c961d7b170d204332a8f9c943e756c19f31ffe3da04ca70c70fffcc90bfdf31"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/profile.ts: packages/dsh-plugin-shop/src/host/profile.ts changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is profile.ownedEntries at line 214), 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(shop): read a list-valued dsh.bundle.patch, and refuse one this dsh cannot load\u201D; \u201Cfix(shop): toggle writes only the disabled key and keeps the user\u0027s layer\u201D; \u201Cfix(host): the gate cannot be reverted silently, and the loader collision is caught\u201D; \u201Cfix(host): keep the user layer\u0027s !!js spelling when rewriting it (F-9)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/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":"packages/dsh-plugin-shop/src/host/profile.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f059515eab48292104d00b7db1d1dc8a11fd9bc92393076b4fd8d71ea7605f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/npm-origin.ts: packages/dsh-plugin-shop/src/host/npm-origin.ts changed 6 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 15 (its worst body is npm-origin.npmOrigin.probe.load at line 133), 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(registry): a rescued entry must be the package it claims\u201D; \u201Cfix(host): cap npm tarballs on the wire and at inflate\u201D; \u201Cfix(host): a dist.integrity mismatch disqualifies the mirror, not the load\u201D; \u201Cfix(host): an unusable mirror response disqualifies the mirror, not the reader\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/npm-origin.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/npm-origin.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"787538638b6c1db94314889c5ec4c1d44f8e9c4bf2c6fff402cdddda8d4b5745"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/compatibility.ts: packages/dsh-plugin-shop/src/host/compatibility.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 12 (its worst body is compatibility.compatibilityMap at line 189), 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(host): offer no allow-version command on the desktop profile\u201D; \u201Cfix(shop): true the github verdict comments, and pin the exemption test to its reason\u201D; \u201Cfix: make the prose match the code, and fix three tests\u201D; \u201Cfix(shop): judge the running harness, and walk node_modules as Node does\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/compatibility.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/compatibility.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b676ec8ccfe6f3e6c4cf90154f375696b214e410e6b3704079f24610bb77cd36"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/harness.ts: packages/dsh-plugin-shop/src/host/harness.ts changed 7 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 6 (its worst body is harness.peerCheckOf at line 285), 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(host): identify the running dsh on the desktop app (#130)\u201D; \u201Cfix(host): read the profile table from the bundles package on dsh 0.2.2-rc.1\u201D; \u201Cfix(shop): a refusal names what dsh 0.2.1 lists as requirements, not only peers\u201D; \u201Cfix(shop): read a list-valued dsh.bundle.patch, and refuse one this dsh cannot load\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/harness.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/harness.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1a73eefb41954cb008ce53b8c252f90ba54a3f9dc042ae1e2e98c967521bed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/restart.ts: packages/dsh-plugin-shop/src/host/restart.ts changed 5 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 3 (its worst body is restart.restartCommand at line 58), 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(shop): tell when a restart never happened, and settle the tab after one that did (#77)\u201D; \u201Cfix(shop): reload after a restart only once the new server keeps answering\u201D; \u201Cfix(host): re-run this process on restart and report helper startup failure (F-7)\u201D; \u201Cfix(host): spawn the dsh CLI\u0027s JS entry on Windows, not the unspawnable shim\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/restart.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/restart.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"225d4b0480d4a6c243c4bb438361cd0ba8c5083c579d905ef3ea9034a1e95d82"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/client/module-table.ts: packages/dsh-plugin-shop/src/client/module-table.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 13 (its worst body is module-table.moduleTableOracle at line 175), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: make the prose match the code, and fix three tests\u201D; \u201Cfix(shop): make the reverdict and removed-peer rules hold, and test them\u201D; \u201Cfix(shop): re-judge verdicts after installs, and never vouch for a removed peer\u201D; \u201Cfix(shop): give the module-table probe a deadline\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/client/module-table.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/module-table.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb256c02ffcfa5368191180604f99d778affc362d2223a88126164d735b7047e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/manager-runner.ts: packages/dsh-plugin-shop/src/host/manager-runner.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is manager-runner.startManagerOperation.queued at line 136), 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(host): no retry line for an install that landed, and show it on a failed self-update\u201D; \u201Cfix(host): offer the retry line on a failure through dsh\u0027s plugin manager\u201D; \u201Cfix(shop): clarify user-facing messages\u201D; \u201Cfix(shop): an update dsh 0.2.1 refuses in place continues through dsh\u0027s CLI, in the same record\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/manager-runner.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/manager-runner.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"19029bc8dcee8224be3908f9c6caec1592920ca46588dc202713409636923d4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/markets.ts: registry/scripts/src/markets.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is markets.mergeMarketRows at line 76), 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(registry): test the empty-list guard, and say which copy it is\u201D; \u201Cfix(harvest): advance the rotation by what rotated, and persist the pins\u201D; \u201Cfix(registry): the market verdict decides; revert the by:human gate\u201D; \u201Cfix(registry): an LLM market verdict is a review hold, never a delisting\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/markets.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/markets.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b7c637b16d735b3ef45e802d5ec93555274f346abf4d92ddcadaa37b78045"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/backfill-first-seen.ts: registry/scripts/src/backfill-first-seen.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is keysOf at line 37), 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(registry): stamp added from accepted entries, keyed by identity\u201D; \u201Cfix(registry): make every entry point importable without exiting its host\u201D; \u201Cfix(registry): keep every entry point importable under --experimental-strip-types\u201D; \u201Cfix(registry): backfill scoped npm names by leading @, not slash\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/backfill-first-seen.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/backfill-first-seen.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51d88e2b447887a8cc994d7a1f8eaec89346ac930bfd4197bc62a08ca71a865"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/shared/identity.ts: packages/dsh-plugin-shop/src/shared/identity.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 7 (its worst body is identity.parseSpec at line 59), 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(shared,host): a spec we cannot read is not npm, and the reason says why\u201D; \u201Cfix(host): refuse to replace a different plugin that shares a bundle name\u201D; \u201Cfix(host): preserve release tag pins\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/shared/identity.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/shared/identity.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c3b63174051c21925670a97b222823882e8a8f2d815b8ad1d81b9f8d714ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/classify-select.ts: registry/scripts/src/classify-select.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 12 (its worst body is classify-select.selectPending at line 44), 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(registry): another owner\u0027s repository is no longer shadowed by an npm namesake (#88)\u201D; \u201Cfix: make the prose match the code, and fix three tests\u201D; \u201Cfix(registry): classify gates the same repositories the build lists\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/classify-select.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/classify-select.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e207493a94050fb3bdf3a4ddac74f5b6016f008345069ccb48e98b3f98162b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/dsh-plugin-shop/src/host/origin.ts: packages/dsh-plugin-shop/src/host/origin.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 9 (its worst body is origin.readCappedBytes at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(host): cap catalog body reads and wrap transport failures\u201D; \u201Cfix(host): an unusable mirror response disqualifies the mirror, not the reader\u201D; \u201Cfix(host): a broken mirror disqualifies itself, it does not kill the load\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- packages/dsh-plugin-shop/src/host/origin.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/origin.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a01f0451e583f8999ccb1af745f26cf3e86fae487b541319836718f095198fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: registry/scripts/src/schema.ts: registry/scripts/src/schema.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 6 (its worst body is schema.parseCatalogSection at line 65), 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(registry): cap the second manifest read, and bound the reason string itself\u201D; \u201Cfix(registry): bound every free-text field that reaches a published artifact\u201D; \u201Cfix(registry): close the final-review gaps (pruning, push commits, vocabulary, docs)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 10:32:14 \u002B00:00\u0027 --until=\u00272026-11-17 10:32:14 \u002B00:00\u0027 --full-history --no-merges -- registry/scripts/src/schema.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/schema.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd499280d395db2e11585802020a6939f99d0c3141d0a156bdf70a3b53633662"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 71 significant file(s) lose their only recent owner: registry/scripts/src/npm-client.ts, packages/dsh-plugin-shop/src/client/ShopTab.tsx, registry/scripts/src/github-client.ts, packages/dsh-plugin-shop/src/host/index.ts, registry/scripts/src/publisher-state.ts, registry/scripts/src/build.ts, registry/scripts/src/repo-state.ts, packages/dsh-plugin-shop/src/client/present.ts (\u002B63 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9c69450ea095baa3004420d3b1521851c2711da377bb14994cd4d9609d7b6823"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022And the next record\u0027s detail when it fails.\u0022 repeats the code it sits on: 4 of its 4 words (next, record, detail, fails) are already in \u0060const failing = continueAfter(handRecord(\u0027first-3b\u0027, refusal), () =\u003E true, () =\u003E handRecord(\u0027next-3b\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":"packages/dsh-plugin-shop/tests/host/manager-runner.test.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a7c5fa7204c9e6d6b508a1d241affc04fc56019594c9593e8c04b6c62b455c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00222 departed = 1 carried (dsh-kept) \u002B 1 deprecated (dsh-gone).\u0022 repeats the code it sits on: 6 of its 6 words (departed, carried, dsh, kept, deprecated, gone) are already in \u0060expect(handoff.departures).toEqual({ departed: 2, carried: [\u0027dsh-kept\u0027], deprecated: 1, npmGone: 0 })\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":"registry/scripts/tests/publisher-handoff.test.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a35f7f742a9ccc36fb433f100636cb377cf09785c957b6f421e0ebe928ab8"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (21693 LoC, 135 module-visible types across 1 directories) overshoots its size bounds. 2 of 3 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d5244dbb9040f0ef9a41721fc246c38399605a5b233c47266a2093207fec1"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/dsh-plugin-shop\u0060 (17746 LoC, 168 module-visible types across 5 directories) overshoots its size bounds. 2 of 3 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4649c355877fcaa4de56610641343b975fa042ce8e71702f774d4988f93ff71"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c63a4053420be180a8a470ffa1ebd618da0c1699ff3234488b6cf8008ae53cb3"},"properties":{"commitSha":"266404954ef9e391a540c26f1a4cf8091ef3bce4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b660a340e38dda329f6b133c466b3fd8dd7ce935adeb3ab0b454f85a92731c9e"},"properties":{"commitSha":"f42f07c1551256fcd83f5ec873a4fac99a24d78d"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"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":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"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":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"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":"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":"2d21cec953ecea19f8fa22e7e240f5141ebe07851941906c3a4af7d28251e344"},"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":"cc33cfb253d17f73a4e5430477422e304448fda6d77b323e2f2d5341d357694e"},"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":"6acf66de0a60969e16dd3024edc8132accaca6433391a198a951524342e2fad7"},"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":"a28abdc9bdaadab0b801688777b2cde6736627955e0a8ef7dcd225ddda090cc8"},"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":"0c639f55a06a3b4d7b8c2156f796eeccba74d4f41b6df2ccc00e68e0a2980025"},"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":"0a7cc463cfd9ac21bc777b1cd2a9c2b8158ec152489b213062ec391b3bfe991e"},"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":"aee2174f0306ed251b1c1b68f5f7ad322c9cb64d9097e5c22ef8ca99ec33ccb2"},"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":"b45625eb3941f0e0e35862479fb5688ed6a6a986e2b4d652b30c0badb9b39eab"},"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":"98afb9e0dbf951828d243113d7502824e6b95c4bb46942f5baf4d09ca2383e71"},"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":"57f5f0d9e3fc44ada32888d17c02703d5951d2682105b207a4eaa84d524fc617"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30361748ac3a7487c79dada59e827857cf651e856f3e26e69aa945e1d1b27623"},"properties":{"dependency":{"package":"@deepseek-ai/dsh-client-connection","version":"0.1.1-rc.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"0.1.2-alpha.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d74aeba34c20ef883320d58ae3a9ebc2ca37676b56ad245f77891a27afcd5d2d"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"2.1.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e73274327a59fde3d7525c32eb900b994ffa4778e21ba83ba71c18747bd32c8"},"properties":{"dependency":{"package":"vitest","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"3.2.6","relation":"direct","declaredRange":"^2.1.4","reachability":{"kind":"production","file":"packages/dsh-plugin-shop/tests/client/ShopTab.client.spec.tsx","line":4}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"685cba4514570b53bf9bc85812fa54c07fec7b3f62fc67d4712c038e9ec2e605"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.3.2","relation":"direct","declaredRange":"^4.2.0","reachability":{"kind":"production","file":"packages/dsh-plugin-shop/src/host/hot.ts","line":34}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7713653c1cd2e524df06e4e81d883565ceb6482ea97f6eea94f00d39b4a4d989"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"6.4.4","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af3a18cf730f6276ad50ac81337c95bc6659e9de68697e5d39209e4ecd015b5a"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"direct","declaredRange":"^4.4.3","reachability":{"kind":"production","file":"packages/dsh-plugin-shop/src/host/catalog.ts","line":6}}}},{"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":"10e7ebf2bc6f092b587e1c5c6554560a1e358ae0c03c4a8acfc1fe5df51e8d09"},"properties":{"dependency":{"package":"@vitest/mocker","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ff4501a0b6eb84bb92385b6433ad1c9d658a3cd9dbc3a993388fb9e366aa074"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7198a068b97a1af1f65e3196cdf11565ec276006632a836614e182488e4d847"},"properties":{"dependency":{"package":"katex","version":"0.16.47","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"0.18.2","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea31c344dce257c2ee8a53b754c566509ab851a550743b205070a4e7f7222738"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d27347a2203e7c95756658100c582d8fb0ef96a498d78a8c1c488208ccd9ead7"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.skeletonCard::after\u0060 moves (\u0060animation: dshShopSkeletonSweep 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":"packages/dsh-plugin-shop/src/client/ShopTab.module.css"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3a1250e5c1a9364abd0f21a1dc37e2bfabeceae5224e92280c72e16c85f78e"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ShopPageStore (23 required operations): \u0060ShopPageStore\u0060 declares 23 required operations: \u0060getSnapshot\u0060, \u0060subscribe\u0060, \u0060setView\u0060, \u0060updateView\u0060, \u0060isExpanded\u0060, \u0060subscribeExpanded\u0060, \u0060toggleExpanded\u0060, \u0060expand\u0060, \u0060focus\u0060, \u0060getOwed\u0060, \u0060subscribeOwed\u0060, \u0060owedEpoch\u0060, \u0060setOwed\u0060, \u0060noteInstalled\u0060, \u0060clearReverdict\u0060, \u0060noteRestarted\u0060, \u0060recordScroll\u0060, \u0060readScroll\u0060, \u0060readAnchor\u0060, \u0060notePageMounted\u0060, \u0060recordTeardown\u0060, \u0060handover\u0060, \u0060dispose\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/page-store.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56ebdd3a5d9da8aa70c6ffd3a390c93381123ccde0921979928cca50b70cb70"}},{"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":"packages/dsh-plugin-shop/tests/client/web-full-flow.e2e.ts"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d06229a42d883892a05f0ce3950f9366bb32e11eec5059aaafd1cc83e0f4632"}},{"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":"packages/dsh-plugin-shop/tests/client/web-full-flow.e2e.ts"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"0165d247ccf7d98c49994e794a0d2c7d62a06ccc6c5b4183478b83bc2698278a"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060docs/design/2026-08-18-dsh-plugin-shop-design.md\u0060, \u0060docs/design/2026-08-30-github-install-channel.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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/artifacts.yml"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060gunzipSync\u0060 in \u0060probe\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/npm-origin.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c48915f71a7bed6b92950e02faf4ef04b17d7316429e1d3321ce4e04c3f8dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (99 matched lines \u00D7 2 locations): registry/scripts/src/gate.ts:258 \u00B7 registry/scripts/src/repo-gate.ts:119 \u2014 the two spans are one implementation copied and then locally edited \u2014 663 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":"registry/scripts/src/gate.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f72be87adf2b33cc8c70862399a5b724da0f498a7ee0c5689138aa73ee6f4bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): packages/dsh-plugin-shop/src/client/ShopTab.tsx:1009 \u00B7 packages/dsh-plugin-shop/src/client/ShopTab.tsx:1242 \u2014 the two spans are one implementation copied and then locally edited \u2014 393 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c8a9d4690cda81c43805c6f459bb17be405e163f2d3a4a26364485a76fb5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): registry/scripts/src/github-stars.ts:107 \u00B7 registry/scripts/src/github-stars.ts:263 \u2014 the two spans are one implementation copied and then locally edited \u2014 431 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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43da36c40c8df2d2d8ffa8dcf8df98489b3192d1a7b2a05f0d796e29cd7d968"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): registry/scripts/src/build.ts:447 \u00B7 registry/scripts/src/classify.ts:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 209 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/build.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50908bc0102734e09251300fd76b6b7cb45a1d49017dfd308ffc4994538a302"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/dsh-plugin-shop/src/host/catalog.ts:745 \u00B7 packages/dsh-plugin-shop/src/host/catalog.ts:771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6b9f38c73e582e5d92b4bd9360173ca2dab2312d8527f20652b504597d16dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): registry/scripts/src/icon-declaration.ts:789 \u00B7 registry/scripts/src/icon-declaration.ts:825 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d9dade783bf2ddcf753374b3137cd794ecd580ff3c89e61f1eb6689cc5332c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): registry/scripts/src/feed-state.ts:745 \u00B7 registry/scripts/src/feed-state.ts:783 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cac089a393d069667c5f780079eb71eaabcfeaf0a0ae4f6af9aaeb68c68712"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): registry/scripts/src/npm-client.ts:357 \u00B7 registry/scripts/src/npm-client.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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"722f585c8c84fdc067a57286e213bf24c2b6384ec0d8b6aa1694247b8871aa1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): registry/scripts/src/publisher-state.ts:222 \u00B7 registry/scripts/src/publisher-state.ts:303 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/publisher-state.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fc211fb0b3641674cf4472b397bbca3b3372831c956c3738ab68b90028cc8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/dsh-plugin-shop/src/client/ShopTab.tsx:1164 \u00B7 packages/dsh-plugin-shop/src/client/ShopTab.tsx:1204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d1e16d7a74e5574b4cd51d505ab154aac445e3672b96aa988f9a2b9508c319"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): registry/scripts/src/icon-fetch.ts:535 \u00B7 registry/scripts/src/icon-fetch.ts:620 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-fetch.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1569df659117ab739a645c58cd56e0f1b1c86288a4285f6552d231506876ee02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): registry/scripts/src/npm-client.ts:1765 \u00B7 registry/scripts/src/npm-feed.ts:126 \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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f341bcdfd54cc291d9a7a8e574bc7eb5f51aedc93959277e566a589b84fa97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): registry/scripts/src/npm-client.ts:3812 \u00B7 registry/scripts/src/npm-client.ts:3965 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"11df8f94f8721565912cf31d6aaffe5ef9a1c5358852d51e52cd1f4975d2b311"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): registry/scripts/src/repo-state.ts:298 \u00B7 registry/scripts/src/repo-state.ts:334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/repo-state.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8321108468c08099fb2c04f50e158cc559e4ae261a93352fa15c77f49ef12f6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/dsh-plugin-shop/src/host/catalog.ts:618 \u00B7 packages/dsh-plugin-shop/src/host/catalog.ts:629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7380f9f4587eb91d12b21571bdf8cef146bdf6d387956cfab0b5bf0b5bf67610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/dsh-plugin-shop/src/host/origin.ts:61 \u00B7 registry/scripts/src/http-body.ts:41 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/origin.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0769ffad7c388ef9509ad4a57cedad7ae9fb914e0556ff88b12ea3aacd488f63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): registry/scripts/src/build.ts:118 \u00B7 registry/scripts/src/build.ts:184 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/build.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b86f84fad9ecc1da755e5657a8eb4829f0a02810462c7e85bc344f16fadba8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/dsh-plugin-shop/src/host/catalog.ts:467 \u00B7 packages/dsh-plugin-shop/src/host/index.ts:656 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"30942d498b9e2d743635268cac6123d75ad73e3be4c359d3a252ccb2bc1d88d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): registry/scripts/src/github-stars.ts:116 \u00B7 registry/scripts/src/github-stars.ts:272 \u00B7 registry/scripts/src/llm-client.ts:261 \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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"808f866d5d415c5afb7dd903856fe882720ead23e3aa0d617af7172966c28686"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): registry/scripts/src/npm-client.ts:1470 \u00B7 registry/scripts/src/npm-client.ts:1538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"44beb22775028367e039b8061b80b396bcbc89b223862b759f2cbfd35ef85fae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/dsh-plugin-shop/src/host/state.ts:242 \u00B7 packages/dsh-plugin-shop/src/host/state.ts:260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0947656287da0de4ed6076f5efe172819e42e0825b167c862b9829af3bfe688"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): registry/scripts/src/feed-state.ts:324 \u00B7 registry/scripts/src/feed-state.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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9ef88c8f7f80f7fe6973d70225aa820db13aaccdf5f51dac0b682f8695de04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): registry/scripts/src/github-client.ts:947 \u00B7 registry/scripts/src/github-client.ts:1022 \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":"registry/scripts/src/github-client.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"5658cd3c9d3c7cd446eabbce153023269c034172b451bb130d2e451c35342efd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): registry/scripts/src/icon-declaration.ts:267 \u00B7 registry/scripts/src/icon-declaration.ts:284 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3d92aca9048fba7ee67012296b73091e3b178c3a678fc1e5298175ab79cea5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/dsh-plugin-shop/src/host/npm-origin.ts:106 \u00B7 packages/dsh-plugin-shop/src/host/origin.ts:106 \u00B7 packages/dsh-plugin-shop/src/host/origin.ts:126 \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":"packages/dsh-plugin-shop/src/host/npm-origin.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"750981b9f2c519cc8b11b6f0c5e6de531a013d335724048b03fcfcc76b53ff1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): registry/scripts/src/config.ts:85 \u00B7 registry/scripts/src/config.ts:105 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/config.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c95741d4270586715ebae4e0fbcf3b9af81c8573167e4890d1896919ab539c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): registry/scripts/src/icon-plan.ts:200 \u00B7 registry/scripts/src/icon-plan.ts:220 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"102754fe1a2c1abc5e0addbf171168b996ce25d9a37c4dfcdeb31908d5a5f33a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): registry/scripts/src/publisher-state.ts:678 \u00B7 registry/scripts/src/publisher-state.ts:711 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/publisher-state.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa1f3b9381488ba38e58d41925493162166b5744e46b6bbb01e5acb9de9367b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): registry/scripts/src/classify-select.ts:70 \u00B7 registry/scripts/src/classify-select.ts:89 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/classify-select.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2400fc385427909a0312e5034f071c0ac81f0654133ba3f5bfec8b67a0a121ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): registry/scripts/src/release-asset.ts:312 \u00B7 registry/scripts/src/release-asset.ts:319 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/release-asset.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1094fa2b12df513bc9d3804ec3f377a6a10621990501dc03f78704ecfb8e7e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/dsh-plugin-shop/scripts/shoot-readme-screenshots.ts:33 imports packages/dsh-plugin-shop/tests/fixtures/onboarding.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":"packages/dsh-plugin-shop/scripts/shoot-readme-screenshots.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"451902c520114214ac72c892235f3d2a981c4336f74d6e05d4e959ed53b7ba84"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: registry/scripts/src/emit.ts:2 reaches into another package with a relative path (../../../packages/dsh-plugin-shop/src/shared/npm-name.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/emit.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d3a29fa7e5e19e156e7f8226f55e864b4ccaa7a88e6da20ec6ca578f8ab80"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: registry/scripts/src/gate.ts:2 reaches into another package with a relative path (../../../packages/dsh-plugin-shop/src/shared/npm-name.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/gate.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"72251c5819a5c6b529a04b8341821886aa33f83ca5039e6fb26b3f16d3d58fec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: registry/scripts/src/icon-fetch.ts:34 reaches into another package with a relative path (../../../packages/dsh-plugin-shop/src/shared/tar.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-fetch.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebda5c9cf9395257f2d8fdbae1226e49a7b4f3487de0162a4929b6a828431bb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: registry/scripts/src/market-select.ts:14 reaches into another package with a relative path (../../../packages/dsh-plugin-shop/src/shared/shop-like.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/market-select.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c03c7ec3ee73bfc8643182f55f2dc7a941837c2bbb75b26dc9e1eb3835342df"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: registry/scripts/src/release-asset.ts:48 reaches into another package with a relative path (../../../packages/dsh-plugin-shop/src/shared/tar.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/release-asset.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7dc3339579fe2d19510bb4ceacbfc1a16fa48e29f432360e5aeddb8e3652a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EntryCard (cyclomatic 63, cognitive 55): EntryCard has cyclomatic complexity 63 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f916679406cdf045c0eaf6532b6597f87944606d04f1db35cda4e12b0efb805"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ShopTabBody (cyclomatic 59, cognitive 60): ShopTabBody has cyclomatic complexity 59 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":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a71a4749d765e26a5ad5ceea7d7d607794e2f9e073178305c9c6fe35509b97e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gate (cyclomatic 47, cognitive 55): gate 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":"registry/scripts/src/gate.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4814ea0455eecfa5a9e1b4b94ad3e983fdebd44ce44d2fdca377aa05cc76d63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateRepo (cyclomatic 45, cognitive 58): gateRepo has cyclomatic complexity 45 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":"registry/scripts/src/repo-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1979cc32fbb2fc31da412206869676f082decd4d07fe2c2a7e3d2d3a113efa39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkCarriedDeclarations (cyclomatic 37, cognitive 34): checkCarriedDeclarations has cyclomatic complexity 37 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf47e148c71b786015ca6d4c85cfecaa59c6454517871bc20d3e3b2cc8b7c06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchArchivedFlags (cyclomatic 34, cognitive 80): fetchArchivedFlags has cyclomatic complexity 34 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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc8103960b87d78637b56f07b4fd9b6134da29811d5a4208f613234c1229022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outcomeByRule (cyclomatic 34, cognitive 46): outcomeByRule 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":"packages/dsh-plugin-shop/src/host/plugin-manager.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7938c09c022583c7586352e83826c1a0b2c949f1991e7bfe013eed9732d6e438"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchStarCounts (cyclomatic 32, cognitive 73): fetchStarCounts has cyclomatic complexity 32 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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e793af3cb5ba5a5fbaf05cd557ec46897d70bf54224f0db061ba9b63e891b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFeedState (cyclomatic 30, cognitive 40): parseFeedState 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98f9bbbfc78c62df64c03bb66ee830d5d00f2a8ca0763105aa26090b75c2f0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InstallPanel (cyclomatic 30, cognitive 31): InstallPanel 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":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7452fa617ca0da69c4d8287b76728ed55b2428bdc27a0d4bdb74c2f14dbb0cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectRepoCandidates (cyclomatic 29, cognitive 40): projectRepoCandidates has cyclomatic complexity 29 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a482d70bc580fd3277aadab8c1b5558e7124e2f9abdb305743c4418ab22de4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCatalog (cyclomatic 27, cognitive 40): loadCatalog 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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3360daceacb80efc738ed7334100ff06bf71609c33565f8afd433249adbc5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRepoState (cyclomatic 27, cognitive 40): parseRepoState 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68690266037a39b9d0d6e7d419a38b0ee9fcd55dfa5229cf998a847e4a3cc41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jpegSize (cyclomatic 27, cognitive 26): jpegSize 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":"registry/scripts/src/icon-normalize.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc5fcc5e217d60fe39b7ef5477385026778db6738b34c46c778c74dbb39dc02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assignRepoTier (cyclomatic 26, cognitive 27): assignRepoTier 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":"registry/scripts/src/tier.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"612fc97d0f54f3fde1ccaa385244abd26801fa9e64f0b8d6f43192ed22da8be4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harvestFeed (cyclomatic 24, cognitive 33): harvestFeed 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":"registry/scripts/src/npm-feed.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"66410bec5fd95d3f501027ff5eae6fdba7adc41c98e271e3b2cfcbd82ad8af49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 54): (anonymous) has cyclomatic complexity 23 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":"registry/scripts/tests/icon-plan.test.ts"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e6814452678e9c150d859aa99286da69c1d8f7334b72501087be65556559a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findJoinCalls (cyclomatic 23, cognitive 47): findJoinCalls has cyclomatic complexity 23 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":"registry/scripts/tests/workflow.test.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"954795fd7085587680e02ca625cda3d6c592c47e393cb767dc75c8cd85900739"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchCalls (cyclomatic 22, cognitive 35): searchCalls 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":"registry/scripts/tests/npm-client.test.ts"},"region":{"startLine":5508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8385c0bbad0c181c1d3dea559676654394f75c6548bc96194e81f00287a1251"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function problemsOf (cyclomatic 22, cognitive 21): problemsOf 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":"registry/scripts/tests/icon-plan.test.ts"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc3847f81ceecd9b0988f6fad36f6192b0d41fd3ba0695a60f53f3fc040a248"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldIconResults (cyclomatic 21, cognitive 28): foldIconResults 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":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4b1d6dd97aaf4d6273b36ea2ccaefd30c80d3a1f0570b4474d38935a9cd06f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rereadCandidate (cyclomatic 21, cognitive 26): rereadCandidate 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03abee4c25d39d07500a7dd730020c8fc99b7523f582a702829240de0b748df"}},{"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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"74057258c5787b31ef9821036102b0a63b65105f2f0784b77084e215fb6d1032"}},{"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":"registry/scripts/src/llm-client.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbecfcd4f57c2c7cebb1c89e98bf3cd90723671c882a2f1931489fa9d7d42140"}},{"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":"packages/dsh-plugin-shop/tests/client/web-full-flow.e2e.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4db8c892a2f82b7f653e5bab8922d2a54833e4b477e7b8799fb8da02de9720"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harvestOnce (cyclomatic 19, cognitive 42): harvestOnce has cyclomatic complexity 19 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24b81235b1759dc837caaa47e24e62a06fac868efc0b9138aafb84faa8d8a46"}},{"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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"311d915293a8c10fbb75630fdffc12c35491b5ae220a2baa7a85aada964cdeb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readShopState (cyclomatic 19, cognitive 29): readShopState 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":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5a25f2badd60c238a7a92fe1e9e42b1ccf9e8ab66077aa0d7f2190f3fb5a85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExportsSubpath (cyclomatic 19, cognitive 22): resolveExportsSubpath 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":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7817dceaf6b314a622918bd5e41938be78f76dc44a33b82627c3b579e8340c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeInstallSize (cyclomatic 19, cognitive 22): treeInstallSize 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":"registry/scripts/src/tree-size.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"381760bf78ae8215d64ddbc8bd3232491c9086ea99e25f60514e86e9acb25c6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hotMount (cyclomatic 19, cognitive 21): hotMount 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":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63fee86ad601e46be27ce403a297e2f21ae27a6351f16e0a9cb63dcdfed798d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRollbackRecord (cyclomatic 19, cognitive 16): isRollbackRecord 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":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b79492df7142a4a0846817acd2e2cbd68be9566d0d70098e716127ca5afe5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSimplePatch (cyclomatic 18, cognitive 27): parseSimplePatch has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc1e51b68a6e4e2a1efb4d5887667e0130f34afcbe7d23a5f4e62c333f83a21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeSubpackageCandidates (cyclomatic 18, cognitive 26): probeSubpackageCandidates 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5621a6b53fc076e80d70881f5a2db931abc9cb78f2194ad6407714f9e7bfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 22): (anonymous) 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":"registry/scripts/tests/npm-client.test.ts"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcc913abc7df6ae372d8aaefe169dece8bb95dd3efb9b29926480c8b8348f5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFeedRunReport (cyclomatic 18, cognitive 17): parseFeedRunReport 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37f63cdb87773641ce6f8e69c149d47180ae9da8073f284a0059e1636f464ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toCandidate (cyclomatic 18, cognitive 16): toCandidate 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e41f5e19585e4fc112cafa89a2b3860d4ab8987c6de999ff394cf6b5c59ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verdictOf (cyclomatic 18, cognitive 15): verdictOf 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":"registry/scripts/tests/icon-plan.test.ts"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2a6f4daec8b0e5f35fc7ff89aad3036626b82cca172ae4f83ca54df25509ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRow (cyclomatic 17, cognitive 21): checkRow 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":"registry/scripts/src/icon-state.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e959d05d7c7e9d251b8f789d74a03a2a94849b8e6899f95e9d7e4f78174706bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function githubSlugOf (cyclomatic 17, cognitive 17): githubSlugOf 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":"packages/dsh-plugin-shop/src/client/present.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba98008c72b0bde0111f842df6f872be96a2f67e1f1b29ecbc7f8f7d994d767f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchRepoCandidate (cyclomatic 16, cognitive 26): fetchRepoCandidate 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c489d260cce7aa067eb61addaec143205bdaf949b89618e481306e86de1918"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLicense (cyclomatic 16, cognitive 25): normalizeLicense 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b136f8f7d2ed1d930bcee571fd9fef80441d972d1fe6c3fa82b10ecbf885ac9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeDeclarations (cyclomatic 16, cognitive 22): writeDeclarations 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"018bf8c525f13dfc5d56ef94415f64f7993d782bf6c5cb828f16d520e8ed3786"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTarget (cyclomatic 15, cognitive 26): resolveTarget 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":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a174d603843769626a6c0fc0760f0e140a03f9e8ae9cde22ba04c8eac4fd0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function partitionKeyword (cyclomatic 15, cognitive 26): partitionKeyword 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1311f456f953c5af701d6bc69680a7b18c07ef86ef0b9f87e6b65c60b1466b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function patchInsertNames (cyclomatic 15, cognitive 24): patchInsertNames 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59b69243a1b14214f32d3773d3660baaf9143a407ca7ffbeeb4867dadb06d0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5d2c46185bb18fc126bc6838c39cdee9a04a6b8464ed0b074f02d6dbe46083"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd5eccb047fb6f3ecb7911521296694375a08dc2ff444901ca18c1eedaaf5c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function binNamesOf (cyclomatic 15, cognitive 22): binNamesOf has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa665ece23ae027f44f41d48d53e1c2336a8b485370752c3ac8f23c7e8a5eb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectSubpackagePaths (cyclomatic 15, cognitive 20): selectSubpackagePaths 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":"registry/scripts/src/subpackage-select.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc51c782aa56d1b7f6e6e54c5653bb775f6e47d36f6bdbfd33ccc6a4ebe900ec"}},{"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":"packages/dsh-plugin-shop/src/host/npm-origin.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fab4cf90b9c34e4b1bad550f04aa755a8bcbba409fe353621213806fba9ebce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyReleaseAsset (cyclomatic 15, cognitive 18): verifyReleaseAsset 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32313d9b9e090bf80a32558e0e59740b28e40e9e7441a2f01ed9e0463355307"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIconsFile (cyclomatic 15, cognitive 15): parseIconsFile 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":"registry/scripts/src/icons-assemble.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f64fc295aec9c856afe2fefffbc8f4bf59085539490b16a3ba8a3ab48fa96a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isIconRecord (cyclomatic 15, cognitive 13): isIconRecord 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bc96053f4912c4fb4d6de33d9dd5211c956456dfda6a95417dcaa281595756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordedReleaseUrl (cyclomatic 15, cognitive 10): recordedReleaseUrl 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2816}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575ffe60f0c611b858516f97604afbeb4f8334f83016c33b0547d9885328405"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectFeedIds (cyclomatic 14, cognitive 21): selectFeedIds 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a20234086b7449a54b023ed8e2da329fa980d544867ab9db7cd8daea4921575"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduceInstall (cyclomatic 14, cognitive 20): reduceInstall 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":"packages/dsh-plugin-shop/src/client/present.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0f69626589a169a006b7b19ccaba75c388c33caedb16915c042ac48077f051"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEntryCoherence (cyclomatic 14, cognitive 19): validateEntryCoherence 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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e910d2120c3059cbba162534f39fa0a897e4ca3bbcf9eea5d2cd509f2d95bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRegistryConfig (cyclomatic 14, cognitive 18): parseRegistryConfig 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":"registry/scripts/src/config.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd5632dce127efd03eae6fac18c602ea73e57e250747a1d46697b1f71e05182"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatibilityOf (cyclomatic 14, cognitive 13): compatibilityOf 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"746bb493ac0dcb973014b9d6cb0c72f1cfbdda1ad12696690d84a1635f26a22d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assignTier (cyclomatic 14, cognitive 13): assignTier 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":"registry/scripts/src/tier.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d973bee086c2c87b4c9f2a6728f74b080b764bdb8c3a28ae2281a0d8bee555f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 30): (anonymous) 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":"packages/dsh-plugin-shop/tests/client/css-tokens.client.spec.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa78d26ac3f7a7e9bc8c59abad9097140a4346c4a1a64c07f2dc442dd31f967"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateInstall (cyclomatic 13, cognitive 19): validateInstall 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":"packages/dsh-plugin-shop/src/host/install.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"af53b13ac7f37d4d1669b54f55bf8489fbdcb84214e0950ec754fcbf57c28177"}},{"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":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4cfcb65e9ad0e4f44b8aff6f0d0e89c88ba50575af1a553fbadaeae0d36d47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unmatchedRegistryNotes (cyclomatic 13, cognitive 15): unmatchedRegistryNotes 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":"registry/scripts/src/pipeline.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca75f880cff6dfa63689afd0ad3a60fd9afa347b4b07d44307c7e2795c24486"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moduleTableOracle (cyclomatic 13, cognitive 14): moduleTableOracle has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/module-table.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5298e6c36c1f15bd1e685b8e9ef5a863c98e44daaf9ba403e4ce6f85342dd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCompatibilityRecord (cyclomatic 13, cognitive 14): isCompatibilityRecord 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ebd1c757d723bba7b3dd016d0d7b7e12b5612390360bff80579e94dd94624"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFeedCoverage (cyclomatic 13, cognitive 13): parseFeedCoverage 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb53cf5d521ae2008732634a98e17a70b58d22f1363f4bb3381c2dd7315e6011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isShopLike (cyclomatic 13, cognitive 12): isShopLike has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/shared/shop-like.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3944ca85aaa2549b8ad5a8c7c87a9c7e98aea13c665e97335a07223b0f72ba66"}},{"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":"packages/dsh-plugin-shop/tests/client/web-full-flow.e2e.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ef72e54049d5515807db7946349985683ab37825dffa803e115a5daea97f1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFile (cyclomatic 13, cognitive 12): parseFile 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":"registry/scripts/src/config.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c524715c3665e02efac817010f80fe9366245a4aa41349b5d5ac6b3bcb0d4cbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectCandidate (cyclomatic 13, cognitive 12): projectCandidate 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"36843d259f8ea6b4499d1bdda06aa3b385678fdd3949baeaaf228948772cfa0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function entryMatches (cyclomatic 13, cognitive 11): entryMatches 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":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"113eecfd06027829cc0f7465d088580d923494632018f11beaf583c514aee5cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 27): (anonymous) has cyclomatic complexity 12 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2a339ec4e7fdc2a6df7f4024f6cbadce2b1d0ea03fd48a366d1ee637d3cc1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectPending (cyclomatic 12, cognitive 20): selectPending 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":"registry/scripts/src/classify-select.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28acce8bbe9e37691347cd45ce9598070fcf6651624cbb531205842641d7a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rereadDeclarations (cyclomatic 12, cognitive 17): rereadDeclarations 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"220bb7f7520dab16460b189f4faaf4d91807ec26a58e68f1559b30dd3c3c97ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatibilityMap (cyclomatic 12, cognitive 15): compatibilityMap 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":"packages/dsh-plugin-shop/src/host/compatibility.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16aca5fecc88537a8f2e40775df831c74dfa46db4ee92dc2d8342d35c7b0c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refusalDetail (cyclomatic 12, cognitive 15): refusalDetail 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":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8732a0ec0858bd55cc8fd3a045446552023d6429e7c67ac4c39c09bf4272ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dshPeersOf (cyclomatic 12, cognitive 15): dshPeersOf 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8478252bb4e676c90e5e7874c0b6d2f275efb3eccd3f55af1fc58df4eea38519"}},{"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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":3447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa287c590550477fa7ce1236a2c8ac535441b6984cabc413ad09144d2372be6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaredTargets (cyclomatic 12, cognitive 15): declaredTargets 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"09611cb7668345b2e9789e47785e2a38e1ae4a4fcbaab81276ce3261d61cf6e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarketResponse (cyclomatic 12, cognitive 14): parseMarketResponse 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":"registry/scripts/src/market-judge.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc9283d2795d3ed67e72ec0820155b390b971db90ec79be3c65e01a87041116"}},{"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":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de932228885f7c6c97d39b5ec3788c1307254f4db6861cb103c564e94ff4086"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRepoMeta (cyclomatic 12, cognitive 11): parseRepoMeta 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ef42f4b195a002d6bca2e18c5c71d36dae8f980041a192359f485987658c94"}},{"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":"registry/scripts/tests/npm-client.test.ts"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"440c7942f8e9e891414ee0670c836a837754de55c5bc59613cad3fdf9979e6d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readManagerAnswer (cyclomatic 12, cognitive 10): readManagerAnswer 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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"980cc8df88e488cbe42486d9373621830ba6c7b29e193e6791de67fcb63976bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchLatestReleaseTarball (cyclomatic 12, cognitive 10): fetchLatestReleaseTarball 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdb9c9b6cf1d643a4ad7aafc8808804f6e7c12daa787e34c451c5a146f652ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function githubOwnerName (cyclomatic 12, cognitive 9): githubOwnerName 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":"registry/scripts/src/github-repo.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"618d358b5b18f2b9f57ea9c1dd140ac1b5109d768d4e5783384e9b1518f1fa9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function catalogPublishDecision (cyclomatic 12, cognitive 9): catalogPublishDecision 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":"registry/scripts/src/npm-package.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5040499f2aca7e05de2e9f4061efca4621d51571942a9f047cb14d45a815e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function incompatibilityMap (cyclomatic 11, cognitive 20): incompatibilityMap 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":"packages/dsh-plugin-shop/src/host/peers.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed055e905a1367ac5932e6bc2070cbc2ef80ca6a2883355e7e3c022664cd020c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextRepoState (cyclomatic 11, cognitive 18): nextRepoState 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60dc0672b901a8cdd4574c1ad7b1aed26b15e1a33297f924cc25e4f9f1b974f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBatches (cyclomatic 11, cognitive 16): runBatches 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":"registry/scripts/src/llm-client.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab08438f4c412cb93826b42343bcf4cd71bcecb1c4edf512f17b3f7e375c5545"}},{"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":"packages/dsh-plugin-shop/src/host/manager-runner.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d79781f209bd69d4ebcbc629e920273f8d09cdc1047ea93173214d8c8979070"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTar (cyclomatic 11, cognitive 15): readTar has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/shared/tar.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"250b022b0a1887f4a2ed988528509594599e032efdee34ab06754f2ad7aa3f51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spendPublisherAxis (cyclomatic 11, cognitive 15): spendPublisherAxis 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":"registry/scripts/src/build.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f033a63e8c922090daecaabeb6853f4e263f1b822a4b8ac681ff7a43473169e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFeedVerification (cyclomatic 11, cognitive 15): planFeedVerification 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c616678df322da8a3e559bdb3df362bfcd0b47a7c590e26dc95a5cc6bbb2218f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rereadEntry (cyclomatic 11, cognitive 15): rereadEntry 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":3089}}}],"partialFingerprints":{"codehealthFindingId/v1":"af123ca7ab36c6620a0769599799a46ecae88c4022775d0e51301843c2db8f95"}},{"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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f818cd1905551884bd3cd879c137242f971c8c8a39cb7de3c029ed5934c943"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelKeys (cyclomatic 11, cognitive 14): topLevelKeys 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":"registry/scripts/tests/catalog-parity.test.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d8f56b259bc84fc8a2bb62183441cbbcb2b31c84372d0964ea03a4f3e500be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planIconWork (cyclomatic 11, cognitive 13): planIconWork 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":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b82bf9cad41ae55d8998c08fb03eecfb3fa2bb1bc0791f6973536701ebd72a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function treeBlobPaths (cyclomatic 11, cognitive 13): treeBlobPaths 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":"registry/scripts/src/tree-size.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb1e4c29fe6a999cce58f70ed6f344e7213a515b89d0abf349c8a3f92c4ad0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFeedPage (cyclomatic 11, cognitive 12): parseFeedPage 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a77533927ca91d7e8ab5860732dfd8051c22c0f15d7868cdf7216850103e7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileListIncludes (cyclomatic 11, cognitive 12): fileListIncludes 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":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8441b9db5432f7289d3eacfc588c7bf9175de16ed1d7dd4aae99bb208a1ec100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conditionTargets (cyclomatic 11, cognitive 12): conditionTargets 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bd9e9561e277d1f8b2452f9d7fa6d3c172c6ffd45b7624b92942b6580ad58c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RestartPanel (cyclomatic 11, cognitive 11): RestartPanel has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b7b9ceb397516d9ab0dba8239b58352c74f0127cb61360ca97967f73e4c592"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listInventory (cyclomatic 11, cognitive 11): listInventory has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fe3979b97a145c4c0e5073e5442ad9999129678d57347c32d16154ef75f2af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function file (cyclomatic 11, cognitive 11): file has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/tests/host/catalog.test.ts"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b4bbad846d1f603041971e9d0c89365d64a5186637eac63f6895cd6b093279"}},{"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":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"558a5eff6c78f1faa47df5782b8b99c6011b3b7f6da6f5dd0c985720bcff6dd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openPackedManifest (cyclomatic 11, cognitive 11): openPackedManifest 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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"208c1708d94e5daed0faa9d47abb8e961f0935c20ee9e018a206477d15614371"}},{"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":"registry/scripts/tests/github-client.test.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"873bcf68e8be27496cecd9ce81f7f96789e7bc231089ce4efcf34751ecca220f"}},{"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":"registry/scripts/tests/npm-client.test.ts"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e43ff287ffc9db673e360be3bc3df153d8c41815a2904c051a1b9e577aaaf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDeparture (cyclomatic 11, cognitive 10): classifyDeparture 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":"registry/scripts/src/departures.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9bb54f452df92b13b7de74a1faef46766ad04a53e08ce52aefbfb471790235"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harvestRepos (cyclomatic 11, cognitive 10): harvestRepos 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":"registry/scripts/src/github-client.ts"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e814440197e954d07145f0fa73ebf7c891347698129d84de9c14b7bb3923c1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePublisherAxisReport (cyclomatic 11, cognitive 10): parsePublisherAxisReport 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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a17533857b6a566b40d447535ff137c16b4a818430e6ec49a2901c0b914066b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pagesPointerOf (cyclomatic 11, cognitive 10): pagesPointerOf 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":"registry/scripts/src/pages-artifacts.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d39d7c28503aa19fe5ba0b8639732cadd64f8f3f82fee85ed842e67681cdf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRecord (cyclomatic 11, cognitive 9): readRecord has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/restart-monitor.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"699e8508b00895f14a4ac6e505f5ccf2d283834c390e445e436030ff7a73d87a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isUnpublishStub (cyclomatic 11, cognitive 9): isUnpublishStub 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0105add037c7f424503c8f16a6e4470876535d8d0f79b2a0d4b419a264aa83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function latestVersionOf (cyclomatic 11, cognitive 9): latestVersionOf 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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dfd52143f8afe04186f8a3586b855b61dd43b9140a7df4a8a407e2a814653b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveString (cyclomatic 11, cognitive 9): resolveString 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":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dd4b9186e23d20ff029ba08eca3006be7e5faa8ec59f813ea6370bd2d501b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iconsPointer (cyclomatic 11, cognitive 9): iconsPointer 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":"registry/scripts/src/icon-fetch.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2594aca8d92f28a38645b955437ebc72b74ae72295c75db355eda74dc6f13e5f"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/npm-client.ts: 3993 lines of code: registry/scripts/src/npm-client.ts has 3993 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c8d60d70ac10ce4d181b4c35cae20a778405e4dcb96a5edbe1070f57dfdb9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/client/ShopTab.tsx: 3191 lines of code: packages/dsh-plugin-shop/src/client/ShopTab.tsx has 3191 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61b1458ee93dff16d8e088a09c858a1181bceeff04bb9efee0bd47baac07553"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/github-client.ts: 3111 lines of code: registry/scripts/src/github-client.ts has 3111 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1080cff5b82e7bf9695866bc683c8c801fba57bb8159753b3cb2a77f6b1ad"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/index.ts: 2549 lines of code: packages/dsh-plugin-shop/src/host/index.ts has 2549 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c61cb0443ce3b9f7e0ef9dabebb43f524c197600f660f56849e6bb95042e76"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/publisher-state.ts: 1290 lines of code: registry/scripts/src/publisher-state.ts has 1290 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/publisher-state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4120380ebe7c9047904cfd9ad18264fa37f0299a24baea1825357a7c544256"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/executor.ts: 1048 lines of code: packages/dsh-plugin-shop/src/host/executor.ts has 1048 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac8ea65d1efb0072c92861b367cbc4871523f9e12aefb7ab0216e463e360e63"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/build.ts: 1042 lines of code: registry/scripts/src/build.ts has 1042 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/build.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d283e527b2726c8b1711c5995944d014a440a9ee1a5fdaf511abbc128d1807"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/client/present.ts: 1028 lines of code: packages/dsh-plugin-shop/src/client/present.ts has 1028 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/present.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"558577fc49dfedb161434e37e806816a4d134ac7227ee6baac1d659a52f515b6"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/repo-state.ts: 984 lines of code: registry/scripts/src/repo-state.ts 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":"registry/scripts/src/repo-state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e943b0ce1ce360d88ae7d3dd59a9905307315844216c515d51508556dc6d191"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/catalog.ts: 823 lines of code: packages/dsh-plugin-shop/src/host/catalog.ts has 823 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7061acb4504588474ceaeae009c22f56546df60440d276e2fc0eba0d4bb97885"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/icon-declaration.ts: 798 lines of code: registry/scripts/src/icon-declaration.ts has 798 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-declaration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f7fd67c056856c0cab596081f377135b0e26d95d5aeece199ea35c3992c7e9"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/feed-state.ts: 784 lines of code: registry/scripts/src/feed-state.ts has 784 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1251b04274cebffe97649c07a9e6e8d84257599f7dfbaf637aa516b5b34dbf66"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/release-asset.ts: 773 lines of code: registry/scripts/src/release-asset.ts has 773 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/release-asset.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b175e0d87241bee39a1a56dcdec71ef94a0ce3a8d89f5879031462444d634d"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/icon-fetch.ts: 635 lines of code: registry/scripts/src/icon-fetch.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":"registry/scripts/src/icon-fetch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac68805a5aeebbc1f511dad8a5d4e87816cf92984a9827780c6e99323c908f"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/icon-plan.ts: 595 lines of code: registry/scripts/src/icon-plan.ts has 595 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/icon-plan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b77ca14c7c670347454be10af55f37c34f8fef3495bc8dc2ea5a879ebfe24a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/peers.ts: 531 lines of code: packages/dsh-plugin-shop/src/host/peers.ts has 531 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/peers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21c37b1c600dc8e8edac4e655a53086167b38de466d18423ac7665c1609087"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/gate.ts: 516 lines of code: registry/scripts/src/gate.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":"registry/scripts/src/gate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5679e774f299b3d5ec6b435c681e949ace2a7a2f42a22f757cfe4a0271ffac1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/plugin-manager.ts: 512 lines of code: packages/dsh-plugin-shop/src/host/plugin-manager.ts has 512 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/plugin-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a4a7621a55a1f1ac9c02c690ed34c67d4fc1e1400cc09a778ca4486f0dbbc0"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/pipeline.ts: 510 lines of code: registry/scripts/src/pipeline.ts has 510 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/pipeline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3048043f63643ab13a52e8b7d51491bc4e80d54ffaccf41085d8e36d2b3f9bc"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/client/page-store.ts: 509 lines of code: packages/dsh-plugin-shop/src/client/page-store.ts has 509 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/page-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b831e3debb1ccc6554f8cbeabf84bae5cf956508357e651af95b1feaee467889"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/client/index.ts: 493 lines of code: packages/dsh-plugin-shop/src/client/index.ts has 493 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b6498002004585c756d8376ac54a4dcee2db45755baa99c263495461eb415"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/prefetch.ts: 446 lines of code: packages/dsh-plugin-shop/src/host/prefetch.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/prefetch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9314f51c78c94827786a0b22261879badc702a024af0fceda798a6ef959ececc"}},{"ruleId":"R3","level":"warning","message":{"text":"registry/scripts/src/emit.ts: 437 lines of code: registry/scripts/src/emit.ts has 437 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/emit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb946cfad6da964a688e5dec38e080ff4c4c5187e2ac7bb71054ef8d0bf13b6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/dsh-plugin-shop/src/host/hot.ts: 401 lines of code: packages/dsh-plugin-shop/src/host/hot.ts has 401 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b240d738169d1c1b3ff2c7c3366174aa4e4088202ad947ef7b26f03892b47221"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/scripts/shoot-readme-screenshots.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf5e9b077fc4681ec93cf34f35f7e8a08d14df53dab1b5fc5dc4b1825d8cc5d"}},{"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":"registry/scripts/src/publish-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133baecdd3098310ca3813bf32763fe7b890d794e725165da6be93b9ba382605"}},{"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":"registry/scripts/src/backfill-first-seen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf968d289efd669bd9a873cf7850493a0783b49e274691044e087665cd793d"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_SEARCH_PAGES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/github-client.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c86b4974f1806741770cf21e8afa351f983cab0f63abcbaa31ae6c68128579"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_DEADLINE_AGE_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/pipeline.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc90774060fe49db1cb472b4138d97c99d2f43b4ec75305fb899a64e0f6b52e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PinCell\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/publisher-state.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf7a69cf4b69c7f84cf40c5340f8f1bb6da2daeb818bf543d0fff81536b56f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TOKEN_MARK\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":"packages/dsh-plugin-shop/src/shared/zh-intents.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be770325051a77535eef5c74f840ae5ef5b8179e76c275d4424729c560545fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(response.status === 429 || response.status \u003E= 500) \u0026\u0026 attempt \u003C RETRY_LIMIT - 1\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/github-stars.ts, registry/scripts/src/npm-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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e382831cae6e664de5c3636cb0f2e2e4530087fd7715ea76f7fa2aa779cfa086"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(retryAfter) \u0026\u0026 retryAfter \u003E 0\u0060 appears character-identically in 3 files \u2014 registry/scripts/src/github-stars.ts, registry/scripts/src/llm-client.ts, registry/scripts/src/npm-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":"registry/scripts/src/github-stars.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2225fbffe6894c00b94def27a465feeb5784c857c691f9bd2374fdea490f9a7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.catalog === undefined || candidate.catalog === null\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/gate.ts, registry/scripts/src/repo-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":"registry/scripts/src/gate.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e8112a700f1ab904db66436245103f4e4ee6cdc7be6c484ec2c3832a5fb9d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.license === null || candidate.license === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/gate.ts, registry/scripts/src/repo-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":"registry/scripts/src/gate.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc0f2c3f6e7b733b36adc306b2bbcc9955aba56ade61cfb42146fd9f72ca6a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current.exportName === marker.exportName \u0026\u0026 sameInvocation(current.invocation, invocation)\u0060 appears character-identically in 2 files \u2014 packages/dsh-typert-protocol/lib/index.js, packages/dsh-typert-protocol/lib/types/index.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":"packages/dsh-typert-protocol/lib/index.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8195611cf8bb98fa2a2248cd84ecaab5032d403c6edd3d3a5286625330e4b85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060description === undefined || description === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/gate.ts, registry/scripts/src/repo-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":"registry/scripts/src/gate.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8e6c9332233d241f511df95f6c86229be3c901c62b3e6f754cd973b3485a87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inside === \u0027\u0027 || inside.startsWith(\u0027..\u0027) || isAbsolute(inside)\u0060 appears character-identically in 2 files \u2014 packages/dsh-plugin-shop/src/host/hot.ts, packages/dsh-plugin-shop/src/host/profile.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1ad86293082e867eaf49ebd3d3c9a09a42f0c293e8ea6ce140074cbfd3d220"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item === null || typeof item !== \u0027object\u0027 || Array.isArray(item)\u0060 appears character-identically in 2 files \u2014 packages/dsh-plugin-shop/src/host/hot.ts, registry/scripts/src/release-asset.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2bf575a8926a8b1ce6a175623fe698725951d489966f6670266043bcd1d768"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed !== null \u0026\u0026 typeof parsed === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/github-client.ts, registry/scripts/src/github-stars.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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"284422b61a8760264493d6d57f52d14cc3213c4bfda7112aa56fe8fce4a95ac5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw === null || typeof raw !== \u0027object\u0027 || Array.isArray(raw)\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/departures.ts, registry/scripts/src/npm-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":"registry/scripts/src/departures.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8865442589a9bbf5804c1de219fe63beae53bfcbf95f2d0821c9d7ef6d9a4d23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rawBackupRegistry !== undefined \u0026\u0026 rawBackupRegistry.trim() !== \u0027\u0027 \u0026\u0026 !URL.canParse(rawBackupRegistry)\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/build.ts, registry/scripts/src/classify.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":"registry/scripts/src/build.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"166b10fe8d4977b082b8dac81cda9380f6758f8d1077fb8cbe488b439fd37120"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment === \u0027\u0027 || segment === \u0027.\u0027 || segment === \u0027..\u0027\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/github-client.ts, registry/scripts/src/release-asset.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":"registry/scripts/src/github-client.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b113b68c331b56ada6448070c10857382ca36269c9a6ef578c33a690e4245485"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry !== \u0027object\u0027 || entry === null\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/npm-client.ts, registry/scripts/src/repo-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":"registry/scripts/src/npm-client.ts"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa8ef1e01421c155ab9f69526b12111d1ed1f95b7f62e91061c70fd75e303a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof index !== \u0027object\u0027 || index === null || Array.isArray(index)\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/icon-fetch.ts, registry/scripts/src/pages-artifacts.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":"registry/scripts/src/icon-fetch.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bfc1b72289782d003a21a935ffb9ff4560d20f732fde1bf9fbc2249964f145"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof manifest !== \u0027object\u0027 || manifest === null || Array.isArray(manifest)\u0060 appears character-identically in 4 files \u2014 registry/scripts/src/github-client.ts, registry/scripts/src/icon-declaration.ts, registry/scripts/src/npm-client.ts, registry/scripts/src/release-asset.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":"registry/scripts/src/github-client.ts"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3fa947464ae69c5a4b63ab9a62d9b68ff83fccc12bb1465877db70fe8a400b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof manifest === \u0027object\u0027 \u0026\u0026 manifest !== null\u0060 appears character-identically in 2 files \u2014 packages/dsh-plugin-shop/src/client/module-table.ts, packages/dsh-plugin-shop/src/host/peers.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/module-table.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec14b82bfb0f34be7ae90e0292355a47a126764c74fd5a788937b27694fc328"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed !== \u0027object\u0027 || parsed === null || Array.isArray(parsed)\u0060 appears character-identically in 6 files \u2014 packages/dsh-plugin-shop/src/host/repo-pins.ts, packages/dsh-plugin-shop/src/host/state.ts, registry/scripts/src/github-client.ts, registry/scripts/src/icon-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":"packages/dsh-plugin-shop/src/host/repo-pins.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d219292f640c25b97553db09b695fb4de215094ce1871cb5d1bd9b9eb2aa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof service !== \u0027object\u0027 || service === null\u0060 appears character-identically in 2 files \u2014 packages/dsh-plugin-shop/src/client/module-table.ts, packages/dsh-plugin-shop/src/host/plugin-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/module-table.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb673473268bf02346e1170ecbea47eb083783f77347697993e902ce45639dbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null || Array.isArray(value)\u0060 appears character-identically in 4 files \u2014 packages/dsh-plugin-shop/src/host/state.ts, registry/scripts/src/icon-fetch.ts, registry/scripts/src/icon-state.ts, registry/scripts/src/repo-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":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7df7d9a712887803c7743e82c9cb5a6027a723725bd3f3abcd83cdd51ec58a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isSafeInteger(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/departures.ts, registry/scripts/src/feed-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":"registry/scripts/src/departures.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"863586fb020559a1e171e417d542002eb0d7c74a4df80a5a2bac1c340b015d81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null\u0060 appears character-identically in 3 files \u2014 packages/dsh-plugin-shop/src/host/harness.ts, packages/dsh-plugin-shop/src/host/plugin-manager.ts, registry/scripts/src/emit.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/harness.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"421dcff62f5ff48a0cca2202ec67a32444fe94a85c0330bea0a7a5787acd5d06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof version === \u0027string\u0027 \u0026\u0026 version.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/dsh-plugin-shop/src/host/harness.ts, packages/dsh-plugin-shop/src/host/peers.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/harness.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"125dcf89fd3fd82c5065d20eae506cc77a95f5918ab58bbd7cfac96b42e1b479"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 registry/scripts/src/feed-state.ts, registry/scripts/src/repo-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":"registry/scripts/src/feed-state.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"28687895b43aa48bf044f07f2e89728520533ff2abc633a609a19ebb82ec25fb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseFeedPage\u0060 is exported, takes a document from its caller (line 366) and hands it to \u0060isSeq\u0060, which calls itself at line 370 (\u0060isSeq\u0060) with a piece of \u0060value\u0060 (and at line 377) \u2014 and nowhere in \u0060isSeq\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 \u0060isSeq\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6ca59190d2729a7bd6b37ae5e30ba56170ce6c1ec6d21095a6e3ba5635f78f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseFeedRunReport\u0060 is exported, takes a document from its caller (line 745) and hands it to \u0060isCount\u0060, which calls itself at line 753 (\u0060isCount\u0060) with a piece of \u0060value\u0060 (and at line 764, line 791) \u2014 and nowhere in \u0060isCount\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 \u0060isCount\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"registry/scripts/src/feed-state.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b27392077ab616db615217bc3f173d65f7757c5264c462453a0279bf45b690"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/1 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: probe: \u0060probe\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":"packages/dsh-plugin-shop/src/client/restart-monitor.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"789210941f842fd6bc6ea159d159683e415b4c4ff28e193fde949eddf1b95de9"}},{"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":"registry/scripts/src/backfill-first-seen.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28ca120e76dd1a4411711d76955ef4c9bd2d2f1acd986bfeea966ad378fc0a8"}},{"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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e3bfe97fec4162c8004d0051aad7c4459ae115bd2875fcaf282879ee34d7d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69a74cd24870e68a71323c4f25eaeb69b71e8915282a2cffcf1d552a2afc269"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a73d60d3771f72fa1de7fbc40a8d22c95d84d4e416e00c09586489ee696b968"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"c886b6132384bb86e1c06ace21659cc0b5693fa9d66a4a2eb960f040a13efc76"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d523441b2053df0e52edbe94f31a53bacaad536bad21c3c6461a17e98580907"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76437cd9b30ca7046f7dfa45b2399b21059d2aa27e02daabd8c3c90a229dc57"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbf881e333174e64565153d587dd69e0a554e5b71221b718796958e72ec630f"}},{"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":"packages/dsh-plugin-shop/src/host/compatibility.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27d8cd2b76926db53d15c05ed1969387e5428925576aebbf7f5db8869729ec5"}},{"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":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52e292a39d57c0402d9670a0e373c93f10a3d28663a1b564f499fa13ff43444"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16b34303fc454639e41d1e5e6f25cb1a777b66612a0798ad203823b43879adb"}},{"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":"packages/dsh-plugin-shop/src/host/executor.ts"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfce6caaa588095391eeff089fb3826e6722b257781088ea9b283d583265198"}},{"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":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"873edddc13128d3de2beefd92fa8727bb1334c7953ad429f60fcd19f39cbb493"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4e1531f209f424087160164a92ee959e76c46f546c53fc6c2671eed1dbf659"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e051db9a7de16c68138c52e69932120101247bcc35c5d4c0353198e91db755c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781dc60163ede8844923991e056d2f9e48edb3751551487db00dde2d99b5fc2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d3e69db158a2ebe772e5a2a483c8a5021dca5c1dfcd954dd78e2abee4ccb9"}},{"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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f38b0dd5ca180efcddebdf5965b78683983dc8995ca30f19651a9b8feed9c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea55cdca1e24cb182fb1d28e83d9bc028798f39095062d82b93eca3f77ac4ba"}},{"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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"e289b7f5fd9044e65c6f905895f3c9b7733981b5d3d01d03aeb683847963fd3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0401ce91dded1277f803be70a15012a520138c308a5ea980c751d95e7e70e634"}},{"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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"202181b562f546b2e0fd2dd1cb7e6225aa5651ccdc9ea165cbe260760015a910"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69bc12b52186bcdf20f24bbef81d507a85783f927c55577bb0ceb740bcd3e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/manager-runner.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c0d83bc34fd4782b2cf5573da23cad22309d19ad21d66192296d919d704c89"}},{"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":"packages/dsh-plugin-shop/src/host/manager-runner.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4856e0cc4c5fa0c4a8864347095b3035ba5c500fd0a7dd07a00674c4ed9b91f8"}},{"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":"packages/dsh-plugin-shop/src/host/manager-runner.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b17a593fe282efec855b090d90efff2c7833fad88dfbbb12aaa98f1c9ea431"}},{"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":"packages/dsh-plugin-shop/src/host/manager-runner.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"368536a44b9e0cc355d44b4663ba809d5c0e9b668072803a48a50f483938cdd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/origin.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f109cd2a3299d74571f4d3a55266a00de935e33c746601cbe3568ab7784f7bb2"}},{"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":"packages/dsh-plugin-shop/src/host/peers.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"222874e39d1713d08c88f9be9123d3bd5a0d6c7279d86cf8c626cf19e9ae6698"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/peers.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87cfae36b844b2f6a83b2e7dfcf3aa706e1af48ac601dcceaee20ca108d92d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/profile.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba610eeb670a8fa495c5610fe4d257b1f01c391dd3c9ef56be6c4506f6d6125e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/restart.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"76eb64bfddfd09b99bf21c597921098bd3c1755578dfcc46a8c28bb699bc86da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/host/state.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc46de6ca582605a4867d9af97f9f007be3df338c56786f2e95dec1c80bb7ec"}},{"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":"packages/dsh-plugin-shop/src/client/flow-registry.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"51682e9379cdf7291b2de9aa4900ba580b1d79bc27b82af3008474f607e5cc53"}},{"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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb2d6bd971db7df4962dbe0b39653561b249ce25c1600cb68c5ccd0ef5fc70a"}},{"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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d779b9965997cbcc16a27005e8ae5384ac07724e12178bd0969042f76865b2"}},{"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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d801df62bedcb8d711c78950462a9575f895c5fc068243cf8ee9f397632e41"}},{"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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b24172627f236633eb8b1921c502f479627c27b0f028480bceb7423785e34c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1442bf2e2c7f448c350af7daf6582c531af0d23697881a75938a9a310bb1caea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac325351f35ab6282907346fe5ba4908d0b185cc365f789340dd5dfc40391adc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c5787e1eb31257ff90243cb65c43e0a0ca71a1861657312099fb7eaf520f7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ccf853edbc2c55a99174c7fb170f6668fdc7093ad1b8cf361158da00cf83a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5b4c24ba534ae30918a584659d3821ab4f0e7e87eb989c8a2e5cf37ad7a498"}},{"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":"packages/dsh-plugin-shop/src/client/index.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24748254e0b2960dca177bf2fa4dcb01139c745898c7be640a31d19a8eb2238"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/restart-monitor.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"419800cfab9c4bfa1c53ca5b9712c5bae47aed3725ad5f2e48e5a25d17610652"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/restart-monitor.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61e105fb86995d93ae1353ead34400ce023a3c635d24d1df12d3cbaef106a1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/restart-monitor.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"398e6eeb66a7d8685b462b9986c8d28b5bbaf4bb7bb93c750f413c9dedb985eb"}},{"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":"packages/dsh-plugin-shop/src/client/ShopDetailAction.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7c0df7af7e1209972eb3c5065a07916695b762956dc0f5f116ee6ef3676be5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7e4abf2188189809e84f84edd1bd155d7f87905954882ce0a860f08ba7977d"}},{"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":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"2505f012db42b194207a1d41b171df46bd1246ccccf4e5568b201d9c85184d9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"009004e7fc4be832129c79ee0ddebf25b27f7dd35e40061be09ff61fd9a8d817"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dsh-plugin-shop/src/client/ShopTab.tsx"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c1d4da0809aae5e2cf77c7e83a075d1c6ffe76fd8a6aef566aed3776571491"}},{"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":"packages/dsh-plugin-shop/scripts/shoot-readme-screenshots.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d646b480c1259a8722adc9bd526343cd27877439a70fcc24c39138b87ba2cb"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.1 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 5 assertion(s) across the 41253 source line(s) of the 103 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: packages/dsh-plugin-shop/src/host/catalog.ts (3), registry/scripts/src/repo-state.ts (2). 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":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseStarsText\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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a99499add3bafb00c2161108a7a639bdb27f752a01a66c08583afe88bd19f95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseIconsText\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":"packages/dsh-plugin-shop/src/host/catalog.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9958aebe53b6d899132d700e469a507a454d187b3658aa93578adcf66365fecf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060nextHotNumber\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":"packages/dsh-plugin-shop/src/host/hot.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a376eb69f47484bca28f88def03b0ba533865571ed39fd856340b47dbfd2ed3f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readRepoPins\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":"packages/dsh-plugin-shop/src/host/repo-pins.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"105b792aea8a7c07a0456e599fa5106d3375afea0243faeeb9c82e918b07699c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060idsOrNone\u0060 (in \u0060collidingEntryId\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":"packages/dsh-plugin-shop/src/host/profile.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a904964d59764247321fc52a15747071c08e392e7ccb40ba36317091297db3a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ownedEntryIdsOrNone\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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ebb6d04faae41ed11a9ec1a7e70bbd9c1c747f21cbe5c52e80dd0e62a14ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060refusedByHarness\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":"packages/dsh-plugin-shop/src/host/index.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8798482b544e0f6e51cee6c42d02e279dfcb7cf95716aa6469cbb59bef50967b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060patchInsertNames\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":"registry/scripts/src/release-asset.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"096147517492a57008f25901c015df54383e7934304c3054d310ab0b5b10216c"}}],"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-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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"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"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":30,"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."]}]}