{"$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":"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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"ArchiveCommand.run (cyclomatic 169): ArchiveCommand.run has cyclomatic complexity 169 (threshold 15). Of this number, 157 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"275fbc043a9d7f93cd4d806e85c7dff625bbc69f30ae9519ae5e0cd80ccc4357"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateCommand.execute (cyclomatic 72): UpdateCommand.execute has cyclomatic complexity 72 (threshold 15). Of this number, 71 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c189e4ac653cbe634b94c4fc9dfcbeba85701948ca2d44cb941a3869849545"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.schemaInitCommand (cyclomatic 72): schema.schemaInitCommand has cyclomatic complexity 72 (threshold 15). Of this number, 65 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8ef8fdb639e36aca2e771e781d94ee0a2b2cdc0037a47835a42b827be18f18"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator.validateChangeDeltaSpecs (cyclomatic 69): Validator.validateChangeDeltaSpecs has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3837a00f547b9c61c4947439dd8866a8ce837a0d13a741b6951c2429c4125e1a"}},{"ruleId":"D1","level":"warning","message":{"text":"InitCommand.displaySuccessMessage (cyclomatic 45): InitCommand.displaySuccessMessage has cyclomatic complexity 45 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"76031fe999a45334f7df12b8d6cabf70f86e34241d9889360b521bd0e4df5777"}},{"ruleId":"D1","level":"warning","message":{"text":"searchable-multi-select.createSearchableMultiSelect (cyclomatic 43): searchable-multi-select.createSearchableMultiSelect has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 87, 54, 72, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prompts/searchable-multi-select.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"86552b7a49635dd2e48c8a81bf9f05d524329aaf12494efb82b0ed0d0511ace9"}},{"ruleId":"D1","level":"warning","message":{"text":"InitCommand.generateSkillsAndCommands (cyclomatic 43): InitCommand.generateSkillsAndCommands has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef15ab828119238bc24fe48cf1b18d2fe464387f5449a180e2c9cabe6e3c7042"}},{"ruleId":"D1","level":"warning","message":{"text":"ListCommand.execute (cyclomatic 43): ListCommand.execute has cyclomatic complexity 43 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b4cdcf403a10fa34d57885e9cf17d31a036a4642c6947d7816acd8c95a5802"}},{"ruleId":"D1","level":"warning","message":{"text":"archive.restoreSpecSnapshots (cyclomatic 40): archive.restoreSpecSnapshots has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7039332c8715206d684016713f03a8bbb59fb4baed0866a9186741a965bfd65"}},{"ruleId":"D1","level":"warning","message":{"text":"shared-skill-install.installSharedSkills (cyclomatic 39): shared-skill-install.installSharedSkills has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (shared-skill-install.installSharedSkills::settleOwnSkillsFolder) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"601bfa1e00f895a99bdbb5f3117a17135e3834d8366499cf3035fa45d452923a"}},{"ruleId":"D1","level":"warning","message":{"text":"instructions.generateApplyInstructions (cyclomatic 35): instructions.generateApplyInstructions has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcbd8944859e266c2559678f64f3e82dce29d160bdd69604fb915b18c8cebba"}},{"ruleId":"D1","level":"warning","message":{"text":"profile-sync-drift.hasToolProfileOrDeliveryDrift (cyclomatic 33): profile-sync-drift.hasToolProfileOrDeliveryDrift has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profile-sync-drift.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6359fd8ae7dd09a1d93114d06b073cea578a4d01bb12cd5660623f22bbaff0"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidateCommand.execute (cyclomatic 32): ValidateCommand.execute has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2ec5f84467a7bbbb4d018c75c71303d62e2d5db097fad5445b0bda7caefe81"}},{"ruleId":"D1","level":"warning","message":{"text":"project-config.readProjectConfig (cyclomatic 31): project-config.readProjectConfig has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6105b0dbfe7b043d58faf8fcd53be4770368c42627ccf7a1d985e8037021b1d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidateCommand.runBulkValidation (cyclomatic 31): ValidateCommand.runBulkValidation has cyclomatic complexity 31 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7652f61eb9ae8fc22f67b6a7a0fdfe4cd412867e35a797e3c0c13a86255c30"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.schemaForkCommand (cyclomatic 30): schema.schemaForkCommand has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fd2ad2a0d1a1b7a13a570e3c58fbc309e37632db0b7cd6eeb8816e8e5acb75"}},{"ruleId":"D1","level":"warning","message":{"text":"shared-skill-install.installSharedSkills::settleOwnSkillsFolder (cyclomatic 29): shared-skill-install.installSharedSkills::settleOwnSkillsFolder has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (shared-skill-install.installSharedSkills) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"724cbc3124e7e9327e28100a0c62e904030c551e2f0da67f9796976d2864230c"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.schemaValidateCommand (cyclomatic 29): schema.schemaValidateCommand has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ab037f5c60225408fd8e57a09a9dac008332fc29bef485116f47d7bf3d1e31"}},{"ruleId":"D1","level":"warning","message":{"text":"shared-skill-install.ownSkillFolderNeedsWork (cyclomatic 28): shared-skill-install.ownSkillFolderNeedsWork has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f511876ad720a89f94e265d9eeca641b48d25091bb6751d80dbf57dc097946"}},{"ruleId":"D1","level":"warning","message":{"text":"InitCommand.getSelectedTools (cyclomatic 28): InitCommand.getSelectedTools has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 13 of the 28 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 682, 667, 693, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"780f24fa62095f26da4369bfa66c88e24592ea79e0e3cc1a30c06217d25f9cc3"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateCommand.upgradeLegacyTools (cyclomatic 27): UpdateCommand.upgradeLegacyTools has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2052929d55b2a767517503523fe0a0a36275baec24d777f07025acb436d5a980"}},{"ruleId":"D1","level":"warning","message":{"text":"status.statusCommand (cyclomatic 26): status.statusCommand has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a5e4c6cfb9980b45939953c705f53f55448f4e401c765d7e3d0d37c0735b94"}},{"ruleId":"D1","level":"warning","message":{"text":"InitCommand.execute (cyclomatic 26): InitCommand.execute has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b40d02fa00e1f71b490ed2d838f5070325f46ebeb7ab21b376965c1804721e0"}},{"ruleId":"D1","level":"warning","message":{"text":"legacy-cleanup.cleanupLegacyArtifacts (cyclomatic 25): legacy-cleanup.cleanupLegacyArtifacts has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88c52c11e9f28ac06e5128ff8aab221bdafda76501b31975a51816b078c3980"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.setupPreparedStore (cyclomatic 24): operations.setupPreparedStore has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5404f07c4c91776aeee6657490bb5f3f365833c21ad2e646084f5012d5f4c49f"}},{"ruleId":"D1","level":"warning","message":{"text":"tool-detection.getToolVersionStatus (cyclomatic 23): tool-detection.getToolVersionStatus has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/tool-detection.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c213e95f0e817855a8ad882675272c190670e31fe7cac712ec8ce527711d89"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateCommand.handleLegacyCleanup (cyclomatic 23): UpdateCommand.handleLegacyCleanup has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09ec943285592fb04a4efca7beecfac9815eb397a290857ba18ba1c3f1eef72"}},{"ruleId":"D1","level":"warning","message":{"text":"WorksetCommand.open (cyclomatic 23): WorksetCommand.open has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac1d74f2889002c94b501b284b6c6577bb3d619f21e956925e57a563fef675"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.listSchemasWithInfo (cyclomatic 22): resolver.listSchemasWithInfo has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75500201a6ea58f67389aadef38b1e64a8d3c87fc398b117de19ac259e1c9c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidateCommand.runArchivedTaskValidation (cyclomatic 22): ValidateCommand.runArchivedTaskValidation has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7477748f6520831a7399af9731ef905c42814d8bee174073cbeb264be47b3f8"}},{"ruleId":"D1","level":"warning","message":{"text":"migration.scanInstalledWorkflowArtifacts (cyclomatic 21): migration.scanInstalledWorkflowArtifacts has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9d8ae06d172b75f0ca9f30b9ffd01df38f0cc541be18432ca8c44d05e05af8"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.registerExistingStore (cyclomatic 21): operations.registerExistingStore has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"8867ff7e6e18de541218695e8819b3d16923bd43c369cb8c426241ae0ddb8dbb"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionCommand.installForShell (cyclomatic 21): CompletionCommand.installForShell has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/completion.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc8ac203ef4802b2c57ea41245ae7836317418bb4cfd395e9cd0aedf1a9be4"}},{"ruleId":"D1","level":"warning","message":{"text":"migration.collectLegacyToolMigrations (cyclomatic 19): migration.collectLegacyToolMigrations has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5941836d6c15e7a90bc778ffc12b65656af44460d758be456ebb54a4c4a2a1"}},{"ruleId":"D1","level":"warning","message":{"text":"project-config.parseDeclarationList (cyclomatic 19): project-config.parseDeclarationList has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9380c163e6700581b218ff7af37a8f680f9fc58159f672307f27a885fb621dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"config.splitEditorCommand (cyclomatic 19): config.splitEditorCommand has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4e1d879c4b206c877147fae52b7c8e2fdc96437019731c82ba578c7e1d7721"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.schemaWhichCommand (cyclomatic 19): schema.schemaWhichCommand has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc8def0d6cd4012382ab440c025b6a4c3ddd31218fd3d54c2332694f27bd446"}},{"ruleId":"D1","level":"warning","message":{"text":"outputs.assertBraceNesting (cyclomatic 19): outputs.assertBraceNesting has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfd16c6c9bda35d46e5bd2513efa156016db6a3c2e1a5a7d27d549cae290579"}},{"ruleId":"D1","level":"warning","message":{"text":"instructions.printApplyInstructionsText (cyclomatic 19): instructions.printApplyInstructionsText has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"669939207c61c309b331df3b5c2c04a2ad461252e8f26baee02da8278c209bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"ZshInstaller.install (cyclomatic 19): ZshInstaller.install has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8302a1e9b2c99bf8ade5bb434fe130c4e4488d8774f6eaf6bb8843c7d9b7d4"}},{"ruleId":"D1","level":"warning","message":{"text":"config.configProfileCommand (cyclomatic 18): config.configProfileCommand has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea6048322a3369e3df15bff12e6533bce422d5a92e32e997ae84fec7e587b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"requirement-blocks.extractRequirementsSection (cyclomatic 18): requirement-blocks.extractRequirementsSection has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f511a3ac45ef368db37f6e908d9d735321a1477b2feafc189b77950a22013392"}},{"ruleId":"D1","level":"warning","message":{"text":"references.assembleReferenceIndex (cyclomatic 18): references.assembleReferenceIndex has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"09448b03f24fe5a770761ad12c3c3659eacccc43ad37fac6f244f68fea82186c"}},{"ruleId":"D1","level":"warning","message":{"text":"file-steps.FileSteps (cyclomatic 18): file-steps.FileSteps has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 5 function items inside it that branch (onKeyDown, a function literal at line 164, a function literal at line 97, \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":"website/components/file-steps.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb99e40a37423bb9d212a49876f3cb5994d5a96e71a6cce4c5da9e87b3ad0648"}},{"ruleId":"D1","level":"warning","message":{"text":"released-output-sweep.findStaleReleasedFiles (cyclomatic 17): released-output-sweep.findStaleReleasedFiles has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/released-output-sweep.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"274380b17fb2dbbdc3803c4b9daafd478761d2843ac5eb06aaf6fae360d7e195"}},{"ruleId":"D1","level":"warning","message":{"text":"relationship-health.inspectRelationships (cyclomatic 17): relationship-health.inspectRelationships has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/relationship-health.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"615949935c3b1f0eb6e954d8e9990a28a540ae5dd6e7447911ebb384c3e5c3a4"}},{"ruleId":"D1","level":"warning","message":{"text":"workset-prompts.composeInteractively (cyclomatic 17): workset-prompts.composeInteractively has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset-prompts.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"579fcbbccfa6bbdd03e07e428155de6a6e7b9449b1fe7447a33cf91bab3d3a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"instructions.printInstructionsText (cyclomatic 17): instructions.printInstructionsText has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"688118ec09dfa1dd3b5c581c7dec2266230fe03e3fc1bcf48998a442d61b64ed"}},{"ruleId":"D1","level":"warning","message":{"text":"install-standalone.installStandalone (cyclomatic 17): install-standalone.installStandalone has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/install-standalone.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb2fb7f69ff1ed61ed502ed3ed09914be716cbcceddd33e880d53b76bba5c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeCommand.printDiffText (cyclomatic 17): ChangeCommand.printDiffText has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1c88600c26337b63d0bd7d1dd48f29af0e728b51f1cfc1b8b291127ab56add"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-links.classifySkillLinkSpot (cyclomatic 16): skill-links.classifySkillLinkSpot has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/skill-links.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"513c5abc76480f0a6898951b586ba783478d291f359e6560e9ffdf620f338772"}},{"ruleId":"D1","level":"warning","message":{"text":"available-tools.getAvailableTools (cyclomatic 16): available-tools.getAvailableTools has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 31, a function literal at line 47, isSharedPath, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/available-tools.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca78617698f097b9f797e89b43b54dd1bb45c8150e680ee2d7ad2caadb670c"}},{"ruleId":"D1","level":"warning","message":{"text":"project-config.parseOperations (cyclomatic 16): project-config.parseOperations has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ac975ec346f38052cc483b2af17b15455ba8edf8443130534c0212c119f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateCommand.removeEarlierReleaseLeftovers (cyclomatic 16): UpdateCommand.removeEarlierReleaseLeftovers has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"56419ec8ada6f17726c5b4f58fa4bcfa2aea77002d221171ec82d31f12de2e92"}},{"ruleId":"D1","level":"warning","message":{"text":"requirement-blocks.findUnappliedContent (cyclomatic 16): requirement-blocks.findUnappliedContent has cyclomatic complexity 16 (threshold 15). Of this number, 12 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":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7e14b8012599ae2acfbfe12d0b2bb88515ddacf3d4e114e70561dc2f46e3ac"}},{"ruleId":"D1","level":"warning","message":{"text":"requirement-blocks.parseRequirementBlocksFromSection (cyclomatic 16): requirement-blocks.parseRequirementBlocksFromSection has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6649be11897fafdde7d744006a5ae58571707276ccc24d4401a6b9b081d37a27"}},{"ruleId":"D1","level":"warning","message":{"text":"change-metadata.readBooleanMarker (cyclomatic 16): change-metadata.readBooleanMarker has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-metadata.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8ff459878c81a414fbf440b04a3935dfd1f463745d7673600e7d48747ff08"}},{"ruleId":"D1","level":"warning","message":{"text":"instruction-loader.generateInstructions (cyclomatic 16): instruction-loader.generateInstructions has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/instruction-loader.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"083199a07baa33c7527f5581469f0478faa30643aee652f63f77de67cd8f2dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"file-steps.parseSteps (cyclomatic 16): file-steps.parseSteps 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":"website/components/file-steps.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a506d093c3126dee40f0a1f43f374c428738e580a83656d6bb45ded5ea7c0034"}},{"ruleId":"D1","level":"warning","message":{"text":"preview.resolveStaticFile (cyclomatic 16): preview.resolveStaticFile 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":"website/scripts/preview.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e344eee193acb3131e472e90f0aab2b1b52b518c3687752beba265a7e6829c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveCommand.run (cognitive 546): ArchiveCommand.run has cognitive complexity 546 (threshold 15). Drivers by points: if/else 93 (315 pts), ternaries 25 (110 pts), loops 15 (60 pts), error handling 11 (42 pts), boolean chains 19 (nesting depth added 383). Of this number, 495 points are the body\u0027s own statements and 51 belong to 5 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/core/archive.ts holds 5 of the 109 methods over the threshold \u2014 including the worst \u2014 and 605 of the 2355 points over it (26%), 2.8\u00D7 the next-largest file (src/commands/schema.ts at 219). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a27ee65d32969785e71e8df2f308d54824c5c8bf533102be4ce508502b698"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validateChangeDeltaSpecs (cognitive 141): Validator.validateChangeDeltaSpecs has cognitive complexity 141 (threshold 15). Drivers by points: if/else 42 (84 pts), loops 15 (26 pts), ternaries 6 (20 pts), boolean chains 6, error handling 3 (5 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dedbbc28a72d81c84461958e6e2a26eafcf23f156b0aa15d98276c9e33fc81d"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.execute (cognitive 114): UpdateCommand.execute has cognitive complexity 114 (threshold 15). Drivers by points: if/else 43 (73 pts), loops 10 (21 pts), ternaries 6 (11 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 47). Of this number, 112 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0ccaa4412b0fae2a35e1d425ccf39dc83df220b69c95f41a2e44c139c5a59c"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.schemaInitCommand (cognitive 112): schema.schemaInitCommand has cognitive complexity 112 (threshold 15). Drivers by points: if/else 48 (75 pts), error handling 8 (13 pts), boolean chains 11, ternaries 6 (8 pts), loops 3 (5 pts) (nesting depth added 36). Of this number, 104 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":"src/commands/schema.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dd0f2179fe011a59e83662add95dc8d20d3a5d6aeaf670a61394debeeadd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"ListCommand.execute (cognitive 96): ListCommand.execute has cognitive complexity 96 (threshold 15). Drivers by points: ternaries 16 (51 pts), if/else 15 (24 pts), loops 6 (11 pts), boolean chains 7, error handling 2 (3 pts) (nesting depth added 50). Of this number, 81 points are the body\u0027s own statements and 15 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a46b7a6008974e5c0c1da5fce88a9d33bec0a1efad42c4202baff4e97cbb78"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.restoreSpecSnapshots (cognitive 78): archive.restoreSpecSnapshots has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (46 pts), boolean chains 13, error handling 4 (12 pts), ternaries 2 (6 pts), loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/core/archive.ts holds 5 of the 109 methods over the threshold \u2014 including the worst \u2014 and 605 of the 2355 points over it (26%), 2.8\u00D7 the next-largest file (src/commands/schema.ts at 219). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6744aa441bb530c8f22f11b26dd43c8fe80eb0ee3dd0ee8186ac34f667fcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"searchable-multi-select.createSearchableMultiSelect (cognitive 77): searchable-multi-select.createSearchableMultiSelect has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 12 (36 pts), if/else 22 (31 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 34). None of this is in the body itself: all 77 points belong to 4 function literals inside it that branch (lines 54, 87, 68, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prompts/searchable-multi-select.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c524efa268342641a31c92b175283c0d2f72355a5bebeca9f830c102cdeb0d99"}},{"ruleId":"D2","level":"warning","message":{"text":"InitCommand.generateSkillsAndCommands (cognitive 72): InitCommand.generateSkillsAndCommands has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 9 (18 pts), boolean chains 7, error handling 3 (5 pts), ternaries 2 (3 pts) (nesting depth added 34). Of this number, 70 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bfbce4cc06f256bcec21f77deed713c6bb7126d87b874d370ff9c8081b7720"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.schemaValidateCommand (cognitive 65): schema.schemaValidateCommand has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 5 (15 pts), boolean chains 4, ternaries 1 (4 pts), error handling 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed08c37ae89d3f403abfe64083f28acb5383adafa4ebd3b6bb63f26e3622d67"}},{"ruleId":"D2","level":"warning","message":{"text":"InitCommand.displaySuccessMessage (cognitive 63): InitCommand.displaySuccessMessage has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (33 pts), ternaries 7 (14 pts), loops 6 (9 pts), boolean chains 7 (nesting depth added 16). Of this number, 46 points are the body\u0027s own statements and 17 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ebfb96894c455737af02df84ca9587e878e3568f854253c6ecc3d27a7a6b9"}},{"ruleId":"D2","level":"warning","message":{"text":"shared-skill-install.installSharedSkills (cognitive 59): shared-skill-install.installSharedSkills has cognitive complexity 59 (threshold 15). Drivers by points: if/else 38 (78 pts), boolean chains 17, error handling 4 (7 pts), loops 6, ternaries 3 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (shared-skill-install.installSharedSkills::settleOwnSkillsFolder) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9625efe8e143fadf1aac5e10e2015ba3517bb88aea35bb2b0777161ae2662b69"}},{"ruleId":"D2","level":"warning","message":{"text":"project-config.readProjectConfig (cognitive 58): project-config.readProjectConfig has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (48 pts), boolean chains 3, loops 1 (3 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a325b3ab029ce7c71fc71ef1ff37b2c26ca5f80154136ba98c38f51f46a6cad2"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.listSchemasWithInfo (cognitive 56): resolver.listSchemasWithInfo has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (28 pts), error handling 3 (16 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"01da86a526b65d57c1b0c106263d5a98c27cd9430063ea24034d294fe1e684f6"}},{"ruleId":"D2","level":"warning","message":{"text":"migration.scanInstalledWorkflowArtifacts (cognitive 55): migration.scanInstalledWorkflowArtifacts has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 6 (15 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"73759e40c15819eeab3f2ac39b7e2bcb07f6e6dc9a0377a8e62992abebdfdf38"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-sync-drift.hasToolProfileOrDeliveryDrift (cognitive 52): profile-sync-drift.hasToolProfileOrDeliveryDrift has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 10, loops 4 (5 pts), error handling 1 (3 pts), ternaries 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profile-sync-drift.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c996ee4f5a3dd9808a1b72f7b1d59e67d9c49bb3ea4c386ff56627478a98e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateCommand.runBulkValidation (cognitive 52): ValidateCommand.runBulkValidation has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (23 pts), ternaries 8 (17 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 19). Of this number, 38 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f441a8c970e64d12d6657ae37eb4fa88cc9d6a8b5e00904246ddb0ccacc3ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.schemaWhichCommand (cognitive 51): schema.schemaWhichCommand has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (15 pts), ternaries 2 (10 pts), error handling 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"266b683e067cf9004a149bd2b41778532103aacebc398b40e1a758ad3f442187"}},{"ruleId":"D2","level":"warning","message":{"text":"status.statusCommand (cognitive 50): status.statusCommand has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (36 pts), error handling 2 (5 pts), ternaries 4, loops 1 (3 pts), boolean chains 2 (nesting depth added 24). Of this number, 43 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d2f7e2da8188a50be5230f791ebf9ebee038be924825db2ff9e71ca8d66847"}},{"ruleId":"D2","level":"warning","message":{"text":"shared-skill-install.installSharedSkills::settleOwnSkillsFolder (cognitive 49): shared-skill-install.installSharedSkills::settleOwnSkillsFolder has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (shared-skill-install.installSharedSkills) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b1a8d7ac2856938ec71473a696919e480dce3270657e3331e3bd0f68ca3cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.schemaForkCommand (cognitive 49): schema.schemaForkCommand has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (32 pts), error handling 6 (10 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"7553bbb27653a8718c45f2bc8e5ee490d8b131ccdd6cd98ec30d5405cf2e7398"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateCommand.execute (cognitive 48): ValidateCommand.execute has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 13 (19 pts), boolean chains 8 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcd4687fe440eccb6054107a2b49811549d1fadd014c9940145cbb09eeae24f"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.upgradeLegacyTools (cognitive 45): UpdateCommand.upgradeLegacyTools has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 4 (8 pts), boolean chains 6, ternaries 3 (6 pts), error handling 1 (2 pts) (nesting depth added 17). Of this number, 42 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8c2aedd2afdd3d25411dc5726a617ce3fe20cd6c4c97acb0eef79262195414"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-cleanup.cleanupLegacyArtifacts (cognitive 44): legacy-cleanup.cleanupLegacyArtifacts has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (24 pts), error handling 6 (13 pts), loops 6 (7 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd497fc529feb62b646ac4e337827873dadbd6fb16c78ff36b36bcd398ff5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"instructions.generateApplyInstructions (cognitive 43): instructions.generateApplyInstructions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 8 (15 pts), boolean chains 6, loops 3 (4 pts), error handling 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0df5a7451f44caf656d3d552ab5670f51141868e1258b7958b384a880a239a"}},{"ruleId":"D2","level":"warning","message":{"text":"InitCommand.execute (cognitive 37): InitCommand.execute has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), error handling 2 (4 pts), ternaries 4, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c280d8a5f32c12170870e05b84a0dc776349e34aeb05264dc1e6bdfd8aefc8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCommand.printDiffText (cognitive 37): ChangeCommand.printDiffText has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (15 pts), match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"201cb5067c5ff81d3a41d4f9862d0b708f0f71fe228be905718f5dbad94c21bd"}},{"ruleId":"D2","level":"warning","message":{"text":"shared-skill-install.ownSkillFolderNeedsWork (cognitive 36): shared-skill-install.ownSkillFolderNeedsWork has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 10, error handling 2 (5 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bf98a6fe579870d7656875aa19096aa2e1f2cbcbcfb02067f3f16e29b57a82"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.listSchemas (cognitive 35): resolver.listSchemas has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (7 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5519cf93701b7c9279fa14e582246188d18b6ca6ca0b7086b800e328df2b562"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateCommand.runArchivedTaskValidation (cognitive 35): ValidateCommand.runArchivedTaskValidation has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (12 pts), loops 4 (7 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87c47b769da1e74fa9cb4cc52ef302967c82119c086734920d6968af071241a"}},{"ruleId":"D2","level":"warning","message":{"text":"migration.collectLegacyToolMigrations (cognitive 34): migration.collectLegacyToolMigrations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"466104755adc2b29f9a6412078bbf6471fa8f4403c8bf21e5e7fd6653745ffd4"}},{"ruleId":"D2","level":"warning","message":{"text":"references.assembleReferenceIndex (cognitive 34): references.assembleReferenceIndex has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), error handling 2 (4 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"071a581507b79f706bd306540ef001ccc6fe2a089df97f5e2db81c1dc9d55577"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionCommand.installForShell (cognitive 34): CompletionCommand.installForShell has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 7, loops 2 (6 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/completion.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25a6012f2782d080edaaf72c410840ff118d5da0dd955e12006d37d2859fa66"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.inspectStore (cognitive 33): operations.inspectStore has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 1 (4 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad8ec79de792686604a7d7c0f41130dd951dc1cbef8832daa72636d808c809"}},{"ruleId":"D2","level":"warning","message":{"text":"config.splitEditorCommand (cognitive 32): config.splitEditorCommand has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca02139584f4c15e58168d9debff26b5e32af1ddc915b5b0ec2c355272cb35c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorksetCommand.open (cognitive 32): WorksetCommand.open has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 2 (4 pts), boolean chains 2, 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":"src/commands/workset.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a52737693f70288bbbd6b0442960b67bc7dee6256fc3f4db36befd54dafae8b"}},{"ruleId":"D2","level":"warning","message":{"text":"file-steps.parseSteps (cognitive 30): file-steps.parseSteps has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 5 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/components/file-steps.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"245194c8e72a66c12fee6e4c82d2e130aabb9ccee6945c9126140072dd74c2bb"}},{"ruleId":"D2","level":"warning","message":{"text":"context.printHumanWorkingSet (cognitive 29): context.printHumanWorkingSet has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (9 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/context.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dfa2e2ed3c0f51cbf34a91f1466d85703ed8eccae1f27ab98c771a4a2fc65e"}},{"ruleId":"D2","level":"warning","message":{"text":"InitCommand.getSelectedTools (cognitive 29): InitCommand.getSelectedTools has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 12, if/else 11 (12 pts), ternaries 3 (5 pts) (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecab40a37ebd89fb69c82c2fbe5faf51e2610461f1eea56f5a2857a53ddf767"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.removeEarlierReleaseLeftovers (cognitive 28): UpdateCommand.removeEarlierReleaseLeftovers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8c05d65b5746917d36ea91c53a74376d3db793540545a4c1a5ab6c76f1f47"}},{"ruleId":"D2","level":"warning","message":{"text":"instructions.printApplyInstructionsText (cognitive 28): instructions.printApplyInstructionsText has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (9 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95b6eef30a3e2e3a2e8158c2528718a0d42f3bbe11277671c700288f7be4dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"version-check.comparePrerelease (cognitive 28): version-check.comparePrerelease has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 3 (10 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/version-check.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b72c2ee6c4524f5f3fdc79199ed25ff98f1d57c3b9a85d7a366f1ac12cedc0"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs.assertBraceNesting (cognitive 27): outputs.assertBraceNesting has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"814325b8ea86e7b73889aec6ad3149bebaf6858d0cfc69b45c1b95be86c34318"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.setupPreparedStore (cognitive 27): operations.setupPreparedStore has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 6 (7 pts), boolean chains 5, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb1d5e55101f0ff77b7c5f52172d614c5ca7b1ac1410b4acf31438e7d175f43"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCommand.show (cognitive 27): ChangeCommand.show has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e98aff179b3d2b6a3bb627d39fbc7183b862c0c2c116cbb1013b2858b9da24"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCommand.validate (cognitive 27): ChangeCommand.validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 2 (5 pts), boolean chains 2, error handling 1 (nesting depth added 10). Of this number, 22 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"200223918792a3ef82dcb28a79b12d695340602080942ad826b0a4e5deda592d"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.handleLegacyCleanup (cognitive 26): UpdateCommand.handleLegacyCleanup has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"612266201f25b0ca758623de1942d0018aa6203f549c8a36554e3f0bb9187fae"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCommand.collectSpecDiffs (cognitive 26): ChangeCommand.collectSpecDiffs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (9 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfa3ab1a1ee35c7c641f2ec8e79327c9f25887b8cd4ea97a5c9b0ffd79791ff"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-cleanup.detectLegacySlashCommands (cognitive 25): legacy-cleanup.detectLegacySlashCommands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f357628d0b244a99de3bdf855caaca606555e8c5c5e522f0c46ef6377e1bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"released-output-sweep.findStaleReleasedFiles (cognitive 25): released-output-sweep.findStaleReleasedFiles has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 20 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/released-output-sweep.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"be07c6bf2eea431acdeba025b9837c119282a9de3d97dba41fa556f69a8362fa"}},{"ruleId":"D2","level":"warning","message":{"text":"project-config.parseDeclarationList (cognitive 25): project-config.parseDeclarationList has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9078c10cc7c3a476070696669a654593b958af104c16ea2d475230fac6eac71a"}},{"ruleId":"D2","level":"warning","message":{"text":"tool-detection.getToolVersionStatus (cognitive 24): tool-detection.getToolVersionStatus has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (10 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/tool-detection.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70c2d13b9fcef66885b83ed434ec143d2818f1c8e6161c0a6d75c63b1a125fc"}},{"ruleId":"D2","level":"warning","message":{"text":"command-reconcile.classifyCommandFiles (cognitive 23): command-reconcile.classifyCommandFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (6 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/command-reconcile.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9d9b79ef66a4d931af847d79465f76d438b398b7b9ac19f292d4672b11ca76"}},{"ruleId":"D2","level":"warning","message":{"text":"migration.migrateCommandFiles (cognitive 23): migration.migrateCommandFiles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf6d0a5792266af8f57b4661ebc68a6f00fd89004d49575f168e3f41c41a9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"task-checkboxes.findFirstListItemLine (cognitive 23): task-checkboxes.findFirstListItemLine has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/task-checkboxes.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0268a839d82e594987719b697dd8071ca83a915a8ccfa8a5b7adae149d3aa8d"}},{"ruleId":"D2","level":"warning","message":{"text":"workset-prompts.composeInteractively (cognitive 23): workset-prompts.composeInteractively has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset-prompts.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"605b5a83d6a4369dfa87c459d2aea6e54d1d87938a8c858f01b187d7055ab659"}},{"ruleId":"D2","level":"warning","message":{"text":"instructions.printInstructionsText (cognitive 23): instructions.printInstructionsText has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f2876e012c9d1b246b73564ae49d1c9993a995f984242921635d05c08ff846"}},{"ruleId":"D2","level":"warning","message":{"text":"PowerShellInstaller.configureProfile (cognitive 23): PowerShellInstaller.configureProfile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 3 (6 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc50eb1ee56df27a0ae83ad54eab2155f32c39051cbbe111d2b6a6446fe941dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewCommand.getChangesData (cognitive 23): ViewCommand.getChangesData has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), error handling 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7e9bf6f2733b2192bd5c2eae9175485ebfafe1ae4d0156187f3d2b4e2b9de"}},{"ruleId":"D2","level":"warning","message":{"text":"requirement-blocks.findUnappliedContent (cognitive 22): requirement-blocks.findUnappliedContent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"833f2d54f8404f7bc8f6976092df7593267dd17c0112fde664c64f46f5051017"}},{"ruleId":"D2","level":"warning","message":{"text":"change-metadata.readBooleanMarker (cognitive 22): change-metadata.readBooleanMarker has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 5 (8 pts), error handling 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-metadata.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c987563d8fd1555add83138d78667ebcc8bb7dca08c0b704642d12283619bc86"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.registerExistingStore (cognitive 22): operations.registerExistingStore has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 6, if/else 6 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"848888134440a7e6457d2f3e0da6b89bc48ffff0e9c08fdbbf9538d3097e0007"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidateCommand.printReport (cognitive 22): ValidateCommand.printReport has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc950df355f7afa9f6ef1906febe5b38981a4cfa3528f44827be3c1c28b5f24"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-cleanup.formatCleanupSummary (cognitive 21): legacy-cleanup.formatCleanupSummary has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82bc5dcf3f56830ed5710a3d16c0d52e9a558765710891b10f8a50d724f6d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"retired-tools.cleanUpRetiredTools (cognitive 21): retired-tools.cleanUpRetiredTools has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retired-tools.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4561dd683f3fcf01c0b875f0af1179fd9809c27c534a000d44da78a22673f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.prepareSetupPlan (cognitive 21): operations.prepareSetupPlan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae19b3f692d7a4b0612d998a3e3193bd30e30f097a2964386a2efdde3d20ecb6"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.captureSpecSnapshots (cognitive 21): archive.captureSpecSnapshots has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 5 (8 pts), error handling 2 (4 pts) (nesting depth added 10). None of this is in the body itself: all 21 points belong to one function literal inside it that branches (line 1079). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/core/archive.ts holds 5 of the 109 methods over the threshold \u2014 including the worst \u2014 and 605 of the 2355 points over it (26%), 2.8\u00D7 the next-largest file (src/commands/schema.ts at 219). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"343e719d8f43678b6e0edbf5a370b32b62df14c4ed053fec272f08166a8cedca"}},{"ruleId":"D2","level":"warning","message":{"text":"executable-path.findCopiesOnPath (cognitive 21): executable-path.findCopiesOnPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 2 (4 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/executable-path.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9891adf6abbc6185fa1388f4c15e9a9fdaf21eeb500ed6819adfc7ff4950d5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ZshInstaller.uninstall (cognitive 21): ZshInstaller.uninstall has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), ternaries 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"590842cdbb99974e5dd82e0f5d164800efc671c9f3127f31a458c1d043207914"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCommand.list (cognitive 21): ChangeCommand.list has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (5 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). 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":"src/commands/change.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dc5c1c7da0974a9d127d29b6d8d1aa6dffca55dc12c6cfdfe2877cbc2ea0fc"}},{"ruleId":"D2","level":"warning","message":{"text":"migration.migrateSkillDirs (cognitive 20): migration.migrateSkillDirs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a791b9465d17193d31ab340563a1b8042f577526be831934754c4be6569ff865"}},{"ruleId":"D2","level":"warning","message":{"text":"project-config.parseOperations (cognitive 20): project-config.parseOperations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaef11c44d92ba8d01e57bb53e2cb20792611eb0197ba75192a4c1f48f7d024c"}},{"ruleId":"D2","level":"warning","message":{"text":"config.configProfileCommand (cognitive 20): config.configProfileCommand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 2 (4 pts), boolean chains 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":"src/commands/config.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2b9dfa925e194dad1e3347520daeafb8d97cddd6b14f8ffc30117359ac7d28"}},{"ruleId":"D2","level":"warning","message":{"text":"requirement-blocks.extractRequirementsSection (cognitive 20): requirement-blocks.extractRequirementsSection has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), loops 4 (5 pts), ternaries 3 (4 pts) (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b438da5ca0ae9dce1ba16850c7046c355256760f65e96093ef552e809b98909a"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.gatherHealth (cognitive 20): doctor.gatherHealth has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/doctor.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3233382842f3e6ef945d9a795ef06cc90112e666f8d9de5c108ddd37ce9dc1ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystemUtils.canonicalizePotentialPath (cognitive 19): FileSystemUtils.canonicalizePotentialPath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), error handling 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/file-system.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead7cafcb3165821b9a076e50d47b97ce3c978dc99a5a1fadf7b9d2fe5c18e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.removeUnselectedSkillDirs (cognitive 19): UpdateCommand.removeUnselectedSkillDirs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ce1d423a5cd111ef0946aa8a4a1a57a5a8afe79fce8f6e607606fd88acb83b"}},{"ruleId":"D2","level":"warning","message":{"text":"root-selection.resolveNearestOrDeclaredRoot (cognitive 19): root-selection.resolveNearestOrDeclaredRoot has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 5 (7 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/root-selection.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a978043d4286a78eba29c8681248cc0ac4b861983527902e834ee225d00726"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs.assertGlobDirectoryTraversal (cognitive 19): outputs.assertGlobDirectoryTraversal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (5 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab85def2ca19899bd2f4abd5cac01557ea5368e55a53b6091af170a3f61af3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"instruction-loader.generateInstructions (cognitive 19): instruction-loader.generateInstructions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 5, boolean chains 4, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/instruction-loader.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec71b7cd34a7987d53aef9a8e21231529706ab5240edf595b7b99380b7ff12a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ZshInstaller.install (cognitive 19): ZshInstaller.install has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (8 pts), error handling 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"285beda48ebd03e137337719aa4e85c294ac772d7ad47b864512a6cde4c12818"}},{"ruleId":"D2","level":"warning","message":{"text":"preview.resolveStaticFile (cognitive 19): preview.resolveStaticFile has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, error handling 3 (4 pts), ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/scripts/preview.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9275ac42c5b64f6606267a9990b1d2aacaa487b3b2d63db92d054386fb129598"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-cleanup.detectLegacyGlobalPromptFiles (cognitive 18): legacy-cleanup.detectLegacyGlobalPromptFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d51f7770e15994a69d833fc053a69ec351909b66c1d34315ff3611feed14e9"}},{"ruleId":"D2","level":"warning","message":{"text":"released-output-sweep.toolSpecificPathsForTool (cognitive 18): released-output-sweep.toolSpecificPathsForTool has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/released-output-sweep.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc5eb8ba44124264d1656f4b364b14af623fa288f048c34b0cdeb484542d9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.offerConsentedLegacyMigrations (cognitive 18): UpdateCommand.offerConsentedLegacyMigrations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c5e68665940eb14d1a779e04ef278557f9247070d2de4273945032afa077b7"}},{"ruleId":"D2","level":"warning","message":{"text":"requirement-blocks.parseRequirementBlocksFromSection (cognitive 18): requirement-blocks.parseRequirementBlocksFromSection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b22d85ebb287285b0418f562de5e808ccc85e969035350101323ef6f4549be"}},{"ruleId":"D2","level":"warning","message":{"text":"relationship-health.inspectRelationships (cognitive 18): relationship-health.inspectRelationships has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/relationship-health.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd0a8ecaa8449f41212b3d3a155690ef3b0f174226a602c0e2b029fe59d28ce"}},{"ruleId":"D2","level":"warning","message":{"text":"outputs.findTopLevelExpansion (cognitive 18): outputs.findTopLevelExpansion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"768300e0daf9957f142c6ac2e4b76c45aa069b8e237e7bdec68ba7d5c383b45b"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.fingerprintDirectoryContents (cognitive 18): archive.fingerprintDirectoryContents has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function items inside it that branch (visit, a function literal at line 427, updateHashField). 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 cognitive complexity CONCENTRATES: src/core/archive.ts holds 5 of the 109 methods over the threshold \u2014 including the worst \u2014 and 605 of the 2355 points over it (26%), 2.8\u00D7 the next-largest file (src/commands/schema.ts at 219). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1af97404548ec9e3a3a910219c519b3ae300ee521bec56f7eb6710b63a13bda"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeCommand.enrichDeltasWithDiffs (cognitive 18): ChangeCommand.enrichDeltasWithDiffs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0e6ccfc6684e417acacdc93f8be1676cb592decf8f2045ee1eb3015f027ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"file-steps.FileSteps (cognitive 18): file-steps.FileSteps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, ternaries 6 (7 pts), boolean chains 3 (nesting depth added 1). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 5 function items inside it that branch (onKeyDown, a function literal at line 164, a function literal at line 97, \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":"website/components/file-steps.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d33eda7c1b9b103bf13928c8ccfe344ee2a1ddda8e13baf807acb4d1a1f255"}},{"ruleId":"D2","level":"warning","message":{"text":"file-state.acquireFileLock (cognitive 17): file-state.acquireFileLock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/file-state.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa61d3654a2c11a194878fccd89ddb13a19a5f47df1e8c4bb48104ee9c65ab"}},{"ruleId":"D2","level":"warning","message":{"text":"references.extractFirstPurposeLine (cognitive 17): references.extractFirstPurposeLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0c870d2b0b04cba152e20f39c73b4cedc4ebd0ba957697497306f6b3bc1623"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validateNoCycles (cognitive 17): schema.validateNoCycles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts) (nesting depth added 8). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (dfs). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/schema.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a351f683c13bb9d95a9686010c86e81fcf80854ab5be13002af33a32bd831a07"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validateSchema (cognitive 17): schema.validateSchema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 3 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b222663cf1b5317c869597d129a0ba524067c282caab4a20c292589fb57fdc61"}},{"ruleId":"D2","level":"warning","message":{"text":"task-numbering.findTaskNumberingIssues (cognitive 17): task-numbering.findTaskNumberingIssues has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 40). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/task-numbering.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52d675ab45fd8d87d86b801e3e141086b1044e9dd47be9f3550c14b04604184"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.copyThenRemoveDirectory (cognitive 17): archive.copyThenRemoveDirectory has cognitive complexity 17 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/core/archive.ts holds 5 of the 109 methods over the threshold \u2014 including the worst \u2014 and 605 of the 2355 points over it (26%), 2.8\u00D7 the next-largest file (src/commands/schema.ts at 219). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f03286a0237def4daa4fb5eb1bbcb4419b4bb67e59c6b3450b9d2d5aec8323"}},{"ruleId":"D2","level":"warning","message":{"text":"change-utils.validateChangeName (cognitive 17): change-utils.validateChangeName has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-utils.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e15522cd844d2445a86458e44955123ac7a9c688153210c540a9b346d3c3f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"list.getLastModified::walk (cognitive 17): list.getLastModified::walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf306a47d054ea325be6e8391dd56330811702a400a0ce39eed6c11a47a9ce2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ShowCommand.showDirect (cognitive 17): ShowCommand.showDirect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/show.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0031953121f6c4d92789f9cce646f1950dc40d09e4c337c855e99f9ac14cb83"}},{"ruleId":"D2","level":"warning","message":{"text":"index.program.command(\u0022update [path]\u0022).description(\u0022Update OpenSpec instruction files\u0022).option(\u0022--force\u0022,\u0022Force update even wh (cognitive 17): index.program.command(\u0022update [path]\u0022).description(\u0022Update OpenSpec instruction files\u0022).option(\u0022--force\u0022,\u0022Force update even wh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cfc32572359c5c7e0c9d4390e9a98357ac75d37841767a9a7679a893d9f79c"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-links.classifySkillLinkSpot (cognitive 16): skill-links.classifySkillLinkSpot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 3 (5 pts), boolean chains 2, error handling 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/skill-links.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bc602004390588cca1ba424f4198d141e2f86f344612200343c5657323aaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy-cleanup.findEditedLegacyGlobalPrompts (cognitive 16): legacy-cleanup.findEditedLegacyGlobalPrompts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa690616a3e8318e09317e4244cef2991f8e19a5d2ec7271995cc24f085aecd0"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCommand.syncCopilotCloudFiles (cognitive 16): UpdateCommand.syncCopilotCloudFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2a5c78a06ff9e446c184681e58d9701fd36d6bd65f09e2c243e41d0239e3d6"}},{"ruleId":"D2","level":"warning","message":{"text":"config.configListCommand (cognitive 16): config.configListCommand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bd82029244a442e07924f99311f9518e23814bd8a5abd4380eebaa4d806a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"references.renderEntryLines (cognitive 16): references.renderEntryLines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"358601780799e93f9aa78cdfca8f0fea2b7efd28b2058bb22480ffb98230935e"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.findScenarioLossIssues (cognitive 16): Validator.findScenarioLossIssues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3, boolean chains 2, error handling 1 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e59dc2d516088342ba3de76f3f7cf8c69151e154ccedf6c865ac64671a30ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"status.printStatusText (cognitive 16): status.printStatusText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88c238dcf47235d64c28b500a73da36a614c6c8aecdd70dbb8f9499ee95fd25"}},{"ruleId":"D2","level":"warning","message":{"text":"version-check.httpsGet (cognitive 16): version-check.httpsGet has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 4 function literals inside it that branch (lines 232, 211, 228, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/version-check.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a4fbd0cbecd66297963f9b25d5054b42f1a00ef8cfc8d606987426f2a428d0"}},{"ruleId":"D2","level":"warning","message":{"text":"install-standalone.installStandalone (cognitive 16): install-standalone.installStandalone has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (7 pts), if/else 6, boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/install-standalone.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36990cede5165137526079818c76cdcfc53539643a050e5b65dcb7cdcc08d91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArchiveCommand.run: MethodTooLong \u2014 run runs 615 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 515 over it, 6.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d44987a8d7ff7a8f2bec74cddcc6fa7b42ea31fe01ef23944e7ea8b95ced97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/archive.ts: FileTooLong \u2014 1487 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 987 over it, 2.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397d5bc4efb2fe91f386a3a7d864890c17f99a68c83e1bfd9bbea7d9981ba33d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateCommand.execute: MethodTooLong \u2014 execute runs 275 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a473911e62ec7fea74afe49aefcc65c79aa12f8a58a9a070410e0b4f15bdf3f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UpdateCommand: ClassTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 502 over it, 2.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9983e563aed63c94affbffa9e14ad166299d51c2c5ec2c89ade5b70c58697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/update.ts: FileTooLong \u2014 1011 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: UpdateCommand (159-1710). The bar is 500 significant lines; this is 511 over it, 2.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d7c15e38d95c72e4b457d4881d69f168c6cf828a17cf1d1d44bccadb26b878"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/schema.ts: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd68207de8fcd48eb7586aeaecb3d8293aad25cc018dcf0632b5c40d42e2516e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InitCommand: ClassTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 336 over it, 1.84\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893eb66e5b4384d5c4763b50c51bb14fc683418b24e339c670ee46e12c5b532"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArchiveCommand: ClassTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 288 over it, 1.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"453a46fdf54d54dd4c97ee84ce0bcbb818abcb2daf5266cb081a34ae651ce693"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/init.ts: FileTooLong \u2014 852 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: InitCommand (159-1452). The bar is 500 significant lines; this is 352 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3b03a4d6cf44247898a5981ff74d82aacd1a4f49400abd66af881c334bd629"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/operations.ts: FileTooLong \u2014 830 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 330 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e343843b15eed51aba0d8e529dcae275ff2b98186b839263d09053d4cd4fff5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shared-skill-install.installSharedSkills: FunctionTooLong \u2014 installSharedSkills runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fd06db0302deec3bc7aa1d129a5429ca678d6002ff1e6f8c1c85e3eaca3363"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Validator: ClassTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 203 over it, 1.51\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff559f04d55f5e7a91eff6ecf79c5a16290d197648283de23eb3705bcc641a2d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InitCommand.generateSkillsAndCommands: MethodTooLong \u2014 generateSkillsAndCommands runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ee5140d64bdaf0b8eed4f0b9d4b967d8a94dd5caf2950f8bcc10a1c8dc6630"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/legacy-cleanup.ts: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"537c503c630d5e91f59947e47a5a0915535cfac2100b537148e0ed84b53bd6e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schema.schemaForkCommand: FunctionTooLong \u2014 schemaForkCommand runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe13dc3f114a61ae50b1e3c9d99d00ab772b3e6adea2a75475e573e48dc4bd27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: searchable-multi-select.createSearchableMultiSelect: FunctionTooLong \u2014 createSearchableMultiSelect runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prompts/searchable-multi-select.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cde0f64edfded83af10090270a54b16c344cea8872271a131dc26d199aea44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: validation/validator.ts: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: Validator (52-1165). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aba59a7e5de94c82391d3734c2ba5e2f334aea58ba2dfd6d87eb44960abf80f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListCommand.execute: MethodTooLong \u2014 execute runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a885ec9a45c47ee0a4f8f452d209f5aa4d63a81e39ad1dbbfdcf5bcc3671d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/index.ts: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e80d3928e06c970aa1bb4b654a0d943275a6d56c8ad65257c4ec404bea9e6db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workflow/instructions.ts: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebb9b819cfe5eb7663cd44a1eeb960071572a9bcdf51bc6c6488909cdeb43bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateCommand.upgradeLegacyTools: MethodTooLong \u2014 upgradeLegacyTools runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"774ed4f211ce164c49e6ff87bbd0ac409f8fbe7696a449cfb17fdd76121c5fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: file-steps.FileSteps: FunctionTooLong \u2014 FileSteps runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/components/file-steps.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e074c347395508a86c18dc6501fa519ce0358ea25627dfb056f5a1ad52d2e8ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ValidateCommand: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 32 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"736fc4a1ce7baf3130a3f4b083255c9e8fdb3a047fc16df8829811fcc822c1a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: config.configProfileCommand: FunctionTooLong \u2014 configProfileCommand runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedbf2046a56bca95f9683a8d65986d20974e2edfe1d490b0502b3f2f0843e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operations.inspectStore: FunctionTooLong \u2014 inspectStore runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26fdc20d0f2063bebb48908cad8310040f2b11582e6f15215d8850f05ef5544"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/validate.ts: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: ValidateCommand (82-738). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f2229761903f6f34dbb875db19b3f3f559282e805f558a3036e838703f0bac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: instructions.printInstructionsText: FunctionTooLong \u2014 printInstructionsText runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b9ebf4263de0324d1be58caf20534cc127284b310634514e7a43f141cf407b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorksetCommand.open: MethodTooLong \u2014 open runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1a10e1eace9fb51494185dabb399ddd7bf563f4c2b6507289e0a156319ef98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: store.registerStoreCommand: FunctionTooLong \u2014 registerStoreCommand 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":"src/cli/commands/store.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5729691c4e2ea9d23b3303eca6b22387e538745c0046b46d5daea89e221874db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ValidateCommand.runBulkValidation: MethodTooLong \u2014 runBulkValidation 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":"src/commands/validate.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d5a8fe0575aa003fd5a1807fde466837ea770410ac405251b7991c8b197bc"}},{"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: should preserve source order and lineage when renaming requirements: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/archive.test.ts"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7238de74b919f416b0ffab1f82487fe8af821f585662adec5a1d18f78c213d"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-darwin-arm64: \u0060@img/sharp-libvips-darwin-arm64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb9cac83efbb8fb5b1b1714cd7ce06ef46586b0cb953bfde13d5cef10838aa9"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-darwin-x64: \u0060@img/sharp-libvips-darwin-x64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de28cedeef63f197969d04616e27ba4aeb27e4375cfebf400bfd8540537a9c"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-arm: \u0060@img/sharp-libvips-linux-arm\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed930a6d1b3ac4b890509506dec0a58727b515b0b43327cc1a4b4298e79514d8"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-arm64: \u0060@img/sharp-libvips-linux-arm64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b9a31ae3b29118432d1284fc0c855fbfbf2bc26303258aa349bed6999fa27"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-ppc64: \u0060@img/sharp-libvips-linux-ppc64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20c11a65955bafb54a0fe488a53c597a9857c6aea42950b92968a57c6553f1"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-riscv64: \u0060@img/sharp-libvips-linux-riscv64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fa7dd2c5433945143e886736f323d34568a1815de5755ea55f247d83db2255"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-s390x: \u0060@img/sharp-libvips-linux-s390x\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3d0fc4342775e0cda07639d86e20b7ecd506920fa0b1a66c6f1ebfb1f8c2ab"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-x64: \u0060@img/sharp-libvips-linux-x64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740d28a1384feb307d2f24d03cf2e2e13a5d6eda920a4040480f40df2e9d50b"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linuxmusl-arm64: \u0060@img/sharp-libvips-linuxmusl-arm64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ce0111811bc0c564efe3bc5758a9fe2ff77adefe8940d96c0e94f001dc6bb6"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linuxmusl-x64: \u0060@img/sharp-libvips-linuxmusl-x64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91fe0a042e1c39cd9d87efaed4be891aa907345e587e25c7d6b01efdaaffd89"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-wasm32: \u0060@img/sharp-wasm32\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later AND MIT\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1135ffbb448d71e8cb7f5d4d9fb10acf52d978f9eb537a0cd1f2166ada470428"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-win32-arm64: \u0060@img/sharp-win32-arm64\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7501b1efe547a916924b31662388631addbf15548a0d166cc082f57b0eb7a93d"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-win32-ia32: \u0060@img/sharp-win32-ia32\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7e073ff938556e3b1cdba3c54fe725620ac7ffe9e735802eeadb3dcc853d57"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-win32-x64: \u0060@img/sharp-win32-x64\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/pnpm-lock.yaml"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"376605ff2c96456f54476e6225693261afc28ecb15a09757b469cf8cfd84bf3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/archive.ts: src/core/archive.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 169 in ArchiveCommand.run at line 1351. 8 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/archive.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1b16f2aa4075f3ceb394b524b7e073c4a65b86ce2206558afcb2230255a8c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/specs-apply.ts: src/core/specs-apply.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in specs-apply.buildUpdatedSpec at line 168. 15 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/specs-apply.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b163b0f70e05513bc94e3b9e6271a02449352fdd33ab0f4d3b01a741aa23930a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/validation/validator.ts: src/core/validation/validator.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in Validator.validateChangeDeltaSpecs at line 175. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/validation/validator.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"218704a8174eb60ef654f9d13b6eaea3b57222df36454871c6cda589473f4092"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/update.ts: src/core/update.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in UpdateCommand.execute at line 213. 7 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/update.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03078b7bd36b189eb34ebb9d42556ce71737c1d98905a01c62b88bf3c223647"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/init.ts: src/core/init.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in InitCommand.displaySuccessMessage at line 1224. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/init.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4bd43338d129c80e21c296346428a0898579232056ab2c36dd983fae4b3963"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/schema.ts: src/commands/schema.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in schema.schemaInitCommand at line 1002. 3 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/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":"src/commands/schema.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"55060bd1193f97e73a5654e51f60f75fcd006925e822d80361fcc9db4e0a7751"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/workflow/instructions.ts: src/commands/workflow/instructions.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in instructions.generateApplyInstructions at line 537. 8 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/workflow/instructions.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6e09fb1551f4f233900dd530f3f23f1791a731645dcdecbfae669f7beede58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/legacy-cleanup.ts: src/core/legacy-cleanup.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in legacy-cleanup.cleanupLegacyArtifacts at line 779. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/legacy-cleanup.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e70630e17d765d759fc5961c0356a746373ee12db430a5f9213b1ba69fec3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/validate.ts: src/commands/validate.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ValidateCommand.execute at line 83. 4 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/validate.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d13889e2e7271c3047bfc0a5ac543322282124115c2cffc8f24b8abfb076c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/parsers/requirement-blocks.ts: src/core/parsers/requirement-blocks.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in requirement-blocks.findUnappliedContent at line 386. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/parsers/requirement-blocks.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdeac29d07436ac75d4d0c7c5ccd113e42c10947d781c0e984ae41e9ba89c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/workflow/status.ts: src/commands/workflow/status.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in status.statusCommand at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/workflow/status.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6af939ad3ef767833168dfb14d3d23376e2ce312863da643f9f617376b86879"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/shared/tool-detection.ts: src/core/shared/tool-detection.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in tool-detection.getToolVersionStatus at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/shared/tool-detection.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/tool-detection.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5286402c877e333cc3850df9f5128d8c4dd824ca42ebd67fafb29114492a32e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/list.ts: src/core/list.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ListCommand.execute at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/list.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71141cd1631a6f71e14eca47e5f057bc06c98a642bd4990fa8132e7f4372304"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/config.ts: src/commands/config.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in config.configProfileCommand at line 560. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce7bebd0ca77e80e983b260aa328982865792dd25e7b75d947873e49438dff4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/migration.ts: src/core/migration.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in migration.scanInstalledWorkflowArtifacts at line 519. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/migration.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5eb38e56f0007bee10cc5022252200e9e83c000db8ef1a8ead2f74e2f6b254"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/profile-sync-drift.ts: src/core/profile-sync-drift.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in profile-sync-drift.hasToolProfileOrDeliveryDrift at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/profile-sync-drift.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profile-sync-drift.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"225e69071b039f0610bd3b6a4ec10a94d8b46d1df2e52edcf424473b01c6affd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/available-tools.ts: src/core/available-tools.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in available-tools.getAvailableTools at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/available-tools.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/available-tools.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3c2de6d02844e716af4db684730bcc40b74e0c01872e1bce7d9d73d565c2af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/commands/completion.ts: src/commands/completion.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CompletionCommand.installForShell at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/completion.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/completion.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc1eb9682a13e97aa9ff84a9c377697c537b33a841a89d9de934d35bd415193"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/commands/workflow/shared.ts: src/commands/workflow/shared.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 8 (its worst body is shared.validateChangeLookupName at line 180), 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(apply): include task source locations (#1994)\u201D; \u201Cfix(verify): do not report unverified dimensions as passing (#1732)\u201D; \u201Cfix(changes): report a change nested in a namespace folder (#1849)\u201D; \u201Cfix(apply): warn when a change is ready to implement with no specs (#1783)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/commands/workflow/shared.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/shared.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b660c1b1c0c3d525ec70871c765e15aff9c0524bdcdd08eda81c6db0ffd16e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/utils/file-system.ts: src/utils/file-system.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 12 (its worst body is file-system.removeMarkerBlock at line 465), 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(security): replace fast-glob with tinyglobby to drop braces (#2103)\u201D; \u201Cfix(archive): allow symlinked openspec/changes and specs (#2052)\u201D; \u201Cfix(windows): preserve a file\u0027s existing line endings on rewrite (#1958)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/utils/file-system.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/file-system.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c35d6f5346d3fed412c4752c0df5dfda1bf4f84e03f82431c9d3c02930da837"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/utils/task-progress.ts: src/utils/task-progress.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 7 (its worst body is task-progress.parseLocatedTaskLines at line 126), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tasks): keep the full text of a task that wraps onto several lines (#2228)\u201D; \u201Cfix(tasks): count unrecognised checkbox markers as not done (#1773)\u201D; \u201Cfix(tasks): count checkboxes under every list marker (#1862)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/utils/task-progress.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/task-progress.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b32e082a51bf63f1e83af384228afe972a706031488d0aafaec5d6c21a230"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/parsers/markdown-parser.ts: src/core/parsers/markdown-parser.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 10 (its worst body is MarkdownParser.parseDeltas at line 194), 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(parser): accept closing # runs on section headings (#2205)\u201D; \u201Cfix(show): include requirement and scenario names in JSON (#1972)\u201D; \u201Cfix(validate): reject a scenario header with no body (#1858)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/parsers/markdown-parser.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/markdown-parser.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fccc54a05bd18491ad4900b34b9d9887d89fc51f8db70dc9dd58bc2ad1be315"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/parsers/spec-structure.ts: src/core/parsers/spec-structure.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 spec-structure.findMainSpecStructureIssues at line 18), 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(parser): accept closing # runs on section headings (#2205)\u201D; \u201Cfix(validate): match unspaced ###Requirement: headers in the main-spec structure check (#2133)\u201D; \u201Cfix(parser): drop closing hashes from requirement names (#1860)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/parsers/spec-structure.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/spec-structure.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8ba5aa0f283b2bd60e08495a10f1eefd9bd0e2d1a913f6aecb4fc762cd9867"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/telemetry/index.ts: src/telemetry/index.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 5 (its worst body is index.isTelemetryEnabled 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(config): leave an unparseable global config untouched (#1876)\u201D; \u201Cfix(security): harden CLI against hostile-repository inputs and clear dependency advisories (#1835)\u201D; \u201Cfix(telemetry): print first-run notice to stderr, not stdout (#1666)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/telemetry/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a8f4eccd37ae431e30b7e8657c3a4f2600bc96f8b4697076c4d423110ea3de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/core/completions/installers/bash-installer.ts: src/core/completions/installers/bash-installer.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is BashInstaller.install at line 232), 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(completion): restore .bashrc byte for byte on bash uninstall (#1872)\u201D; \u201Cfix(security): harden CLI against hostile-repository inputs and clear dependency advisories (#1835)\u201D; \u201Cfix(packaging): print the completions tip from the CLI, not a postinstall script (#1704)\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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:16 \u002B00:00\u0027 --until=\u00272026-11-13 22:09:16 \u002B00:00\u0027 --full-history --no-merges -- src/core/completions/installers/bash-installer.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d3fcab05f90ed6cfd83cfe8a0dfc9e1cd0642d92a44c3f96adcd4c09c6f642"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: src/commands/feedback.ts, src/core/validation/task-checkboxes.ts, src/utils/shell-detection.ts, src/core/change-status-policy.ts, src/core/onboarding-commands.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8bc89854760ca4a77394b138d210473c4abdf8697521411c91fbf8ace7e17ff8"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (7 single-owned of 114 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 114 of the 208 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/core/planning-home.ts, src/core/validation/task-numbering.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022config profile [preset]\u0022 repeats the code it sits on: 3 of its 3 words (config, profile, preset) are already in \u0060configCmd\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/config.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4183c16ec9a7600487781792c21fe72ca780924444077df5d34fcd625a2422b4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Hidden command for machine-readable completion data\u0022 repeats the code it sits on: 6 of its 6 words (hidden, command, machine, readable, completion, data) are already in \u0060program\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50444dd399c340181b1fdcde2c5ac3c2de195839d7973b94279815f972d0995"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Validate the new config\u0022 repeats the code it sits on: 3 of its 3 words (validate, new, config) are already in \u0060const validation = validateConfig(newConfig);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71adf65bfeb13bce2cb5b678c56df82ab9e01005a9823776b7f730a3eb063bd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Submit via gh CLI\u0022 repeats the code it sits on: 3 of its 3 words (submit, gh, cli) are already in \u0060submitViaGhCli(title, body, url);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/feedback.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb850e0a9db56e0f87434c0349e5e622d833619e7c98719587bedf0f0f786a9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find specs to update\u0022 repeats the code it sits on: 3 of its 3 words (find, specs, update) are already in \u0060const specUpdates = await findSpecUpdates(changeDir, mainSpecsDir);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb615e7a68384dd617d07f1474b9383891cea03d41d92c78a9400be51cccd2c5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Schema loading and validation\u0022 repeats the code it sits on: 3 of its 3 words (schema, loading, validation) are already in \u0060export { loadSchema, parseSchema, SchemaValidationError } from \u0027./schema.js\u0027;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/index.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5272c90a48a456f65a26b1b94bb6fcf094129f39f8d62bbb8a8a9ff4298408e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Read file content\u0022 repeats the code it sits on: 3 of its 3 words (read, file, content) are already in \u0060const content = await fs.readFile(bashrcPath, \u0027utf-8\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4db35b920b5a11dbf5ae9ceb620421dd2e4198d3ed5bbde6a0265dfccbc758"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Already installed and up to date\u0022 repeats the code it sits on: 3 of its 3 words (already, installed, date) are already in \u0060return {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"43428fd52cb64ddf549368ff354dfdc566ac2b087c54b0acfea38e98489c4f72"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write the completion script\u0022 repeats the code it sits on: 3 of its 3 words (write, completion, script) are already in \u0060await fs.writeFile(targetPath, completionScript, \u0027utf-8\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dfea1f5f1547f5b6c4127f5f3ecc33cd4cebb8efb52d867deed4bc0e70d774"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Already installed and up to date\u0022 repeats the code it sits on: 3 of its 3 words (already, installed, date) are already in \u0060return {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/fish-installer.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b136075df0b524117257c47f19c8500552da1b70a4b69534559e0847abd0f40"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write the completion script\u0022 repeats the code it sits on: 3 of its 3 words (write, completion, script) are already in \u0060await fs.writeFile(targetPath, completionScript, \u0027utf-8\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/fish-installer.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cf67d9010c1c10f075125bedbb25cbe796fc6e3ace08cde2630d84ca680b46"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Already installed and up to date\u0022 repeats the code it sits on: 3 of its 3 words (already, installed, date) are already in \u0060return {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da976b3eb99a2e54040ab92f6308914aa94394dc08ade67d3fd1cf06a6e445a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write the completion script\u0022 repeats the code it sits on: 3 of its 3 words (write, completion, script) are already in \u0060await fs.writeFile(targetPath, completionScript, \u0027utf-8\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"983dacb9d59c294658badea529798ec1728045a8a850f5827647cc21bc42807d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Oh My Zsh custom completions directory\u0022 repeats the code it sits on: 4 of its 5 words (oh, zsh, custom, completions) are already in \u0060return {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"06de266be623c55e4767111ce17d3529009741ddee56437e841e24d31aea20bc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Read file content\u0022 repeats the code it sits on: 3 of its 3 words (read, file, content) are already in \u0060const content = await fs.readFile(zshrcPath, \u0027utf-8\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f2569a3f4eef3a929b1075d4f707ecc7f008aa70165941975d4ee73f49d891"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write the completion script\u0022 repeats the code it sits on: 3 of its 3 words (write, completion, script) are already in \u0060await fs.writeFile(targetPath, completionScript, \u0027utf-8\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c761d12224b262fbba39f78974c3a29acc8e27d056b40972414a55c2ce06a47"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Validate selected tools\u0022 repeats the code it sits on: 3 of its 3 words (validate, selected, tools) are already in \u0060const validatedTools = this.validateTools(selectedToolIds, toolStates, projectPath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4a2c4eddc695c26529057a393a06bfc6e598cfe493eff9a2d191436d41e124"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate skills and commands for each tool\u0022 repeats the code it sits on: 4 of its 4 words (generate, skills, commands, tool) are already in \u0060const results = await this.generateSkillsAndCommands(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e764244bd20de2e8004cae6d796d046ad7fa55c4424974612b1fa82e97259d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Display success message\u0022 repeats the code it sits on: 3 of its 3 words (display, success, message) are already in \u0060this.displaySuccessMessage(projectPath, validatedTools, results, configStatus, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"97af3536c235575e51f20198b5a2a0225afdb217636b3dbbcdee0f1295b5d60f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check write permissions\u0022 repeats the code it sits on: 3 of its 3 words (check, write, permissions) are already in \u0060if (!(await FileSystemUtils.ensureWritePermissions(projectPath)))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea47cdfba2a9b2e7c4267ac5fc459186270a2e8c209045cff7e038b42fa5bb8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Scan for installed workflows\u0022 repeats the code it sits on: 3 of its 3 words (scan, installed, workflows) are already in \u0060const artifacts = scanInstalledWorkflowArtifacts(projectPath, tools, true, view);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8ea8decca5404ece5d72f7bc8d3562cc585a418eaa69cbb39e99fcc3bcc6e9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get valid tools (those with skillsDir)\u0022 repeats the code it sits on: 5 of its 5 words (get, valid, tools, skills, dir) are already in \u0060const validToolIds = new Set(getToolsWithSkillsDir());\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"38210aaf2cc6b9e2083ffa28c483c908214f2017d8100f6237744b41287ac535"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Sort specs by requirement count (descending)\u0022 repeats the code it sits on: 4 of its 5 words (sort, specs, requirement, count) are already in \u0060specsData.sort((a, b) =\u003E b.requirementCount - a.requirementCount);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84e1325a825e5ac80925130043dff9ffe66117b0e8ee10e423cd2cd626d9f08"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Pad the art column to fixed width\u0022 repeats the code it sits on: 4 of its 5 words (pad, art, column, width) are already in \u0060const paddedArt = artLine.padEnd(ART_COLUMN_WIDTH);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/welcome-screen.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f7d4dd38be4b8ca6860bd7db0289bc1a35797dfe7c587be61f118b093397f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run with XDG_DATA_HOME pointing to our temp user data dir\u0022 repeats the code it sits on: 7 of its 8 words (run, xdg, data, home, temp, user, dir) are already in \u0060const result = await runCLI(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/commands/artifact-workflow.test.ts"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8ee0e0aa3ede1a9614ac6688fd750ac893a6b4257a0714a2cb5ffe768bf16"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a test change\u0022 repeats the code it sits on: 3 of its 3 words (create, test, change) are already in \u0060await createTestChange(\u0027config-test\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/commands/artifact-workflow.test.ts"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa44542a5e32bab402ce7996ed4c7c7de5f818e6c6ab6907b690fae3d64c32b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a test change\u0022 repeats the code it sits on: 3 of its 3 words (create, test, change) are already in \u0060await createTestChange(\u0027non-matching-test\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/commands/artifact-workflow.test.ts"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef636851fef9e0457a54481e0b56255003f31d15bdec92c52c94e1ffbc59711"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a test change\u0022 repeats the code it sits on: 3 of its 3 words (create, test, change) are already in \u0060await createTestChange(\u0027immediate-test\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/commands/artifact-workflow.test.ts"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dd273edace2947961d6708c37e876fe306734aee6f32bbcab137a7a42279df"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock the ZshInstaller\u0022 repeats the code it sits on: 3 of its 3 words (mock, zsh, installer) are already in \u0060vi.mock(\u0027../../src/core/completions/installers/zsh-installer.js\u0027, () =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/commands/completion.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1041dcdfc7c211366f2bf29d104fa7767267d067ea8505a7fdb37ee897b0717a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Spy on console.error\u0022 repeats the code it sits on: 3 of its 3 words (spy, console, error) are already in \u0060consoleErrorSpy = vi.spyOn(console, \u0027error\u0027).mockImplementation(() =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/commands/config.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42837881806b43e7b9254908ff71ebae787249125a3ce395c553d24c3d6a236"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock @inquirer/prompts\u0022 repeats the code it sits on: 3 of its 3 words (mock, inquirer, prompts) are already in \u0060vi.mock(\u0027@inquirer/prompts\u0027, () =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/archive.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f180df0d092d0e39a2b2e563b0f82a61379486e2aea1a162a96bc793c42c6b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Restore console.error\u0022 repeats the code it sits on: 3 of its 3 words (restore, console, error) are already in \u0060consoleErrorSpy.mockRestore();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/global-config.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4801bcb1fb4cbc455e4fac9a5b3c21863d1dfa9edaa6d46ef35d2f45e48f4c4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set global config to custom profile\u0022 repeats the code it sits on: 4 of its 5 words (global, config, custom, profile) are already in \u0060saveGlobalConfig({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/init.test.ts"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade3798291a6a06f3a421cdd2fbadf41f0ce7cbb1e4af5446a8e4f8208ba8d6e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 12 comments in this file only repeat the code they sit on (lines 2511, 2683, 2986, 3015, 3076, 3118, 3176, 3243, 3293, 3377, 3409, 3543), for example \u0022Create update command with force option\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/update.test.ts"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53e5f82f1c925417e6322909042240d7e60b4aeeffe4fc414390e3f6d83f08"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (43633 LoC, 405 module-visible types across 27 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"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":"7be3bb4d1669041c07846eb013bac654ccbf0f57405b1f6c5beb6dbece63a682"},"properties":{"commitSha":"ea5aa0e5629b787b0d74dbd860b599ad6a540958"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"210e60a44498e8d8682a685b0405689460e89c662d5f975535680fbd3a782844"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"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":"5b524818977fe591343ca577566d99f5452dee5b17c2898d500ab49fcf53e9fd"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"737a470251d8ddc11fac38213573183d42d05e9a191a7b71e87118431f989e5a"},"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":"0b3c2c7cfe44dfcd3c1cd46ec2ce29e102c6f16af0076fa7814dfd2270f13df2"},"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":"56f8cae028da2afb6fa8142b72be5387aab8e31ddd0900ebf8c53b3b2d5a77dd"},"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":"35409c8511ebef069e2e43df42bd43310cf130849f20246e7df79700755e3c9a"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b07c41aee32c17de37e916a50b33ea9eacae73910cb260ce87776d6b5f2b522"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa9f8f4715b527e8f40ae88ce0d67cd856f5556d25ac87f0cad5ba9782b278c4"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"babcae45457187a97c40244416969d09a3a30c6c3ec0445e1c6891b369205f76"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"864d8fe663a156d35a11ad0972d806e8f09ebacc8696477db84c5fd1d3452623"},"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":"9927ad83bb4e4f780c9599f4397cc6438fd075a88a84a57d2c3935c6ea7f94a4"},"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":"61d82bb0791d332b928a0f65fd1c8d0b70c144f89fef482ce4ee867d60536658"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cda5d0da45815df7ef6b29c0f765e4ae3dff0529e01a08a1ae60ec6f82592e4"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10774589c62f8e88a5120704e2d5c6b6fb565d2500eeaf94cdaf15ca20b6d585"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 114 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 114 of the 208 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/core/completions/factory.ts. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/factory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aabc8af4eb65320da416b95ff4ddc8d372f927be3f4d35669910fc4a315143"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: registry.ts \u2194 config.ts: \u0060src/core/command-generation/registry.ts\u0060 and \u0060src/core/config.ts\u0060 change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060c879d13d\u0060 feat: add support for code studio AI-powered coding agent (#883); \u0060d1642cb5\u0060 feat(easycode): add project skills and commands (#1352); \u00603de7c72c\u0060 feat(atomcode): add project skills and commands (#1211) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"510d5f8b1489edc0c44b4cd6d8b1ab1ee6cba7385cd258081bd3e26f7e53b35e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: index.ts \u2194 command-registry.ts: \u0060src/cli/index.ts\u0060 and \u0060src/core/completions/command-registry.ts\u0060 change together 76% of the time (16 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u0060c2304240\u0060 feat(update): add --dry-run to report what an update would change (#2\u2026; \u0060ded99e27\u0060 feat(cli): show archived changes in list and view (#399); \u006056528ea4\u0060 feat(cli): report version and update metadata (#2001) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ab8184185d9544f8b77242bb511da69c35506d7369fd08d965f3638b4f286a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: init.ts \u2194 update.ts: \u0060src/core/init.ts\u0060 and \u0060src/core/update.ts\u0060 change together 63% of the time (24 of the 38 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 24 shared commits counted here, the most recent 3 are \u00607de24044\u0060 fix(init): make the universal tool target findable in the picker (#1778); \u00603c6d318b\u0060 fix(init): name the workflows the profile left out (#1779); \u0060cd724449\u0060 refactor(core): share the IDE restart hint between init and update (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efe14c52bd502eeeb730417a78725db3e2faf46429a6a8bd1ba1b4b3c5c51f3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: change.ts \u2194 spec.ts: \u0060src/commands/change.ts\u0060 and \u0060src/commands/spec.ts\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006087a69a2b\u0060 fix(specs): accept a spec.md symlink to a file elsewhere in the proje\u2026; \u006068e0a7e6\u0060 fix(cli): prevent hang in pre-commit hooks by using dynamic imports (\u2026; \u00605d185ba3\u0060 feat: add unified show command with interactive selection \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e2e5878e89ff9a2187a6c070b0eafd8e28e9cc374d8266d2eb075c3e22f079"}},{"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":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSearchDialogInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/components/search.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7761df6223eedb8a559eaf58d9673dbc572c52e79e9cda94b34e024f00becc3"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/app/layout.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0db707e807d51bd8a855583fd22b57062520bf0559ac2f34c222ccbcc260fcf"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060generateForShell\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/completion.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b706940fef313bb23dd41edc6fe7fe15d7c92fcb763eb07a40e77c4c5730c680"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060execute\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/feedback.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1925e6785f6cf6be6cf077dd74efcd66119463c404f16feac4d6c4e0a6a917"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060schemaWhichCommand\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85386f033be0e465d7f75fb3e3d35cc6ff079c2ab903e708f32715816a3c9c4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060schemaValidateCommand\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3935ef2d24e31aa0178e57d33bc57125a1e97a81dd362a54f447f84bf81f6cf1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060linkSkill\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c9c3380ca6ccaa57cb16778c2882985f60a6f00ea8d0e1dd2ae66f53a21ce5"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 4 ADR-shaped document(s) detected by content \u2014 \u0060openspec/changes/archive/2025-12-29-unify-change-state-model/design.md\u0060, \u0060openspec/changes/archive/2026-01-06-make-apply-instructions-schema-aware/proposal.md\u0060, \u0060openspec/changes/archive/2026-02-17-add-verify-skill/design.md\u0060, \u0060openspec/initiatives/context-store-and-initiatives/work-items/09-add-initiative-resolve/decision-review.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 230 JavaScript/TypeScript production file(s) this check read across 2 module(s). Each was searched for its ecosystem\u0027s logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"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/binaries.yml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060maybeWarnProjectConfigDrift\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c423209691d996e14f3e5c95cb2cb3dba1f176e26d3671e2bf04559b4effd76"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060configEditCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd0f9c38d99b4375255f02039920bdb46a1c93d643390393562d5f0d0c0568b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060configEditCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8059b068d21b421fb64cf4ab0de121b442e360c50963011066e1bbe90dbb7ffb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060configProfileCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f2cc9e3f5dfc1b156c0d81c0a577c2160af5a42f83579c36e02b167f9191ae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060prepareDefaultConfigUpdate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17d1046c1b8b64dc5c5d5b9aaaa7ec70474ab85f5c19cb2889dcb59c2a87997"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060prepareDefaultConfigUpdate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb3592f93419709c396f17940aaa1386a6bdbc5f53a41074a530abd042316a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060prepareDefaultConfigUpdate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87906af2f5bee8fef9e1506900e2f13063eab7a167c96b3ab7aeffd91af80c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaValidateCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea333900f1eda4830ad2d492d36012f5d3a9169ddd62ef667aea0b4e5fbb3fa9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060schemaValidateCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"204fa5fc2b82cd1e5b3a7f18bffcb3d74e233b7375392ae42e2d199398e3f91d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaValidateCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2ee9228a32e5f8028c63f3279b5ebcc4313ddd378406906f842f8b50a4a52a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7751558a2858b86f28949275da3bbe8966c9c7dec06858f1341283c37e9d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58bef2e887322779a90cc3c7fd3015c3218a317040ec11df0d3c25ea5e75054"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69c058a946895834a7f252e0073ecfd138c3f3bb1888da0c00a480e9a6ae9d0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c8a74c73457d408ad90871b1666fd20b3b687c729f2e9bc5f445c4ca5bcf4b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e231acb4f805d6392490574fa415d782532a1debb961930fa1a14d13563ddc8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4411b11d86adfde5bbd398e8b8db56fcb3a3cf30d70dcf091121626dc91306"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9737322f5732ec2b3a13f1f05dae6e06bbaa427300f27ea964f91a4b6af97b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b961c8d1fa6f102bb8dbb680d009a5a0a57605dde79a7cdfb6daa70f5229459"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"04617d8c42b0b42134768e28e198e7b7f4bc7d59a0a7f0492edbbabb03fff501"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd2b9bb2e5c0f393c25e24c74847e2b9d5e721f9a0c52d522e67ca927a09e43"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c84d1d3e1862dc9331ad14f30c37f09f1b94f63ce57ca936244854a89ca42"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e01a8e4e52ef8a6bd17f246b406cb19aa92a5be619ed91027190af77fd00bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e0882f4aa6ac9f2316f4a10b3ab3ca6980472b6365b35a59d0fc9c9e0e418e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"011863c14a46670cf919ced099e8c8a873835ed1b4e45feeaa5a3c531740e6e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a246a7685cecb0cda121b9973d1f1521a8abd8276468264edc68caa85ba28f37"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5b886d7c4057d017970667b867baf75d29005a7e9f1e0ae365dde19d7e1bcc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaForkCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"6871c0ef365f247e2f28272ce31c4dc65d194dc5d1d041df2d3f43e243470de0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda067db8c8fe0500ea5da6303423298c6a0a341b60dce32bca024fa90f85fd1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fd740634df9d50e3928ff9c29257b938c295451781f1e49bf01cbf2b0b8a71"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"13458f6d7078944905cb02e1875ac3831c1ca64aa8d2b5e239b35fa4f98e9137"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d0847fd247704a1d26699b548ca93e3816307df8e74e5a6cb2d137bbfe73f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95691d6bcd6ccb44da87fc1d97bd7bd6dbd4ce4903a492a4d208cd2ebfb8bd4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4506df45539772b3df28ae7553180527f7185cf0ae070d4f7bcf25998d813ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"277de5fb5c1b366118d9ef5c1bb80f648e7a0b95675be62cbc540b5f259ac315"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca5378f941b75eb03d993a943b56f3f6754ca78f67824f47355eb876f4ecf03"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"52466d1895bf59742c0e61742124d5212b4361b19e0572c1c21f119326204b8a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"14675021e936a8518b32326a6d29fa9ba43de394d55f74b92727b53734cf67a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060schemaInitFileOperations.renameSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1422940f4e480571a77020455c1f0f234e77f1fd90ce10316dae45c8912b619"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060schemaInitFileOperations.renameSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad70c6bf587f4fa2f6abd8ceacf74e77266345a0c5618c011986f3fea08d42b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060schemaInitFileOperations.renameSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b52337fe5cdb37acc64c01c2d2eb7e6f9d7c1f132c6ffe9d39934a72f4cefd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060schemaInitFileOperations.renameSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06f2c99419d50131d92b8bec2a47826b98fec3e0e8c9ae73f3e9dfc400e391"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a627a54e3a665e202616ebaca29f1d2d23e4f9cf2eb248ec7cd05d9c9e16e07"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060schemaInitFileOperations.renameSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcdba547eb17e3add8f73e117dbb1fb2b09ff8d21160d626ef8b2214bf9d104"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c3adc900d2a282aa5790ed17525c6b0aa5bec840294390021d519c9c1c3fae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060schemaInitFileOperations.renameSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e2266aa0cc3dcc79c260fe1818b3b4e10cc02605dc954809851c11f6879ceb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a2a8856f7a261ac763c6664a27ab7e17730f96789b3d63b2a3ddc63ecbaec4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60f79c39a69222ba7a316a6c230588754e9ed257790f2831345842e67d7cf4d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060schemaInitCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a954302cec9cebb316caf72e765be11a231bbec01aba73d4cf94c3182b56c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060show\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/spec.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8bc08c93c8ce1e2610f0fd0863f25061ac0adbf20df5302f2550dbf44f93a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060specListCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/spec.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"15412b91e0cfd21452a21d1a6728eb15f2b6cde716d17d9d14939a2698cb8667"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060specValidateCommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/spec.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"637f8848f9ae2eb99767cd83f001797ec64c7f3671be19d07ac1bd9988f22ea9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060validateChangeExists\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/shared.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"573d90ce31754ed7f9888d856e2ef2a86df76df8edc3f462b8d592475e12c70b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060validateChangeExists\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/shared.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cac08b148d32e067aced8aa854a0cf95cdc3d7d51bc019c615f4715b9b7a47"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060convertChangeToJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/converters/json-converter.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d932b9dc4e444d7a54ab4119648eb8bf0777c2ce61b3864392b769f58334bdf6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060generateSkillsAndCommands\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a40c91b1370c7eef2ed097bde781d5677f217505399de04e9256d590f8de4f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060taken\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f5151f0b574bd8eb8e22e9bb66fd605d0c4c81401f7603c20a7a208a73d859"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060generateSkillsAndCommands\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0c7c5e3de30e13d05b481880862ded06791db778e8fdf97594ee61ec4996c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060assertLanguageCanBeApplied\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f99d2cf6a6a74f0f79daccaff23e0124c5f3f31c8a3809e84bbb499ceb0d012"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060assertLanguageCanBeApplied\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"436737aea536158163afce532aa6ed7ccb1b7afaf002419f509f60fef5180c9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060createConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b244b075c18aba05683299c17fe6e0102efecada55209ae9a309edf6783eb05a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060createConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3953f1936dd9abb3693091ae99631c504424c1ee39797820b038b1058f3bcf3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060execute\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8903bd7872e296f0d2b4f018f0e6cc956fed34d661e70dd55ebabece518306de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060settleOwnSkillsFolder\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6296f64f4ef12500e7fe2f2aafb0948af7434f6b5d1cdbe5baa1aab9fceff0c4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060linkSkill\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca7421be5c2d638211996dfde06140cec92a9d9dbbb5dd2fff97719d92de263"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readlinkSync\u0060 in \u0060linkSkill\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d44c175403da2c12853e40ec15e97fb9ff686b7dfb2be7c6541bb3b67324d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060removeDirectory\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6c90237f40c97e780be8a8f948959b16792f7f9d95a22e422ecaa04812edc4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmdirSync\u0060 in \u0060removeUnselectedSkillDirs\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63af039c6e85b800daf539e8180e15036747fee6d1e6c1519dc48300f977f90"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060validateSpec\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779ceaa5422be37dd12a637acf58cb1dcae45d1c1fe0d751333f7722f688725"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060validateChange\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8df616c50b2279b6510c4243e13b47ac7e5af97974b8219957388efa5dd8807"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060execute\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cc3f0d96082b6ed037f20a845bc2de8503c17f062023d5bd9a17e0f0b4c038"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060getChangesData\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb072ce62686a65db4df43267d6dfa6c426ea9e09de99d983a3c96d50bc129a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060getChangesData\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dc02ff3e09566096d1b0a522f0920c7b001d17eb4e47c24da0a4d1680744b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060getSpecsData\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b6f5e3fb35ce9164f090a6ac1a8cf08ea5fcc4f676bc4db0fda74dd52dac3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060getSpecsData\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc81cb511ccb984ac902cfcc07c2669691840a51eb598c3b989fc928cd330562"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (6 clone groups): 6 duplicated blocks under src/ have copies in at least two of the sibling directories commands, core, telemetry, utils \u2014 5 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profile-sync-drift.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b588bbab0fd83e7e9c977d6c22f49b416054df5e238be6c79f27b6d3aa876"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (94 matched lines \u00D7 2 locations): src/core/completions/installers/bash-installer.ts:12 \u00B7 src/core/completions/installers/zsh-installer.ts:31 \u2014 the two spans are one implementation copied and then locally edited \u2014 592 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6da9858bbcdf00dda3f2fc20d714f420daf657ca89f851898585a2cb5a68ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (81 matched lines \u00D7 2 locations): src/core/completions/installers/bash-installer.ts:237 \u00B7 src/core/completions/installers/powershell-installer.ts:327 \u2014 the two spans are one implementation copied and then locally edited \u2014 396 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe3964de7b3c68970c9d8b71a9634e5f1d1dc9469a67be7677a6c6479f0ec5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (77 matched lines \u00D7 2 locations): src/commands/show.ts:57 \u00B7 src/commands/validate.ts:180 \u2014 the two spans are one implementation copied and then locally edited \u2014 438 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/show.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e315ab3755ed59b75ad588d42cc777d6413124eded14e4961922946b5a83e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): src/core/completions/installers/fish-installer.ts:60 \u00B7 src/core/completions/installers/powershell-installer.ts:317 \u2014 the two spans are one implementation copied and then locally edited \u2014 339 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/fish-installer.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b51994e8479d24d554e8b6ea401f08478da8a9bb6618f5a878d0618c53b160"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): src/core/update.ts:443 \u00B7 src/core/update.ts:1637 \u2014 the two spans are one implementation copied and then locally edited \u2014 300 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b28ce496770f2efe10769cef7a2362592877b24e55217afb08438314597dff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): src/core/migration.ts:284 \u00B7 src/core/migration.ts:355 \u2014 the two spans are one implementation copied and then locally edited \u2014 202 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd94bad338a54497bb5c0ba8a9cad72591cc9dac91873871b0cfec2cc28d96e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): src/core/completions/installers/powershell-installer.ts:206 \u00B7 src/core/completions/installers/powershell-installer.ts:268 \u2014 the two spans are one implementation copied and then locally edited \u2014 166 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"de229a9b223bfd34a12af4603d2e5dbe39649345da2dab1ad788b9fd31bfc897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/core/validation/validator.ts:302 \u00B7 src/core/validation/validator.ts:349 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ef721975d605507a74bd4cc47bd29ad87efa11318ff771ec8173ff247c8288"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/core/root-selection.ts:74 \u00B7 src/core/store/errors.ts:4 \u2014 the 2 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/root-selection.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15dd0b5691625898b8941b4428567bb95f398b886c59f9622d42adb75b47920"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/commands/schema.ts:754 \u00B7 src/commands/schema.ts:1010 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c429532482b94abdf1b166545ac9738e8f65c6e71770fed99172f1e831a138b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): src/commands/change.ts:583 \u00B7 src/commands/validate.ts:398 \u2014 the two spans are one implementation copied and then locally edited \u2014 156 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91d82cd94cb05d9a979bb3b65e6129b8c78d0edb50fba78fccc3727a935c9fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): src/commands/validate.ts:575 \u00B7 src/commands/validate.ts:696 \u2014 the two spans are one implementation copied and then locally edited \u2014 222 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"47555dda815705b9788fd59b8512d8be4211f121e884de8a29e49255c298f52e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/core/artifact-graph/resolver.ts:330 \u00B7 src/core/artifact-graph/resolver.ts:355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d4534c67137eebfccc3f05b0d96790daf4f2521be69e266ba3a7944cf4a0f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/commands/change.ts:100 \u00B7 src/commands/change.ts:515 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6dbc4d078090e7de8aad2e6bdf9c9a93e7f7b4000ccf573c9c7c4833ab4a60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/openspec-root.ts:54 \u00B7 src/core/store/operations.ts:171 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/openspec-root.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e9621d0b223c795bd7c833cf6bdd5327b070ae6bc6475d7bfd07a805efc3c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/commands/change.ts:542 \u00B7 src/commands/spec.ts:229 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4e1d9188dff5a61585ae9e9cd40d174daef76725ccad51539b6b368110f65b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/commands/workflow/instructions.ts:125 \u00B7 src/commands/workflow/instructions.ts:727 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"751145f05d8b90db88f339d7fcf12b781468eff9a8bb9e2f7a76eca1e7c2e3fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/utils/spec-discovery.ts:6 \u00B7 src/utils/spec-discovery.ts:69 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/spec-discovery.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3661cf754807b8797f4ff8314930e0afd3aa66f599a00e189152b88544ea773a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): src/core/completions/installers/bash-installer.ts:77 \u00B7 src/core/completions/installers/fish-installer.ts:36 \u00B7 src/core/completions/installers/powershell-installer.ts:135 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5abbe0e93d59c47db968d979902e26160bf3389182c3109463c89e86650f0eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/parsers/change-parser.ts:212 \u00B7 src/core/parsers/markdown-parser.ts:103 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4153f81422b1053bb8d8145a71bce9d914712c21638f00c0a5567444c9fbae2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/commands/schema.ts:690 \u00B7 src/commands/schema.ts:777 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e01da4dae7ca4f48ab9314e43f8b65428cff5fc9ea6cbe44d2d7e976a6f1100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/core/command-generation/adapters/oh-my-pi.ts:13 \u00B7 src/core/command-generation/adapters/pi.ts:12 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/oh-my-pi.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"df82c0c2e97c5e24364baa0d31c9b57f34908dd7cba3d664923b0d7f0715f382"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/core/converters/json-converter.ts:43 \u00B7 src/core/validation/validator.ts:958 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/converters/json-converter.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55ed48f8f74fb06b15eae34ea957a564b76bb406d2cd836dc7d3bc28bda7398"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/commands/store.ts:526 \u00B7 src/commands/store.ts:565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/store.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf5b21c662a6c3502aee22dd37618b73d1578bb8e421c6b18988d7d7b34693d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): src/core/command-generation/adapters/crush.ts:16 \u00B7 src/core/command-generation/adapters/lingma.ts:16 \u00B7 src/core/command-generation/adapters/qoder.ts:16 \u00B7 src/core/command-generation/adapters/zcode.ts:19 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/crush.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2489d31907ba3d82a22debe968aee53f4f7e11e9485af4d77f054e7747788436"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/command-generation/adapters/cursor.ts:17 \u00B7 src/core/command-generation/adapters/iflow.ts:16 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/cursor.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e25775fccf24552f804ab22f7de1bd824e7ebcf0e13c91b14acd0ff56e93928"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/commands/schema.ts:835 \u00B7 src/commands/schema.ts:1041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1841dd7bd8def118e9d47b26f3a31ef947aa80d324ef27c3cfb73017ff6623d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/commands/store.ts:622 \u00B7 src/commands/store.ts:637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/store.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c62a4781313e5708553e6e27674ff4b03b3b9426490205544dfde28e019b61e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/core/command-generation/adapters/command-code.ts:16 \u00B7 src/core/command-generation/adapters/oh-my-pi.ts:16 \u00B7 src/core/command-generation/adapters/pi.ts:15 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/command-code.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a246a5dc4b3564b4a3e6aa38423166b6b079abd77f1a297e3eefa409869e00f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/completions/factory.ts:62 \u00B7 src/core/completions/factory.ts:84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/factory.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb5ae5bda513d5162bedd5f9fa2efe2175d06d2c3b85a8f514373d0f01ef9e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/core/file-state.ts:68 \u00B7 src/core/store/git.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/file-state.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6467e5706f83063ea5ff8e928f2169084f40defcc859910d4a6a5e1fafe4de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/specs-apply.ts:51 \u00B7 src/utils/spec-path-containment.ts:38 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9200a7bcabe5afc8fa64c9031ec55f8a9e25d6f1b89ef108a649757305f1fe19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/commands/context.ts:6 \u00B7 src/cli/commands/doctor.ts:6 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/context.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b69de8f1ffc1f415f05fb7aea0f3cc8b20111d92ede375dfdbd948f3457fb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/cli/index.ts:562 \u00B7 src/cli/index.ts:596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7385bb2424fa2d4f023c0c9d38c72ff79cfd554f70e8c8a60cdf6f3ac07f70d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/commands/workflow/instructions.ts:754 \u00B7 src/commands/workflow/instructions.ts:880 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c661838e3199887dff149a5cd545074fe911cf20abef558715acdfac0d2ae259"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/archive.ts:929 \u00B7 src/core/archive.ts:969 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0efa626dc3418c5f06008c3e102a2ca75618e3c12aeaf8e880f7913578c1e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/validation/validator.ts:74 \u00B7 src/core/validation/validator.ts:141 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73c87b55a6601002f72b180bc228c2a199944993976e9d9757ef16caf999252"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/commands/spec.ts:100 \u00B7 src/commands/spec.ts:213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/spec.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfcf1f73152a03b8c19d88cf3deb1d30bd8a43b3d6962142f79fa567e903859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/command-generation/adapters/claude.ts:18 \u00B7 src/core/command-generation/adapters/codebuddy.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/claude.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3bf9b3354932c61268211a8b57d3acd59d0d72f7711de11f241b0c1267626b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): src/core/command-generation/adapters/crush.ts:20 \u00B7 src/core/command-generation/adapters/devin.ts:26 \u00B7 src/core/command-generation/adapters/lingma.ts:20 \u00B7 src/core/command-generation/adapters/qoder.ts:20 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/crush.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"da78c2d88c5c5403a1e0d04a814a0cdeb5668ceaeed907cd527382958d4c73d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/commands/completion.ts:199 \u00B7 src/commands/completion.ts:251 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/completion.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdceeb8a1adeab62cf054676542d9bedccd441fe98aff057076eda3773ec3f16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/commands/schema.ts:579 \u00B7 src/commands/schema.ts:701 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c55a8e554990c2186a46b9184cda5f18627d9e76c5a814faacd7a55b7da2a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/archive.ts:653 \u00B7 src/core/archive.ts:683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7100850369c89ff221ddd7cd6367f3bf462d75f487ddf562fd5a929de4de5d6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/auggie.ts:17 \u00B7 src/core/command-generation/adapters/codeassistant.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/auggie.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e50cc0219c383ed72ad9ffca14167b22549d294e8d00455957cd74bc7c37a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/auggie.ts:17 \u00B7 src/core/command-generation/adapters/gigacode.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/auggie.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1fc1a28c038d40aa4984acf0399ebef23ab58b5a7f6320ffeddbeaee89b954"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/auggie.ts:17 \u00B7 src/core/command-generation/adapters/junie.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/auggie.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5c736630934800702f8ad743db079d2e98de4f8978d638d35e0ba18d3ce87e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/auggie.ts:17 \u00B7 src/core/command-generation/adapters/qwen.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/auggie.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c96ea214175e33c70eba93df037df53c21256e423c30d2efa0a203213075c7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/bob.ts:22 \u00B7 src/core/command-generation/adapters/codeassistant.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/bob.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a0a6074bc52b0292c7b189acd4360f771ff682a7ea5332649b71b21cbc67ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/bob.ts:22 \u00B7 src/core/command-generation/adapters/gigacode.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/bob.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18883420ec84442942f0ee2b8c5251656166838c3c878ab40ff7f80eb728aa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/bob.ts:22 \u00B7 src/core/command-generation/adapters/junie.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/bob.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9ad6af20c1bf18161bea1d11ed6994dc4b05c73f6992a878edc89e56236a79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/bob.ts:22 \u00B7 src/core/command-generation/adapters/qwen.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/bob.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8254018dab8725e94a6fc4ace321b1eadbac386a2d597caa3e9aafe9d6b46510"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/codeassistant.ts:19 \u00B7 src/core/command-generation/adapters/costrict.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/codeassistant.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76cecd81d3364e24468ae3f6fda8a8ed3942b5bb2510606c1e725dec6e3d933"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/codeassistant.ts:19 \u00B7 src/core/command-generation/adapters/factory.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/codeassistant.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4743fb3c8890e257b4548a58cba4951563524537d952377f060735fe09ed1eb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/codeassistant.ts:19 \u00B7 src/core/command-generation/adapters/trae.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/codeassistant.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0854a1328d4dcdd760db90f28fb2621181bfffdbff710445e4569b30897248ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/costrict.ts:17 \u00B7 src/core/command-generation/adapters/gigacode.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/costrict.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4585296833929ba1e85368f22ac9102bb3f15f90025bd336866ecb60f510b784"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/costrict.ts:17 \u00B7 src/core/command-generation/adapters/junie.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/costrict.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1ee30821b06dea0c2e3a13b2718adf313cc7af6f3839802f23e8d43170b55c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/costrict.ts:17 \u00B7 src/core/command-generation/adapters/qwen.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/costrict.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1fbb6b7d8ad573645cee1d2711ed84d0663e704f931ce7134cba682ff66bc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/factory.ts:17 \u00B7 src/core/command-generation/adapters/gigacode.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/factory.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf585673296dd2249604e28ccdf5ab80910b276a87d25ed559e1d4de938f4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/factory.ts:17 \u00B7 src/core/command-generation/adapters/junie.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/factory.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a937748573b95b01dee564e05956b0f42cdb1f241056f4c1b56170d22eac0a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/factory.ts:17 \u00B7 src/core/command-generation/adapters/qwen.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/factory.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"01878dac6f30c200aec6add10e153cc61744a3654d779d61ce9da09ef9ad21c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/gigacode.ts:21 \u00B7 src/core/command-generation/adapters/trae.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/gigacode.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2978178d444faace5edb3e7e0b60f2fe5bd95a7a60e7504517b933395faaac76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/junie.ts:17 \u00B7 src/core/command-generation/adapters/trae.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/junie.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"195a8ee2e9cd8a917f1034eacfab3dcb2661f5a717baa1fcb32a39a583a26805"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/command-generation/adapters/qwen.ts:21 \u00B7 src/core/command-generation/adapters/trae.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/qwen.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"661390c85a8b4f5f1d0c44654d69034abfa773c9890acf1a009b6e3c8c4012f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/converters/json-converter.ts:14 \u00B7 src/core/converters/json-converter.ts:33 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/converters/json-converter.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067e7f058da64274ba1872675fab100c231f298839888f17acffd8525fbf9c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/parsers/change-parser.ts:29 \u00B7 src/core/parsers/markdown-parser.ts:56 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79b1c4d8003b8f57d12a846d99f7bef1ddfe1a25da53a8ca83b2babfbd234fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/planning-home.ts:30 \u00B7 src/core/root-selection.ts:135 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/planning-home.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61eef18d92b49aa9bf0f98c0f7804f601583615bbc3066f95eee022cfc2b34f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/shared/shared-skill-install.ts:145 \u00B7 src/core/shared/shared-skill-install.ts:188 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3600de8d52caf91570db36298a57eb6b0c23d1a1ed1df4bd8d662ba019f0df10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/shared/skill-links.ts:95 \u00B7 src/core/shared/skill-links.ts:143 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/skill-links.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daaac766fe486cdad9d01724b7b6a108b09abd43f09d0e87fbecb50daeaca38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/commands/workflow/instructions.ts:715 \u00B7 src/commands/workflow/instructions.ts:854 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40e61c19e858b5e5977bae33613c27f9dfa32fb48e6e5ef915fea9f53659bb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/github-copilot/cloud-agent.ts:377 \u00B7 src/utils/file-system.ts:200 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/github-copilot/cloud-agent.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7b0944834411d52744ce8df5379ae1ae0535cf568c6acf266e3469d97207e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/github-copilot/cloud-agent.ts:608 \u00B7 src/core/github-copilot/cloud-agent.ts:630 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/github-copilot/cloud-agent.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"78703a38ea302018aa0bca550b39211b137291780f5c674a027321a85094fa92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/core/profile-sync-drift.ts:182 \u00B7 src/core/update.ts:861 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profile-sync-drift.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e49d1b6da67178f1fd9de17fa9a737844e713606b27c7eb248ddec0d554248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/specs-apply.ts:274 \u00B7 src/core/specs-apply.ts:284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"147c2294b50c355b4801ea7f555aeed6f47b43beb2f7e95eb43ec48808c3ba19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/parity-hash-shared.mjs:62 \u00B7 scripts/parity-hash-shared.mjs:72 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/parity-hash-shared.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1309c0c97021948bc9c20c4702b2355fc74d0d97cdb883b4c3c403c0ea14f79b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/cli/commands/store.ts:95 \u00B7 src/cli/commands/workset.ts:80 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/store.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48327a16b33225091d762ef0bb671101af3c528bb8b47bda78ed95742f308c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/commands/schema.ts:276 \u00B7 src/commands/schema.ts:313 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee88439a974fe20895ba90cbfc658df5ac2d971a2eb57ba426b05825c8ade8d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/commands/schema.ts:540 \u00B7 src/commands/schema.ts:550 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f86355f82f44ce4670041f48bab7bcc9843259375741764e6d7ac470dc0fe6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/commands/workflow/status.ts:124 \u00B7 src/commands/workflow/status.ts:225 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aabd48fe5a6f837c254a03440d3a695ce3c9c58de72cd6c32d2d943fe6696bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/core/artifact-graph/resolver.ts:260 \u00B7 src/core/artifact-graph/resolver.ts:273 \u00B7 src/core/artifact-graph/resolver.ts:287 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17e28d2e9329d5ddd3aa58965f0ad5b5483092d3aef83b68dadb79447943ac2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/core/command-generation/adapters/command-code.ts:22 \u00B7 src/core/command-generation/adapters/oh-my-pi.ts:22 \u00B7 src/core/command-generation/adapters/opencode.ts:23 \u00B7 src/core/command-generation/adapters/pi.ts:21 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/command-code.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56cf46032ee6d1464c52e84a8b24444c2dca29db6706adce93dddd000294aa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/core/init.ts:1003 \u00B7 src/core/update.ts:462 \u00B7 src/core/update.ts:1659 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3e33fd63611a810350e6ae49c2d9b6d73f79aabffd9b802adedc0dc6ea4e5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/commands/show.ts:81 \u00B7 src/commands/show.ts:93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/show.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7485a64000cc3bc87e4ee701f78a631cae976b2fecdb53afaa5e75d159cf61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): src/core/command-generation/adapters/crush.ts:8 \u00B7 src/core/command-generation/adapters/easycode.ts:9 \u00B7 src/core/command-generation/adapters/gemini.ts:8 \u00B7 src/core/command-generation/adapters/lingma.ts:8 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/crush.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb503487dfea16d6aa213837dd7aabae9e572323190e3dc10baf4b490613350d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/core/command-generation/toml.ts:16 \u00B7 src/core/command-generation/yaml.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/toml.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6c05777a910741b110b41059bd883daa41efafb84e0ddce6c4afa9c344b8c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/legacy-cleanup.ts:547 \u00B7 src/core/legacy-cleanup.ts:580 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d2c959df7bbcfda0aa6a8268d375d34136b1693fea457207dcff32676d6f8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/list.ts:254 \u00B7 src/core/list.ts:264 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5971ab98a20ddd594c41515953f33d8e139eddff275229781d5f215659be9fab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/parsers/change-parser.ts:198 \u00B7 src/core/parsers/markdown-parser.ts:89 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e33753c3c36e3b8b1de5b2136bac3274daac4565078172727350673a178731a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/core/shared/own-skill-texts.ts:19 \u00B7 src/core/shared/own-skill-texts.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/own-skill-texts.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa97e6d9113d0c1858ececeefba02afb88570cc9fe9ee722f945a2f5b979fb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/specs-apply.ts:471 \u00B7 src/core/specs-apply.ts:489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e551d685526bc38f546ca77a8669a46cc2407ea6b3468074d91adef4d5325ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/validation/validator.ts:338 \u00B7 src/core/validation/validator.ts:374 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c363fdf368fe4aeaa053ea066eee4201c23d4ca4fe2f057c411b81f8a19c9a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/view.ts:29 \u00B7 src/core/view.ts:63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/view.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0239034d0efd96f0736d829ea842f34f3c7565268ae13e8c7e61c484f13f41ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/commands/change.ts:370 \u00B7 src/commands/change.ts:378 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc728115133f5bc315f1e23d7578dfba809de51e05f8822776f3f1c3f7ee0a21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/commands/workflow/shared.ts:157 \u00B7 src/utils/item-discovery.ts:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/shared.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"55281757ae1970ce8ece92962a09b92ebb50cf84931943bce6276270ed17869b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/archive.ts:441 \u00B7 src/core/archive.ts:449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edbac5b3532d18c5e30e0a1ad4018664a203483d234391e78175baf9a4b3bd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/config-schema.ts:175 \u00B7 src/core/config-schema.ts:205 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/config-schema.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e571ac5b5abaa0699ae4fc953a5ed9052ff55fb402ac8ae5bf7d8db475fa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/core/github-copilot/cloud-agent.ts:540 \u00B7 src/core/github-copilot/cloud-agent.ts:620 \u00B7 src/core/github-copilot/cloud-agent.ts:641 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/github-copilot/cloud-agent.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf69a88b62dffaf3974daec2a2789b6bcd16e81cc43cfecfdb4a0505e0e91f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/init.ts:277 \u00B7 src/core/init.ts:1109 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce633ff9b89d0ea7ed57ca4062e1074a3d8d35e3fed28b23d889c510d1c8d38b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/init.ts:1040 \u00B7 src/core/init.ts:1076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0585f1796393ce6f8f161565f29efc75b706f4a428f21c0b2d84ae0c8217823e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/commands/store.ts:458 \u00B7 src/commands/store.ts:475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/store.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa2d4b8455e85dd04cd87db93ed918937b73d778711c3afc07bd5e228673094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/commands/validate.ts:467 \u00B7 src/commands/validate.ts:645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbbc16f57f85a2a4adcc560809ed8bcca8d0dbc8844115a1004befa23c190c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/commands/validate.ts:617 \u00B7 src/utils/item-discovery.ts:46 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"82629fd0275e2cceee6f2ae460b7a0579b400d135676f32185ff7920eb94498e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/artifact-graph/resolver.ts:284 \u00B7 src/core/artifact-graph/resolver.ts:322 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4960a83b60b3eeeafe2a2698c88ccd7083b1f01d738910959ed65e5eb9cc086"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/list.ts:149 \u00B7 src/core/list.ts:263 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/list.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc9594f8abe18436216e996b67a69c548f57707bd1b1548c6c28d308b1d0638"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/shared-skill-target.ts:39 \u00B7 src/core/shared-skill-target.ts:58 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared-skill-target.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d018bed43330a105c6bc2b4d411d1d5176ca21fc973117d308338fff108670c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/validation/validator.ts:433 \u00B7 src/core/validation/validator.ts:448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f10268a81a0cc1650a55a078e8088f3670c1d0728576c6d5c20f7b85dfbd4e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/telemetry/opt-out.ts:13 \u00B7 src/utils/ci.ts:9 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/opt-out.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ee96fac5c510ba6bf8a3449209775fe78426fddba030ec9cef24008b276ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/utils/nested-change.ts:105 \u00B7 src/utils/nested-change.ts:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/nested-change.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0336f90d0ecfb7f118f3a97c98804330c29425882f5efb19d94a1711fc0bc9be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 164, cognitive 518): run has cyclomatic complexity 164 and cognitive complexity 518; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d5b813489a55f2443289c0573f1bfd82a6c938c17807c5e59f8f24bd96833"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildUpdatedSpec (cyclomatic 77, cognitive 126): buildUpdatedSpec has cyclomatic complexity 77 and cognitive complexity 126; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"82480b50e15051d53da657cc7b53e0a5d772cc7b6e68d343b671e31dc50e59bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 74, cognitive 127): execute has cyclomatic complexity 74 and cognitive complexity 127; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"586580b62736c93c6d20c723db477ee4b19a132bd4c6eb4dc62594b9dcb1d8c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChangeDeltaSpecs (cyclomatic 70, cognitive 146): validateChangeDeltaSpecs has cyclomatic complexity 70 and cognitive complexity 146; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe8d0c10d849460a4e64073ebd4f21207236d918a7d2ced4f2031029a5f6ce4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaInitCommand (cyclomatic 66, cognitive 105): schemaInitCommand has cyclomatic complexity 66 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6e0739afdd768032303a1aa87a59f6ffb6bd34813dc132b625cbcd31398d5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contentTheMergeCannotName (cyclomatic 43, cognitive 95): contentTheMergeCannotName has cyclomatic complexity 43 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2cea944784423dccda2167e4271b796c1e945c4bc9f5fbbcfbc9c6dfba3666"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateSkillsAndCommands (cyclomatic 43, cognitive 81): generateSkillsAndCommands has cyclomatic complexity 43 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"587f1767dfae7a8edf82842d7f92b19582af6cba3a3d16bd60636e0a0829d630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateApplyInstructions (cyclomatic 43, cognitive 53): generateApplyInstructions has cyclomatic complexity 43 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63f1c7b1efd8bf3fee21d367b1dff87cc6f7bad7707b537ea9e0fe49eae42cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreSpecSnapshots (cyclomatic 41, cognitive 79): restoreSpecSnapshots has cyclomatic complexity 41 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28767dee6627a346e58d17bb97acca845cb573146386b9d6b5df37a97ac0d35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installSharedSkills (cyclomatic 40, cognitive 61): installSharedSkills has cyclomatic complexity 40 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"818384c7b53c8a1e21234b86e127db709825c8e38f78c01ed9d113227b896ba9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 37, cognitive 80): execute has cyclomatic complexity 37 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":"src/core/list.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f250efe50c66f88c04e8ce023a36ef66e101dffa891981487aea7cd88052ad3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function displaySuccessMessage (cyclomatic 36, cognitive 47): displaySuccessMessage has cyclomatic complexity 36 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":"src/core/init.ts"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8603eb17c0068aebe72a98022d08464d31ce55c28c11ac45091f09ba61c2b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasToolProfileOrDeliveryDrift (cyclomatic 34, cognitive 53): hasToolProfileOrDeliveryDrift has cyclomatic complexity 34 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profile-sync-drift.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc0a2fdc1e28bc3deb0e0e0f1896f9f37607c3162d2b058c2cc185b66890e28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 32, cognitive 51): execute has cyclomatic complexity 32 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55b2e09bc9747fb307a6b55067165894db502e0655b5fd1f07dfee6325fd8b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProjectConfig (cyclomatic 31, cognitive 60): readProjectConfig has cyclomatic complexity 31 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":"src/core/project-config.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aed5ab2957b772084e693d6b8d64490f262aca0ee6dfc8ad3b6b0f9ab61116f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaForkCommand (cyclomatic 30, cognitive 49): schemaForkCommand has cyclomatic complexity 30 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acc201261b5c46079efdb0b7dfed1fa34b04b64f8d4c843d60caeb67dbfeac6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaValidateCommand (cyclomatic 29, cognitive 65): schemaValidateCommand has cyclomatic complexity 29 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021495c7835a05e87665189cc161895cb3325a99daeff22ff854d6f18dac15a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settleOwnSkillsFolder (cyclomatic 29, cognitive 51): settleOwnSkillsFolder has cyclomatic complexity 29 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"410dad77511a2d02199b83672876fd874c74791e67edd110c6104776a7f0b6f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ownSkillFolderNeedsWork (cyclomatic 29, cognitive 39): ownSkillFolderNeedsWork has cyclomatic complexity 29 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fddb1c3241016bbdccec97bf66d5ef38746f463087d0689f9291bb8294fb8af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setupPreparedStore (cyclomatic 29, cognitive 38): setupPreparedStore has cyclomatic complexity 29 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"721093ee0e8e7c601f22fd0a6447348402759e0607a1f43c7542df3ffa01865b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retireSpec (cyclomatic 27, cognitive 46): retireSpec has cyclomatic complexity 27 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":"src/core/specs-apply.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8792d31edcaa2d499ae296f25e5a67278f89c0a210aa7ec291d548580bdee9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 26, cognitive 37): execute has cyclomatic complexity 26 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bded405a7f09a66c33a26f375e3bd1c7323e31014921d36fe709b2e156cd7ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupLegacyArtifacts (cyclomatic 25, cognitive 44): cleanupLegacyArtifacts has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b079d628a0cc228842bf676694d62221a58be23aa3a16d55962707798c707b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBulkValidation (cyclomatic 25, cognitive 39): runBulkValidation has cyclomatic complexity 25 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdfd1f57cb67668b69f3c4a5cd041f09245a01cf065be5ca1d23a235dbd6a6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusCommand (cyclomatic 24, cognitive 43): statusCommand has cyclomatic complexity 24 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6d70f7f0334e9e722a8e362211c7e881f1816f5cdb256ce434ac4273f99e33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upgradeLegacyTools (cyclomatic 24, cognitive 42): upgradeLegacyTools has cyclomatic complexity 24 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f16de994180b92e889a8aa750f7b0b1dc561f339b77b61f5a87af5caf31808f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLegacyCleanup (cyclomatic 24, cognitive 26): handleLegacyCleanup has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13a1ac972d69a7a83bc80a178eb4c88dfeb722df4b29b95167a721154ffa656"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanInstalledWorkflowArtifacts (cyclomatic 23, cognitive 57): scanInstalledWorkflowArtifacts has cyclomatic complexity 23 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9e65feb42f52d581dbcb7086b1cd8c2ce05460a1b2bcd0c6a5e1d548a8185c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerExistingStore (cyclomatic 23, cognitive 23): registerExistingStore has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebce4f9338867a28752de7d35c87651a3afd3287eb480a5b4af8e011493d94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listSchemasWithInfo (cyclomatic 22, cognitive 56): listSchemasWithInfo has cyclomatic complexity 22 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4b8dc3ba4ecf1b4903291f0a192ebc82bd5e44fe1c3e4acb2149e2880c6fc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runArchivedTaskValidation (cyclomatic 22, cognitive 39): runArchivedTaskValidation has cyclomatic complexity 22 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"370dcd5e1498911d7523c9020457bd8613cfd29a31b94fb06c9a070292c07cdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 22, cognitive 33): open has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1609b4d7317b57295e162e66b37e61a7e464a247e788818f90c3b1d73f893b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 32): (anonymous) has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prompts/searchable-multi-select.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"340ea41cb542327db852642df24aa33849b969bd0d55dce9814d3d029793e5a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectLegacyToolMigrations (cyclomatic 21, cognitive 36): collectLegacyToolMigrations has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f53231216a44e99c9d8507544e04b12d8d02dd9dc8449b246678d1f3c9eaaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installForShell (cyclomatic 21, cognitive 34): installForShell has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/completion.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"574b8ab62aa5104bc654361a9dd751dfadf8bb61ea915d685098378726212727"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getToolVersionStatus (cyclomatic 20, cognitive 21): getToolVersionStatus has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/tool-detection.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c967dd4be7d1575f8307e5999f35e1a8638cfbbcc10a02ed10d31a6178ec40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaWhichCommand (cyclomatic 19, cognitive 51): schemaWhichCommand has cyclomatic complexity 19 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"17959be8da6b7e5e3c6a5f7d9dd7f73b764daa047ce601db42d95e4a3b77bdae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 38): (anonymous) has cyclomatic complexity 19 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prompts/searchable-multi-select.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3111856dededc57284f880bc96da205c33c4426dc7f2258f93c50a4d8ebcb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitEditorCommand (cyclomatic 19, cognitive 32): splitEditorCommand has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c556098dd609626b666ca7a51fb665b69c7ea3f51b14aecd90c872ffabdf22b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertBraceNesting (cyclomatic 19, cognitive 30): assertBraceNesting has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce52ce2e89ea21a36e43f8b473a10884b978966ba50da197bf44956beba2434d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printApplyInstructionsText (cyclomatic 19, cognitive 28): printApplyInstructionsText has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"2484a97d6b49aafbf9d06513ef7118ee74cc63f96555b368d06f2153c6f77fdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 19, cognitive 28): install has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d765feeb05c33ae7427d1c050eda2919c38cfccfe3baaeca8c03f81140ce71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDeclarationList (cyclomatic 19, cognitive 26): parseDeclarationList has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e796a64f94250f7bac2dc9fb9512f43edaa9d0d496f242131028365abe37d0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateInstructions (cyclomatic 19, cognitive 22): generateInstructions 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":"src/core/artifact-graph/instruction-loader.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d08b8191c7388946b331847600b6c4a502c6a5d2f2bce414328a464fe6a83d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 22): (anonymous) has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/update-dry-run.property.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b2dad06cdde60e054df07f06d0203d5f43eb03db9bab9c4cccb1ed83e26a73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleReferenceIndex (cyclomatic 18, cognitive 36): assembleReferenceIndex has cyclomatic complexity 18 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c900009b457157129f03bcd500d5024228abfe890fc8f105b128e68b6c48e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherHealth (cyclomatic 18, cognitive 30): gatherHealth has cyclomatic complexity 18 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/doctor.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d966aae8ffbc3f5d02108e6c6e95fb85e9acf5a0ede8c60b4e07eac49fbf972e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectRelationships (cyclomatic 18, cognitive 25): inspectRelationships has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/relationship-health.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeb8ef47b761d8d0d4038507db49494f9debb5b8ac16328a500638ab8cc6964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printInstructionsText (cyclomatic 18, cognitive 24): printInstructionsText has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a6fa45285871ccb71ed500bda54794405d4bfd23dd846bfe38cb1176c71347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configProfileCommand (cyclomatic 18, cognitive 22): configProfileCommand 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":"src/commands/config.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"542ff3049143098ed56ddeb38103925a8b4803bf2c9dd39ed7a8f049627314a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyThenRemoveDirectory (cyclomatic 17, cognitive 40): copyThenRemoveDirectory has cyclomatic complexity 17 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":"src/core/archive.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63495302f96e70624a55a6d0333aa9585f50963e281bab9e6b3f746d2becd1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printDiffText (cyclomatic 17, cognitive 37): printDiffText has cyclomatic complexity 17 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997becf0a979d2fd4c600d92b16f2db83048b47681cf3923ab57d9acdc632b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 17, cognitive 30): show has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cbe3853e51354fb23e38fd3b7da4f5c26d3b180bf9a87f227eaaa808c14b65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 27): (anonymous) has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/spec-discovery.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85ab8d1903d150f85cd7a18b51d2dfafb6af3d96d167091a510390600fd0f7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCommandFiles (cyclomatic 17, cognitive 25): classifyCommandFiles has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/command-reconcile.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f21d63650c063d8c75e3e770ea77bc8e91d459d62612be4a82ab81a855ad3d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatCleanupSummary (cyclomatic 17, cognitive 23): formatCleanupSummary has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c6e6c75b0b145930e1e1c6a66c5e11ec03dee1a465edfea1ea5ef45752d17b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installStandalone (cyclomatic 17, cognitive 16): installStandalone has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/install-standalone.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3066fb0e2a14403bdcbf4671d85a4eb052b483ae71bf698cbf0308a33d27e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeOpenerTable (cyclomatic 16, cognitive 27): mergeOpenerTable has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/openers.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f59d49b73c494b79f0c103606ae337945de7651da41676b00fff8a9ab993651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBooleanMarker (cyclomatic 16, cognitive 24): readBooleanMarker has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-metadata.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e78785cd56d13b129c19724d2598d344021d2d59a3e391d728c60a6166f6966"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSetupPlan (cyclomatic 16, cognitive 23): prepareSetupPlan has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd40fd68d1d7db081e8ad7a416d8f1bc090f21f0b7e7f6f84cd30b9d8d84205"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperations (cyclomatic 16, cognitive 22): parseOperations 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":"src/core/project-config.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82cd42311e425b756bd49c81285a4438a1981763c15e4dd350b19119868856"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifySkillLinkSpot (cyclomatic 16, cognitive 17): classifySkillLinkSpot has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/skill-links.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb8d8888b03affcb36f4a2183e9f85c58400ab766f8861d4f9592e58ebce98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHumanWorkingSet (cyclomatic 15, cognitive 29): printHumanWorkingSet has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/context.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6915147fa9bb30d0739be2d5e0722d7bb4dd109858289c6138eb28aac2155253"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeEarlierReleaseLeftovers (cyclomatic 15, cognitive 29): removeEarlierReleaseLeftovers has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba3eac7fc36f92738a3d98603a067f272bf5272f6edaec81d9e4bc290cf2b4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparePrerelease (cyclomatic 15, cognitive 28): comparePrerelease has cyclomatic complexity 15 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":"src/core/version-check.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb1378a49b4ca09270a7fea86394be2d3eb54920a6dceb6afda1e0c2ccbb724"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateCommandFiles (cyclomatic 15, cognitive 24): migrateCommandFiles 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":"src/core/migration.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da24b1de58860bd09bb130b2c7ab65df1ad56953a7a0b0e7883e4e4c6115328"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichDeltasWithDiffs (cyclomatic 15, cognitive 21): enrichDeltasWithDiffs has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fa477e8d26b3d54b0ead1f2f91aae63b6c8cc86a0ea18c5659a8b25ee34717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showDirect (cyclomatic 15, cognitive 20): showDirect 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":"src/commands/show.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b1860abbdaf642b76e0ee032a8039105901e0d5f7575eaa25f3932a625c6bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertGlobDirectoryTraversal (cyclomatic 15, cognitive 19): assertGlobDirectoryTraversal has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5451acda1bdcca57fafe3393386ffe220da64b3b3b788fa8289b45a95db1199c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3985d3412a0746c12d6cd05236a3fb7249e0d6c39f312a9b313f75db69c83f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractRequirementsSection (cyclomatic 15, cognitive 17): extractRequirementsSection has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d75fc6b27b1750ec7cc95bb4a074fdb1d8a55adfa94d7806425acec9819de2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printStatusText (cyclomatic 15, cognitive 16): printStatusText has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/status.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"617d1545cd318e97b996e9bfab6e9545e1336b0f1b964668ae07bb8f08ece9f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listSchemas (cyclomatic 14, cognitive 35): listSchemas has cyclomatic complexity 14 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":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c19763ccb61fc5077bc940f8595b17ef96302cf1527e2a2c2f6539913c9aa24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectStore (cyclomatic 14, cognitive 34): inspectStore has cyclomatic complexity 14 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"026ea81509a49f9a4a080981c48e6e75aad7c7359e19e14b58409eeee07d036d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSpecDiffs (cyclomatic 14, cognitive 28): collectSpecDiffs has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"72436ebe4f29d643f3f6c5d1c6a72e73de74e2d48252a734286c0ea8c5975ec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findFirstListItemLine (cyclomatic 14, cognitive 23): findFirstListItemLine has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/task-checkboxes.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"53224bee5a4d02bac74b93a3e314e4240fcbfc11fcdd36bf35a7a15ed58a98b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSchema (cyclomatic 14, cognitive 17): validateSchema has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"408ce5564fd3fbf2ba75476f343c9bab7c3c2c630a5020da7bc48270cb3620d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 14, cognitive 17): create has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdc2cae8857163347a8722589df5fa26cb860d2d02c5d0f9bc8af55798763d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newChangeCommand (cyclomatic 14, cognitive 14): newChangeCommand has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/new-change.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"18111edca3bf1d2d22b35dac399ce085fcc66fdb5af9ac159e199849bf4dba9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectKnownPackageManager (cyclomatic 14, cognitive 12): detectKnownPackageManager has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/version-check.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"12221f432e3d86ff5806fc24548580638c92f71a1efbd84182f3b7b436ac2434"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 27): (anonymous) has cyclomatic complexity 13 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/spec-discovery.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fcacca462eb6f504751a12f3b8a430a16b86a6af3b6a4838be9b3c56b1fb70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectLegacySlashCommands (cyclomatic 13, cognitive 26): detectLegacySlashCommands has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbb90918a5465fa6d66c65951001ddf2063d4e3117127267bea3a7763057e4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printReport (cyclomatic 13, cognitive 21): printReport has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b205e923f0e06dfc8a79ada64e78146c75fb40f700c2169541d14aef43f7ce7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeInteractively (cyclomatic 13, cognitive 21): composeInteractively has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset-prompts.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef66925f54439c74973cf347e77cc144054a6851b464446cb58449699e14510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function migrateSkillDirs (cyclomatic 13, cognitive 21): migrateSkillDirs has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3bafea68dce41195d1dc8b76458894d740bb2830bd2550f320db26104a65ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstall (cyclomatic 13, cognitive 20): uninstall has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183ec6dfdc8c58666f8a32523f906fa4bc51af64452daf7875357402f1ff13d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 13, cognitive 16): install has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a885f0f30977ce9dacaa024581c07e893cdf9eac33bb2db8776fd98024d1328"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadChangeContext (cyclomatic 13, cognitive 15): loadChangeContext 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":"src/core/artifact-graph/instruction-loader.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5f5beadc6535e7cd63441682109a18c94411111a350c781a2d9f48d616415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSelectedTools (cyclomatic 13, cognitive 15): getSelectedTools 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":"src/core/init.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea7e2d8cb401f6d7c799bf5d8c6875d3beb1b81e92778fd9bb3b44c2801a8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeMarkerBlock (cyclomatic 13, cognitive 11): removeMarkerBlock 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":"src/utils/file-system.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae031888cf31663fa357e70749bede2eb346ad5676373351652efe670b73a2ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configureProfile (cyclomatic 12, cognitive 24): configureProfile has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"789de9179f17e62bccab03e540e7f26f67a48aadcb575cf9c8f5c5eb22bf5a97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 12, cognitive 22): validate has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17e7733cf15735626abb5770fd6660b90a628eb21e50746a4d3bb3a20dd5d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dfab9b39c7ddc38ab6e72eb4fbe3a16162c8192ad79b8c4e533fe49805852e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanUpRetiredTools (cyclomatic 12, cognitive 21): cleanUpRetiredTools has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/retired-tools.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c126348508863486b4b9e3d0055acf4004b63584eaefb8111cfdd5d2f0794bfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUnappliedContent (cyclomatic 12, cognitive 20): findUnappliedContent 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":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a864102b1c93a5de9a804c4fea576672ead8045559473921cadfbd22be27d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findStaleReleasedFiles (cyclomatic 12, cognitive 20): findStaleReleasedFiles 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":"src/core/released-output-sweep.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13942bc3ce1914523e961a1c22303f02a11cd95b57d3ee831367810251099c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMainSpecStructureIssues (cyclomatic 12, cognitive 19): findMainSpecStructureIssues has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/spec-structure.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4fda2de43db30a412c3bd7efadb492b4381b8413ce9f5ad0b1c23333d6b19f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 12, cognitive 16): show has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/spec.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"102022d402489cb7daabad77aca002c2aab6e09a0cbe0d6e730daafce2ef4fdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDirectItem (cyclomatic 12, cognitive 16): validateDirectItem has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3c3ce8926a98507ff7cdc559056720db3ab1141cb3996cacc9540b91e78a7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectOpenSpecRoot (cyclomatic 12, cognitive 15): inspectOpenSpecRoot 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":"src/core/openspec-root.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49c7b2d2fdd73926344e936b0f49cc69af79e23c74a4eb5e3d139e4e1bd6f6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolSpecificPathsForTool (cyclomatic 12, cognitive 15): toolSpecificPathsForTool 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":"src/core/released-output-sweep.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a31940d24b7f6261d5458f72dbe58e3f95a257efffa49af71552fc0c264110"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateConfigKeyPath (cyclomatic 12, cognitive 14): validateConfigKeyPath 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":"src/core/config-schema.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d54437973dae73c56fd89b82ac841f5b6b5d92c7f966726430ca781c52fdb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatDetectionSummary (cyclomatic 12, cognitive 14): formatDetectionSummary 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":"src/core/legacy-cleanup.ts"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e006add7e8853bc2713d568dc9a85e144eebee5c1189c481d949bb3abbe9ac94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configSetCommand (cyclomatic 12, cognitive 13): configSetCommand has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0843e315b74592ece7dfeaae63abecb3f0bd9f3e90f9ba04400d9a21e4441140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveToolsArg (cyclomatic 12, cognitive 13): resolveToolsArg has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98242e7f9ab8601b258449811a7cc1aa79d2b9dc8ee836bc16abea4c94f26ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee487e3b6f4a00b524104ea20b975d10ccedcd0e0e8aa55bbc48822bd0fb9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOpenSpecRoot (cyclomatic 12, cognitive 12): resolveOpenSpecRoot has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/root-selection.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"182a02d0f131823fe3d90089f1f51fc603ed75a6a003d378ea9bc33e30443849"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSetupInput (cyclomatic 12, cognitive 10): resolveSetupInput 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":"src/commands/store.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f47156b8f4764b896f5f226ddd2998fdeea046d1ebb5162db63a5df1102bb6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireFileLock (cyclomatic 11, cognitive 23): acquireFileLock has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/file-state.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd987523f009919a53375adf03f85e3c015a16209f108e61cfb2c52cede29a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNearestOrDeclaredRoot (cyclomatic 11, cognitive 19): resolveNearestOrDeclaredRoot has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/root-selection.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec6b563e3499d5bc0412be2d079767c669ce85d7de38288b252334da4c25f3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeUnselectedSkillDirs (cyclomatic 11, cognitive 19): removeUnselectedSkillDirs has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c42ef6919bd266e0f1da6da6ad7aecdd50d7254117fcfdf256a42c9915a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChangeName (cyclomatic 11, cognitive 17): validateChangeName has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-utils.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72289806df2731382ce1ac1ef4cdbd60642a03d8f0a8cbafd4293f33e6405c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDefaultConfigUpdate (cyclomatic 11, cognitive 15): prepareDefaultConfigUpdate 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":"src/commands/schema.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36fc61cb44f05248d0236937fdc5a9595d059005b407660d92fdb3826816a52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fingerprintPath (cyclomatic 11, cognitive 15): fingerprintPath 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":"src/core/archive.ts"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"0355e88984c15ee6b9ce51f76de3c9fba531f563bfd93673073af4d17242e516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isWithinFolder (cyclomatic 11, cognitive 15): isWithinFolder 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":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dc892bbd388312a53582944bc77cf56a2b564f6a4a2191f7f33ee47f410540"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configEditCommand (cyclomatic 11, cognitive 14): configEditCommand 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":"src/commands/config.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3036636aec9c60c366b1607ae29d40e4231b2adfc3cd56edaebe57c37e6b50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 11, cognitive 14): install 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":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b438bef4e5e41bb5bf5b76b145bc609cb75638f9278d94548d74b56ca2ca864"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyCleanupDeletesOnlyReleasedOutput (cyclomatic 11, cognitive 14): legacyCleanupDeletesOnlyReleasedOutput 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":"src/core/legacy-cleanup.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba0e0aa7d7ba37bd4eeecd62bd8b20262b5c081960f39ac5853d5ab92e5037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createChange (cyclomatic 11, cognitive 12): createChange 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":"src/utils/change-utils.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8453860f48fff206aba5630eae4e159dc5084e0176e55f4c5efc78ba6a5fd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isMarkerOnOwnLine (cyclomatic 11, cognitive 10): isMarkerOnOwnLine 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":"src/utils/file-system.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9bcf648486f231b98ef51819b49514ad1694388d8d51c883743e0a24f5e33c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/archive.ts: 2307 lines of code: src/core/archive.ts has 2307 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"943944fc4485acb24042802d2732b6f9fd8febe9efea20653f109eeb9e44e063"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/update.ts: 1574 lines of code: src/core/update.ts has 1574 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb154041da80f53d0d7f5a029396c3f13500e1ff9e0fc3160a9029e141aef2ed"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/specs-apply.ts: 1357 lines of code: src/core/specs-apply.ts has 1357 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/specs-apply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a91577c73635e561e1ec7b17e0818594fa88378a7a99850822c611d4bda4eb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/schema.ts: 1316 lines of code: src/commands/schema.ts has 1316 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc1b8c8357bff3c111b4a97eaf95b4825bc9cacadbe6137e111dcd771e6001b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/init.ts: 1289 lines of code: src/core/init.ts has 1289 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1d42984cbfb25cafa04fb24c96144dd666cc514ae3092f9952004827a1d24d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/legacy-cleanup.ts: 1241 lines of code: src/core/legacy-cleanup.ts has 1241 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a6ef53fbbc35e9960953e27e053f85f729dd1588332d0f5bffe349aaea9ac1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/store/operations.ts: 1143 lines of code: src/core/store/operations.ts has 1143 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cad1506ecf7fa975843bd7f2aed99662ee587025920b8575c51fc1342d1d04"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/validation/validator.ts: 1074 lines of code: src/core/validation/validator.ts has 1074 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/validation/validator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"012749ec7895c0d582de800d5291bb4696b3df1b8b7b81a581a8bd10851d4c32"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/version-check.ts: 975 lines of code: src/core/version-check.ts has 975 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/version-check.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be853ed3182f075ed5af5dfbf404acd8ff78e6677d01c384a3d7a022f2052f9e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/index.ts: 843 lines of code: src/cli/index.ts has 843 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda8594d3172bf0eec86772596d3419103cced7c0e0f4231aa3cdd6f9e4f84f1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/workflow/instructions.ts: 829 lines of code: src/commands/workflow/instructions.ts has 829 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workflow/instructions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7d819a3ac1123ad6234f038d8726d5fe516f22795965b36282ff9b32407754"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/parsers/requirement-blocks.ts: 753 lines of code: src/core/parsers/requirement-blocks.ts has 753 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/requirement-blocks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb43767a9a8653f385db34c63530d0f0088001d37225c21ea57d53cb587400a1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/validate.ts: 712 lines of code: src/commands/validate.ts has 712 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba4b276d75586de99a6fbaed07ac2a50b302af767252092df8b2de9022ce8f8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/migration.ts: 656 lines of code: src/core/migration.ts has 656 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1b52298ae847f05a982ea434cf02eea957090fb21fcb80cfda327c3a5d650"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/config.ts: 643 lines of code: src/commands/config.ts has 643 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21c0113ae7b4a4d0ba39ef85f117292bfdb3216c74791b40908baad0542ebf9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/project-config.ts: 611 lines of code: src/core/project-config.ts has 611 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/project-config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5f3f46eefadda16af1e77c7f7998c0dedc80e1bbf761526778f9fa5e766752"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/root-selection.ts: 573 lines of code: src/core/root-selection.ts has 573 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/root-selection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b72cd6ffa06427ab9a830f67bce78ac7dd2f4404b88623800bbe09c85c2382e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/store.ts: 569 lines of code: src/commands/store.ts has 569 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec31abe10598d8d7c08d4786d4a97e83215dfb206af29eb9c1fa52f72938222"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/github-copilot/cloud-agent.ts: 564 lines of code: src/core/github-copilot/cloud-agent.ts has 564 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/github-copilot/cloud-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2cc174f3bda2a122ef25e6833a032d4487b1c784aedb22bec1481af2b1c3c3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/change.ts: 546 lines of code: src/commands/change.ts has 546 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/change.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8866bc18c026223c6cf3b8aed7c0c4b710ea22790323220006aefd77f5e9f2a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/artifact-graph/instruction-loader.ts: 526 lines of code: src/core/artifact-graph/instruction-loader.ts has 526 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/instruction-loader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18be78816f7cbc2788f155dbf594aea57e30270e0912d927520047b8e195b166"}},{"ruleId":"R3","level":"warning","message":{"text":"src/commands/workset.ts: 497 lines of code: src/commands/workset.ts has 497 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/workset.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9ccde06ae719677d7fffd86802bbb410d4f9a9d7cc7c1de68e45ce907dccc1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/update-plan.ts: 495 lines of code: src/core/update-plan.ts has 495 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df2af0fb32295d6794cb0b37223839dc73f9c355bb73baa907274c752c6b93c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/shared/shared-skill-install.ts: 491 lines of code: src/core/shared/shared-skill-install.ts has 491 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1636a32c84ad013dc4be1e92a912332418823da0a47645d058f5d8b743aec3dd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/completions/installers/zsh-installer.ts: 486 lines of code: src/core/completions/installers/zsh-installer.ts has 486 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59c5a10b212cfb2e2df9e388c5a91f8372b01182b12a205f0f2afe2c1305806"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/references.ts: 469 lines of code: src/core/references.ts has 469 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84408bd8dabbace0e1dc03248f1726cacce6ed7e08ca01a0c90d717107544a0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/utils/file-system.ts: 450 lines of code: src/utils/file-system.ts has 450 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/file-system.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df86288c54be82184e75f4e47f2f1ed0e799076a3a19d82926eae56b827196d9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/completions/installers/powershell-installer.ts: 417 lines of code: src/core/completions/installers/powershell-installer.ts has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"247f1e6b2dbf53142feb1678633eca24f88216d344c0fe2d446a727aef6b00f0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/store/registry.ts: 414 lines of code: src/core/store/registry.ts has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3134cc1ff34f34991d0fd49b22f457bc6a063acda6433a7942025fea7d4d17ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/fish-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e5d6a59c2182c7650fa02146eec797d606a3d6b5ba0caf5744203485ed1f4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/zsh-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea35c43a0c56fb8a7d541c021c08c32125f279a342d6404d15af2e7df1370d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/powershell-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103967ca26a330a61788ed53329b059af8a2794f083ab7297d2273ffdef35ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/bash-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8007e372bdba38f6edff31911fa0410782555bff90a19ea8c2efc14bf00e53"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~143 LoC): no import path from any entry point (56 application, 10 tooling, 254 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/fish-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafa08f8d51ce5c5b75e09e45132eb2d29425f22af59f463fd19a38335921031"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (56 application, 10 tooling, 254 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/zsh-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1877ea9cf00cf1fa5a55dccdb2861d1f8aae41defdc2f352fda60995428d275d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (56 application, 10 tooling, 254 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/powershell-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4049df12a85b343e6ec8f9ce044b3e192b6daa6bf614c8470b813bdb489a4d41"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (56 application, 10 tooling, 254 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/templates/bash-templates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a0fe70206bd06998c494054a5376e6491023bd8129890fcf0736e057163e9d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (56 application, 10 tooling, 254 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86b936dfd4d31f03f98ffe3ffe70d578e21f47da8ad009463c57d8191008cd9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (56 application, 10 tooling, 254 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/templates/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e2d12626de18ef9489a4fd926c3bae932f2ff75a03f4d60c3dd2b26353b3d4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ApplyPhase\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/types.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0511bc047a553b27727e2749e1068e2fed6904856ffe83775b6ae13eb1658574"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027InitiativeLink\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/core/change-metadata/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/core/change-metadata/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/change-metadata/schema.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b111ba494e02729937db66391814b30914f0d168ebb0eae57e88b286ff1a19"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ChangeMetadataKnownKey\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/core/change-metadata/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/core/change-metadata/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/change-metadata/schema.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"468d331c116ad0e03bab9d764fb4395eacf55038f2731013e9f2d1b456b625f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpenSpecConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/config.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861a51306ae2da685af857ecb903e9ef973d760f3a1422dd3fe6161dcbecc26"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CoreWorkflowId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/profiles.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"318d6edf4050bf35c504e8b4c3c6b85ed59769af46a2c37ea1dcec9664bd511f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GIT_REPO_LOCATION_ENV_VARS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/git.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b2b7a5cc6448cec6cfa301fd20642f51d9734df125f2bdefee1b7e29307393"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SkipSpecsMarker\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-metadata.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca33b5fc4ebe0df2774fe5c44f06a2d7dafea4e47d8eacec1c240eace63dbfe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027cacheTTLMs\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/completion-provider.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df07626e95787f4a354fafe2d7709f29d6b36fad89cea27d1d5a331dceda437"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027PROFILE_MARKERS\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f681a12c4b4c0e5b58ad573b90818a2aac5a2a6be2838de563180da95bf2873"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027generateProfileConfig\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/powershell-installer.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7216aff80e3f9bf0482ece2f0b7a59622a998461234734cc5f398fe576757c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DeltaSection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c297be43f7a3ea5ea35044e0b2f8037d5199a8c6e174861b68b3bbc71ecb38"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027currentLine\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/markdown-parser.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff85f61689930f53270f70d75128b60a4e9ed56bcab9a7f12347ff937891fe72"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060createPreviewServer(\u2026).listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/scripts/preview.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3d18aa33e83141d9b0ea5687a3d00e808c6120fce4fff35520e835e4e36d94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.includes(\u0027$@\u0027) || body.includes(\u0027$ARGUMENTS\u0027)\u0060 appears character-identically in 2 files \u2014 src/core/command-generation/adapters/oh-my-pi.ts, src/core/command-generation/adapters/pi.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/command-generation/adapters/oh-my-pi.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd02fe8198896ffe2b50b86333ad36a088bc52dcdb622d0017b994ce0bd21a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isDirectory() \u0026\u0026 !entry.name.startsWith(\u0027.\u0027)\u0060 appears character-identically in 4 files \u2014 src/commands/validate.ts, src/core/list.ts, src/utils/item-discovery.ts, src/utils/nested-change.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/validate.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b1b98d6d588e0a4dafaafec7d47406b248d5c7d3093d3d95a43ceb9b4971b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isDirectory() \u0026\u0026 entry.name !== \u0027archive\u0027\u0060 appears character-identically in 3 files \u2014 src/core/archive.ts, src/core/list.ts, src/core/view.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f36a641906957269cd7b75499774d27da2bd56fad2fa2b9ef91224cff06dc94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060headerMatch \u0026\u0026 headerMatch[1].length \u003C= currentLevel\u0060 appears character-identically in 2 files \u2014 src/core/parsers/change-parser.ts, src/core/parsers/markdown-parser.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9d654ac880bc3da23cc6523c8f7c83b52fbbf8ed88e443fe39953ae665fd86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.remote !== undefined \u0026\u0026 input.remote.length === 0\u0060 appears character-identically in 2 files \u2014 src/core/store/foundation.ts, src/core/store/operations.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/store/foundation.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"255e0cbf7ed3a6583fac3209242a5604c6ec452e408d07228e394e519d3f90ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parts[i] === \u0027specs\u0027 || parts[i] === \u0027changes\u0027\u0060 appears character-identically in 2 files \u2014 src/core/converters/json-converter.ts, src/core/validation/validator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/converters/json-converter.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"273c7c22034eca1a99fac4c472a61fa716b5cfc5973dff0d8813054dce9e0340"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stack.length \u003E 0 \u0026\u0026 stack[stack.length - 1].level \u003E= level\u0060 appears character-identically in 2 files \u2014 src/core/parsers/change-parser.ts, src/core/parsers/markdown-parser.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fec0869d29cad5a3e55aaa67413d44e01b5c3ba6f14de810a5fcdb39b6516b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startIndex === -1 || endIndex === -1 || endIndex \u003C startIndex\u0060 appears character-identically in 2 files \u2014 src/core/completions/installers/bash-installer.ts, src/core/completions/installers/zsh-installer.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7cae0027f093118f79c53cfa76589243851047004913e3790a115497c47f46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startIndex === -1 || endIndex === -1 || endIndex \u003C= startIndex\u0060 appears character-identically in 2 files \u2014 src/core/legacy-cleanup.ts, src/utils/file-system.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d741279623b9bd57e952264c2870016a9dad01011419fd10d76d65417037f98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startIndex === 0 \u0026\u0026 lines.length \u003E 0 \u0026\u0026 lines[0].trim() === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/core/completions/installers/bash-installer.ts, src/core/completions/installers/zsh-installer.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a546c7dccc0c7f96da2f42f13e7ca0909020c2af64f92696d9ff8e3dad43a52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.findSection(sections, \u0027What Changes\u0027)?.content || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/core/parsers/change-parser.ts, src/core/parsers/markdown-parser.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f721990de8968299aad1c86c8d262a4334079c4cf9bfce588d5d179994b4b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.findSection(sections, \u0027Why\u0027)?.content || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 src/core/parsers/change-parser.ts, src/core/parsers/markdown-parser.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parsers/change-parser.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2eab7ac1c6f6c4049a5caea5610985b356dc5b3aca65393ff87cdde47f3e46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof error === \u0027object\u0027 \u0026\u0026 error !== null \u0026\u0026 \u0027code\u0027 in error \u0026\u0026 (error as NodeJS.ErrnoException).code === \u0027ENOENT\u0027\u0060 appears character-identically in 5 files \u2014 src/core/archive.ts, src/core/list.ts, src/core/openspec-root.ts, src/core/store/git.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"285cdc6db4a9ebfb248c368e71086c9876b820e0a1eb3c33e497db490553a51f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060view.linkTarget?.(skillDir) !== undefined || view.linkTarget?.(path.join(skillDir, \u0027SKILL.md\u0027)) !== undefined\u0060 appears character-identically in 2 files \u2014 src/core/shared/own-skill-texts.ts, src/core/shared/shared-skill-install.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/own-skill-texts.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"312553aa2fea62a3a6603af2df5ad4abd69a460d35864799262213c82c6a423a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060formatValueYaml\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 319 (\u0060formatValueYaml\u0060) with a piece of \u0060value\u0060 (and at line 329) \u2014 and nowhere in \u0060formatValueYaml\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 \u0060formatValueYaml\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/config-schema.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27b160494cd648a6580cd22ecd4ced0cfb055cc0feb9bd7c5f9b607bbcac88b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-metadata.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e315acae2e65338fbd12a13572103361c016a36e96a4a916a8927b82163b13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/executable-path.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef4b29674b91e39ff544521d16f8993501fbafa8ed414df65c3a417b81f5429"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/welcome-screen.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f1ea1677e6f7df4bd1346af8669edc8c5362841de4edfe571db542ad8a3493"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/config.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee354b2f8a5b07bad627773c740f3c11f17c7b760b9bc7c5f25eee7ddac2f87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d01c859b861ad44bcf575319c343ecdcce267e6a75c2a3d9d54106bd9985f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3486a63e1d1493389f226c00030880a1f453e88af4fa3f7144979d9809fc6533"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70b6f09c68a9a149bcca16e724020a8a028b2311d962a870f40998a10ccf0ec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/telemetry/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b4026dde2a3d00b3537bdd316013579f3681f046713a7a6cef71ba02b7b26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"96000a176b19eb8f3409e714b111d28f7acf85972362b3227631a3cdafb23386"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bec14e4c90c39c552842202f7fcbc9c7bd648b42ed1fa142c69c4560a13fff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/archive.ts"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52cbc948c083092a56d627f7addbe9775ecd69499c9fae3a281aee6f1430d36"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completion-tip.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b58f114c67b9ddaff8ac02b26bfc8217ef73f3c9221f1226f3ce7b841e539c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/file-state.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1f68466444ef0207aa9949b716a348b27d53a97c4e4a470860979a733cc7e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/global-config.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e4efd4629c7f76b725ebb0ac3c86b9e1082ec0148055d82c7781a712c0aaaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c38faf5e1f155ddd9f971d0175d1d28641aefa85ee0470b5133360e8b793c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/init.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f54b5f83e15c073cbf49288c908c4156a48325496c37d21817fc2c963da7905"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ad5e9bc51976cfdabc1a60b15d1f68bf0bc90a2bf9a47ad21fcfc863d33d9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a853377b5ca4e63a90f9a0716a79b68780810b2cd12a87bf3b3bc81c49e13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/legacy-cleanup.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d89b975d97e9155b6ed162e7f68581998751afbf26349f5ce6affe1c2467302"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1e6a4c17a88da5482608d3af05f7541618b94d1b87ddf4436df03164a7e32d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0585243c104b4edaf30b6fd13aba78efde7f508f2c160d70afcc7b3d4c2aba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/migration.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c9a215631bf14d2913b85b2219a22278c8a95a23728a5ae2bea9f1835eb203"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/references.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ff85f2be04dab364f6b61ba2a1cb6cc9134760dc808d3ba6bb39ec307abd1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/released-output-sweep.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1383d1134f78d3c5b245526666af8a1e1dd6bc210637412bddb59e837d4ffd"}},{"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":"src/core/released-output-sweep.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"053a09b3e4a779ae1a96bb7bc820383590270fcb6f8ab7cded4570e0a2a24d47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared-skill-target.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1c8df575e7144269f5644fb2387aec6df8933c8802db5bdf4b67cc521c5a9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/standalone-tip.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a76192a45cf18559464530629b186970241d01178baa2e715559b9bfd2381fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"02106a0f7e3b5bc1e0e6d0d9569c66b164aa5639caee2c6df7dc942743649b71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed220ca1a38eb7c8b20f8df64541306871dbed5a94f258c279c0c5582c35e45c"}},{"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":"src/core/update.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f55f4ff76efb483503db32d2e196a7c19b0be111c598bd7825e4b2538dd571f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba3e633b7ccfcec9523be804621db5d55f0a840e4049d9603aed7f545721b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"436e60d32b787a21782fd8b8fb06ab6a80f87f9d7843b2fadcef8db0cc5bc726"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/version-check.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4ae8e6e08292e54e237efaf58eed133a8a351d480d799d1bfd2bce611e886"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/version-check.ts"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f763416da3e73b55483becb8f8589690be40d2a0ce5d7156f5188aaddf5c9"}},{"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":"src/core/validation/validator.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"002317728c9044ebf04a21932adddcc5395bf8a657be18dbe9ec5896707c26db"}},{"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":"src/core/shared/command-reconcile.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8475d3ace70efdbc95e6da95dbd409176a981225d1615b9b10beaf5549921e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04b76b0779fad4fc9c6fa4dfe569536a658c30c39798e57ef8b3256df1fdb67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1ec11006cd29c0015b45796371b76397878fe8a94a0470a0708bf1b904022"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared/shared-skill-install.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fe7725afc8852da6003db88f026667c04697cf8398bdb8a3cbf6fd3c3e2ef7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (error)\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":"src/core/parsers/change-parser.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1f36223ace256558dacd6054e735a9e4406a7a10152903f5dea6c4b0bc3f1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/bash-installer.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e17f3435de11bf31bba41cb09d8c408925bdd5e3da33519edd03f42bc3127d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/completions/installers/zsh-installer.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cd495b33967e10c27949f3725d57be447cb7a9de715778eba8450b23809908"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/instruction-loader.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a926caaf5b1708115bca8d8b968e358f727e67d5140cf6cd19fce1912062854c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e09e2afb5a8d5724eb877147d153bb17aecdc9b4424d50bd54546bf285b998"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"66966161c984f9bb09fe43301381b2cd5d322e7508f5ff085c83fdde8ede7de2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/resolver.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45a858576d88295ca405f0a2b945793f5e79898928cb49b233ef036e316fbf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/config.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"152b94c6497ef563ea331228362c127b8f29390dbddeeea48abe1e65aceafde8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e5dc1a66d5b5a0117fe94a0d2bd90146e2ab0c4af372914567ec769b269092"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d706c02f0935d52a95c94e466b913a4c4e67f8ed620858b93e6a5c95b45fdb1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1cbf1d16aeb07f3fc4e49e401bb073591b68b986b18c5aadc2470507b93d96"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/schema.ts"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c528dbd28719664db52d13e792acdb4fed82231160882a604b7c2eee2e4af09"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.9 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 43 assertion(s) across the 46247 source line(s) of the 220 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: src/core/archive.ts (11), website/lib/remark-gfm-alert.ts (6), src/core/legacy-cleanup.ts (5). 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: \u0060readListFileTools\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/shared-skill-target.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c57003f5dec4f72bdd7e9617f2a511b69907abdfb78f439abcc17162a277da6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listFilesRecursively\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update-plan.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceb70791cdaebfb28d8a57e45d8f497dedc6ecdc1ccc7f60b6cd56f73b6bfa7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060findToolsWithDriftedSkills\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/update.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff7d131d2a97e79321c5c0a6cfc92ca84f9b3870250c0831923c08e94956195"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getActiveChangeIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/item-discovery.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf3bad41cef9feeec10f7c1a2c3fbe9b58a0fb261fb72c674eb64c851085a0f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getArchivedChangeIds\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/item-discovery.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0280062e03c580231fa3eebe44dd478e4315bf36284d4ce20173ec75a7d0ec0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readUnknownChangeMetadataKeys\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/change-metadata.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8563c99a858e144948bb3bf526984b6506ee334a76bf7a43d2ac00d9bff278f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveArtifactOutputs\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/artifact-graph/outputs.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad39951cfd7e0aaba75f87a67392378d8f744a059af8599673672a48ee826d44"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getVersion\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands/feedback.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2514f0cc602ac5242cd98a04b1c0366240708853ee7071d6273ce133546e873d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-755","guid":"ac8136dd-f77c-1c5e-bdcc-3905bbad9bd9","name":"Improper Handling of Exceptional Conditions","shortDescription":{"text":"Improper Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/755.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"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":21,"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."]}]}