{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"Parser.line (cyclomatic 45): Parser.line has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8134d6c1abcae25a218f463a3e51e54a572527bb6fda80765d6fde1e9b910f31"}},{"ruleId":"D1","level":"warning","message":{"text":"expanded.expandedLines (cyclomatic 33): expanded.expandedLines 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/render/expanded.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fc089c38c7913e02bf6d5bdc67970cb6a91f0d3ea1d5d173ed816ef83242d9"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.usageParts (cyclomatic 30): usage.usageParts has cyclomatic complexity 30 (threshold 15). Of this number, 28 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/render/usage.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e8602f23e58fcd4e6fb599c9e7b04f3b0441e90bc6e4b7da6cae682e23c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"vcs.vcsPart (cyclomatic 29): vcs.vcsPart 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/render/vcs.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8648f93b31a0022a2c2c0257f5a3ce5a47e079f0f3ac0acbc12a6aac9d5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ans2html.ans2html::sgr (cyclomatic 28): ans2html.ans2html::sgr has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/ans2html.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3b56da42ca3680db7d94061747ad840d3905b8bbcb361018aee71a5b89ffb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.toolUse (cyclomatic 26): Parser.toolUse 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/transcript.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a205a9856cba68da6cb125ce96630ea8ca1e96bb1e231a807b9c47d214c5b985"}},{"ruleId":"D1","level":"warning","message":{"text":"createProbes (cyclomatic 24): createProbes has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 15 function items inside it that branch (git, jj, usage.target, \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":"collector.mjs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb8a1fb862d8a24101006baedd67c46632a4ea0c3fc86ca4a99a721cc58026d"}},{"ruleId":"D1","level":"warning","message":{"text":"ansi.isWide (cyclomatic 23): ansi.isWide has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/ansi.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d7d721af38472b99f0f3e853317f2fb00fec3e9e72ce6d08746caea38e989e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.renderStdin (cyclomatic 23): main.renderStdin has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/main.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8897974381a3da315d4609fc92071c30c962e4b045df6b0be7b22448ae155e"}},{"ruleId":"D1","level":"warning","message":{"text":"runCage (cyclomatic 23): runCage has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 209, a function literal at line 238, a function literal at line 181, \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":"hud.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47043da3ce5ef3eee354c510faf915b03f084714240ed8eb67c4cb826f077d"}},{"ruleId":"D1","level":"warning","message":{"text":"valid (cyclomatic 23): valid has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a5137de340d2041f85136688c038c4126745a0d097a26f3681afe7d2055b10"}},{"ruleId":"D1","level":"warning","message":{"text":"daily-cost.updateLedger (cyclomatic 21): daily-cost.updateLedger 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/daily-cost.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3db541ee5bd61f9552138ea62b654c0b2f3fb75590297f63eccc7fcb06511c"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.findRuntimes (cyclomatic 20): collector.findRuntimes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e27bf5f8643b0d73622e32bceb027f479c609d5d13c6bd2cae0ca7c1dc0905d"}},{"ruleId":"D1","level":"warning","message":{"text":"daily-cost.readLedger (cyclomatic 18): daily-cost.readLedger 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/daily-cost.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c47a4bf7b6cd0357bbb91a7dcb74a171dba25a9c4050df4fbf30da5d0ce7c83"}},{"ruleId":"D1","level":"warning","message":{"text":"act.inspect (cyclomatic 17): act.inspect has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"531fee759e55ac008271e82df59908a74e65cd20e5b1a14d756ea06f69c1eafd"}},{"ruleId":"D1","level":"warning","message":{"text":"act.gate (cyclomatic 17): act.gate has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5418bbd9d34865e774b839a614697debebdeac30b43f3e2171eaa9ad78fad623"}},{"ruleId":"D1","level":"warning","message":{"text":"case.validateCase (cyclomatic 17): case.validateCase 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":"verify/case.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e1f68f667369e2106a0a089537689beafb61013e53c739c5a8d4d2b91485ed"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.formatWindow (cyclomatic 16): usage.formatWindow 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/render/usage.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b39eba6a9884b9ac105359d0481f0872d0cedc285c1108f8d20155077d1077d"}},{"ruleId":"D1","level":"warning","message":{"text":"external-usage.getUsageFromExternalSnapshot (cyclomatic 16): external-usage.getUsageFromExternalSnapshot has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/external-usage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"07564b6452b68ac1753477da7b290b85c436184114517313084c4e6026e37a5e"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.doctor (cyclomatic 16): commands.doctor 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/commands.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0523ed5cb926728cd2da4c30f0a1ba787de27216c2230429eff3d4e94134bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.toolUse (cognitive 53): Parser.toolUse has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 5 (13 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 27). Of this number, 46 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/transcript.ts holds 2 of the 24 methods over the threshold \u2014 including the worst \u2014 and 70 of the 269 points over it (26%), 2.1\u00D7 the next-largest file (src/render/expanded.ts at 33). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"02957f14d449394d403715a59a803bd54b419bb09444f4d0d8aabab10304dc96"}},{"ruleId":"D2","level":"warning","message":{"text":"expanded.expandedLines (cognitive 48): expanded.expandedLines has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (9 pts), boolean chains 8, ternaries 4 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/expanded.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa3602e87d5f6c047a73f8ec7b3f5e77e2a3bd621c8d216d112244926b4a45a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.line (cognitive 47): Parser.line has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 16, ternaries 4 (5 pts), loops 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/transcript.ts holds 2 of the 24 methods over the threshold \u2014 including the worst \u2014 and 70 of the 269 points over it (26%), 2.1\u00D7 the next-largest file (src/render/expanded.ts at 33). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86880d59bfe26c95ddb01e739eabc52097f7d7dd7031cd98061cbc6478b263f"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.usageParts (cognitive 39): usage.usageParts has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (23 pts), boolean chains 8, if/else 8 (nesting depth added 11). Of this number, 37 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/usage.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4537a5faca5170d4fb7c076b92f788fb2cde3ec2850c4bc74e0985e6f217ccab"}},{"ruleId":"D2","level":"warning","message":{"text":"vcs.vcsPart (cognitive 37): vcs.vcsPart has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 7 (11 pts), boolean chains 7 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/vcs.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6564216903552d18cd9f093f67d14f1ceb9d4eb64b7c93afcfbb0cc7314a440"}},{"ruleId":"D2","level":"warning","message":{"text":"ans2html.ans2html::sgr (cognitive 32): ans2html.ans2html::sgr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/ans2html.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1218606f11d3902f3e1a81d199a28e64c30e988678b949be4ae94d533ab48c14"}},{"ruleId":"D2","level":"warning","message":{"text":"runCage (cognitive 30): runCage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), error handling 3 (6 pts), ternaries 5, boolean chains 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 5 of the 30 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 209, (anonymous)::settle, a function literal at line 238, \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":"hud.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"313efebd86c979fcc56e0241e48d6365020865e12c52795ec818e5863f32a9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.findRuntimes (cognitive 27): collector.findRuntimes has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (8 pts), ternaries 3 (5 pts), loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"013679e89f807c3ed6cb2212aefe231ecae3c6abef71988c5acd0a2f2e115da1"}},{"ruleId":"D2","level":"warning","message":{"text":"daily-cost.updateLedger (cognitive 27): daily-cost.updateLedger has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 3 (5 pts), ternaries 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c1944cbc2e00af5e0064d54813da9265c129a3223bbdbacf6c3ff66e2747cd"}},{"ruleId":"D2","level":"warning","message":{"text":"createProbes (cognitive 24): createProbes has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (9 pts), if/else 6, boolean chains 4, other 3, error handling 2 (nesting depth added 1). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 15 function items inside it that branch (git, jj, usage.target, \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":"collector.mjs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"973bcd2f469059b0fae9fc4d971ec8c239102aa698cd66eb43f4b3842d7bcb38"}},{"ruleId":"D2","level":"warning","message":{"text":"case.validateCase (cognitive 23): case.validateCase has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/case.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"baef07dd21b7b1ece677159b46c181f44de1d6b14e14f01bc13875d6e7180205"}},{"ruleId":"D2","level":"warning","message":{"text":"apply (cognitive 23): apply has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 2 (3 pts), other 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be4c9c7ca97a7f9fe11936c3724c3e78683a2c984dc792cddcdd1f7bd2bfa29"}},{"ruleId":"D2","level":"warning","message":{"text":"main.renderStdin (cognitive 21): main.renderStdin has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, ternaries 8, if/else 4. Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: 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/main.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb38f8eb8e7327954dd56b5c762359bbb1034550bd4735e946bdd41512e1f04b"}},{"ruleId":"D2","level":"warning","message":{"text":"valid (cognitive 21): valid has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 7, other 4. Of this number, 20 points are the body\u0027s own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd0ab580a118183c0b4c1ffb476fe3757519bad755ebe3dcf63797586abceba"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect (cognitive 20): inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 3 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"722e05f16959de654c5fc0286e468a43cbb56f91c517a2327de49f28e387f038"}},{"ruleId":"D2","level":"warning","message":{"text":"daily-cost.withLedgerLock (cognitive 19): daily-cost.withLedgerLock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (6 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"625034ec3e7542f0d702f9b0642753a501ef95fb8d560552b740b29b3052d964"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.formatWindow (cognitive 19): usage.formatWindow has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (13 pts), boolean chains 4, if/else 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/usage.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a205e0d508a4a5ae16fef8d1b7b71a746d84a1e1401eb991c7999a5cb757af8"}},{"ruleId":"D2","level":"warning","message":{"text":"act.gate (cognitive 18): act.gate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b24aa3bc02e7c00f071c1b6d13cdc1d074f3432ef0dadab19db42abca42fe"}},{"ruleId":"D2","level":"warning","message":{"text":"git.getGitStatus (cognitive 18): git.getGitStatus has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4c56c8ac43f69b7dc80bc2d6ab6d59a6fc688d05ddf4e48c2a34e9cbefeebf"}},{"ruleId":"D2","level":"warning","message":{"text":"git.parseStatus (cognitive 17): git.parseStatus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dee3b22519568e45618e20c057ea0dba52900f45b290f0da2e8c80ed866fe43"}},{"ruleId":"D2","level":"warning","message":{"text":"daily-cost.readLedger (cognitive 17): daily-cost.readLedger has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 3 (5 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f1ab5dea30090de61b0c4dbe520b8660eabbcfccafb640df3cbadafdccfbf8"}},{"ruleId":"D2","level":"warning","message":{"text":"config-reader.countConfigs (cognitive 17): config-reader.countConfigs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (6 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config-reader.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57217c4c063314dc3ee070ed5f5c442f4f7709a8f2b6988fb75677e3ea4b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"vcs.gitFilesLine (cognitive 16): vcs.gitFilesLine has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 6, boolean chains 3 (nesting depth added 2). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, 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/render/vcs.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af1330f9528cf21fb90abf66a86a70016357b9f2da7c7d6f56bd43993862abe"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.doctor (cognitive 16): commands.doctor has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 6, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5e9c16d24e94e945feb4b3e96adb112fed62c3f56ab9653a6841c72472d54c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.ts: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb02ec8127eb4a4a0d10336456c301dae7c07b00c508cba051e5a7fb1fecd46a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/commands.ts: 31.6% line coverage (97/307)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9b3cf8cbe989a65a4303ae5ccc1cba6d51cec3f8fc8e1065ce2258d51e2a9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/transcript.ts: src/transcript.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Parser.line at line 146. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 23:24:13 \u002B00:00\u0027 --until=\u00272026-11-10 23:24:13 \u002B00:00\u0027 --full-history --no-merges -- src/transcript.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb59f6ec1c0bb38e5eac54a48ae1b23542f80b3d7917f75ed4be9a35591f264"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/daily-cost.ts: src/daily-cost.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in daily-cost.updateLedger at line 175. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 23:24:13 \u002B00:00\u0027 --until=\u00272026-11-10 23:24:13 \u002B00:00\u0027 --full-history --no-merges -- src/daily-cost.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/daily-cost.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"849015c74584de336bb961efe07bdd904ec10c9387ccc61a584599ec6618bb97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/render/expanded.ts: src/render/expanded.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in expanded.expandedLines at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 23:24:13 \u002B00:00\u0027 --until=\u00272026-11-10 23:24:13 \u002B00:00\u0027 --full-history --no-merges -- src/render/expanded.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/render/expanded.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75bc9e8d5c99bd9dc804b329fc4a2c9532dd600beebe02b48f4f68183837c28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/external-usage.ts: src/external-usage.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in external-usage.getUsageFromExternalSnapshot at line 91. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 23:24:13 \u002B00:00\u0027 --until=\u00272026-11-10 23:24:13 \u002B00:00\u0027 --full-history --no-merges -- src/external-usage.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/external-usage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa7b72d34f9c262945220cfbf9a6e16aeec91aa532ceeb3ad7e24bff52c075"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/git.ts: src/git.ts changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is git.getGitStatus at line 58), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(security): never run commands named in a repository\u0027s own git config\u201D; \u201Cfix(git): read line diffs with diff-index so a timeout can\u0027t leave .git/index.lock\u201D; \u201Cfix(git): count unmerged paths in file stats (#763)\u201D; \u201Cfix(git): decode every escape git puts in a quoted path (#765)\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-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 23:24:13 \u002B00:00\u0027 --until=\u00272026-11-10 23:24:13 \u002B00:00\u0027 --full-history --no-merges -- src/git.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d1a38c61af3d3dda2fdb99f7f03b0d9cc8319175226f9397b3265a4b2f422b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: src/render/expanded.ts, src/render/ansi.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c6697b963462d59ad64b726301a31981e6f40a4e098ec8fe357a5dbd11ccb4da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00222 disabled via disabledMcpjsonServers\u0022 repeats the code it sits on: 3 of its 3 words (disabled, mcpjson, servers) are already in \u0060await writeFile(\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":"tests/config-reader.test.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd2060a46df13c577cb3b8203e7c17248b474c088dc563145b39c8f273e9389"}},{"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":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b15e7c4516957eb0ce628a71875180462280b3da835590c3e3ea26dfe36c7cc0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fed8cda560fb48ec3944af69a6c59b553c127286ff967a3c9137f8168fc3550"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f7d04bd75e70d31dc93b2f35badf6cc400ed9a3380b4a4de218324e5349e4c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"316a71bc9f7cf4614879e2f4ffa7ccf3802c5f15015a1a5c326ec6524fd21e09"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17fd44a6fde483c0afce4da86a87b84e82fbea92131d006070e1c5d1f18c1390"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b26e859c1c481175fefcc44101dd465c94158fe2973383d059a2d1b1d80679a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c0773f73e005df78b78435cf801a89ec77b1f67c97abe780710f225272c46c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d27d80608b2f345bc28b173075f7215a1f0a75fed36e591949f6a3a1f803f31f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a49f8055aff3a098b78ad10d3d1cfbd296d355742f40c1953612541e71f144b1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f94015e26b0dfb9f8c696f0fd0d194afe6599582b169ce916ec341c3fbe2e2ae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee6df835335ef77984388391709ec1d0c03d1810b679c76b1cf93d7762aeedef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9514d22831ee0875a4d06042f665253e4b37ef7f966b3d19c8d7853b9bed7bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6bdceb33986706ca5b6d4108d0fb6695b6a0502ff5d4e7f713fbfaea525badd0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a78a08e6522d7d816bf3c105ad8a4cd35fe486572b774d3a5de4f87cd3809c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1947b63a4a124fb620f3efa03d5a14f34e00edf0863aebc634272866670fb2b7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1338dd5e23e1dd4df3bdb75d13d8a8aa17e3b3dea4bcf395e5ae67e6acf8848a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"108960652920d50253f51b7868924b5282811389011c01932f54c632f5fc78d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0152f92f1fd54b7d6d5dfd154e9aa6c62f031e143b43887ea05eb6c6b07b4136"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5968debf19e23d91b38fe8255607d0503b6903b30ed647d06fe39eb1f385d03a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66467926cb6b9ff5540ed78ca6ff61935ec31081aabb20c9957c55c7bd6c203f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"003ce51eadef44595fddbf66da3274bc2b754d384970d2f484b713e7a791251a"},"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":"552580500666ce00cf194227bc96f174591e1589687c44c634134ea00c4b1f4b"},"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":"c80c93c1c8e44d820b9977798fa5e6d32912587fcc4d15a0ea9f277b0a9d6890"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb1623e296c7615395a0acc5535f7f8dc48bc2c36ce60251284047b786359d7a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e22dac58bca14df8fdbbddbdeead17280372acb088f1e612955736df95d1bbe7"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: en.ts \u2194 zh-Hans.ts: \u0060src/i18n/en.ts\u0060 and \u0060src/i18n/zh-Hans.ts\u0060 change together 100% of the time (12 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060cf0431f4\u0060 feat: add opt-in cache hit rate display (#741); \u0060af7b6e69\u0060 feat(cost): add opt-in weekly cost aligned to the quota window (#762); \u0060b9806818\u0060 fix(i18n): translate the elapsed usage-window suffix (#768) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/i18n/en.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c746598e989bcb723b02b1c2c0fe65aaeb74a78467228872230e9f015a87926b"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"C2","level":"warning","message":{"text":"No authorization: This repository serves requests \u2014 a node:http server routing 6 path(s) by hand (verify/lib/fake-api.mjs:15) \u2014 and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/fake-api.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aea6ffe8c3b4d251ca104ad2e4406cf4fd761c65e17d143ee721239c23e52e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 71 JavaScript/TypeScript production file(s) this check read across 1 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 3 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/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f487c409bd74bef5ba9ffa727d3e9e32c0066b2958ae16a9c2ec16c9c293aa"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/harness.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4984ba97a5ab4efc2c03426efec16f619c5a482fc42bfcc74f845f48e521640a"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/probe.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f952790ab4a6aaf5b556746df53a362506d110fc783af139f34a31d4195f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060runCage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hud.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f249470e84371b5606333f3c41481d43608a8e808e20f372773d4e43137a09"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 49 typed \u00B7 54 plain JS \u2014 the untyped files are collector.mjs, fence.mjs, hud.mjs, install.mjs, maintainer/act.mjs, maintainer/harness.mjs (\u002B48 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/render/compact.ts:25 \u00B7 src/render/expanded.ts:26 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/compact.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"345a1172ee513122e6572128caff8839e4f6abe428636c201518fbef2492da03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/render/colors.ts:174 \u00B7 src/render/colors.ts:190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/colors.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1df4da5d78826090f5a4b8fa5532bfc1aaa0d58de52521e39eb6abb8668a4cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/speed.ts:18 \u00B7 src/transcript.ts:489 \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/speed.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"605898c33d6062c487e5cf8c75cc5243e80a89f49cf29ab400c5c4e3218b9128"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): verify/lib/fake-api.mjs:13 \u00B7 verify/lib/fake-github.mjs:7 \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":"verify/lib/fake-api.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"40480c44d95261b48880d268538fe2c1e92ab2c445879bfa71bf222601746eeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): verify/maintainer.check.mjs:283 \u00B7 verify/owner.check.mjs:224 \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":"verify/maintainer.check.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e81cd40033299ba83ec67c35b7c0d8c35b4b9c1bc86e17b8b29c117bb899d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function line (cyclomatic 49, cognitive 55): line has cyclomatic complexity 49 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"53db1914dc6760c2542b5572fb593c8976443d236d23a98409bc3c91c59cd438"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandedLines (cyclomatic 38, cognitive 54): expandedLines has cyclomatic complexity 38 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/expanded.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"04759ebf9980d95d36332fc22ed17fb1a59ac2645bd86787dadb5e9553f05f06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageParts (cyclomatic 33, cognitive 41): usageParts has cyclomatic complexity 33 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/usage.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3028db9fc3adce9734adc606fa9d7e0681242c4bdd6103b5b7e983c8dbc143"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vcsPart (cyclomatic 32, cognitive 43): vcsPart has cyclomatic complexity 32 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/vcs.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa402917707551d89c75534b0bec087540391ca4ba3b683cd289509158776e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolUse (cyclomatic 30, cognitive 52): toolUse has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bcad7992edff5b9084a902bdf1861e805c0257a6be8c2bb18860624143974a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sgr (cyclomatic 28, cognitive 32): sgr has cyclomatic complexity 28 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/ans2html.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce417ea0f9ac48ee4173d5ed5bca606d023ddc1939661f135a548e67a15660a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateLedger (cyclomatic 23, cognitive 29): updateLedger has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e274c19d645b5bb915c15cac7f680de910d981ddffb14dd765f828acc662a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isWide (cyclomatic 23, cognitive 19): isWide has cyclomatic complexity 23 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/ansi.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc621ee38967e141c1350f499d39c0a28e520990799f28f91abd216afb98e48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatWindow (cyclomatic 22, cognitive 24): formatWindow has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/usage.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc3dc5c45725c3a7262e4de10c96285c73067c98dc8d38870c0c217447de7b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valid (cyclomatic 22, cognitive 20): valid has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0f53e486cf9bb70b1b482500e873dfa3b03520b360637b4a1f1157924dd0bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStdin (cyclomatic 21, cognitive 20): renderStdin has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"96975fe12a0b653d79cc102af320b53533a5aa406017f21d9d42256fb3545688"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findRuntimes (cyclomatic 20, cognitive 27): findRuntimes has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d434d3b822c6fa0f14b12057fbb2f9151666c528cfae9e0cfed77d8bdb334cb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outside (cyclomatic 20, cognitive 21): outside 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":"verify/e2e.check.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"862630b22c30dcbd7a4971741f66bbb32cff61444a5d1a4848f639663995d74e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inside (cyclomatic 20, cognitive 18): inside has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/e2e.check.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b58aec611ed66c53e6755bce74987658b3628f6cc6b0d943e5ebb24d9accbef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectParts (cyclomatic 18, cognitive 24): projectParts 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/render/parts.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a7121a738b1e44b53f0c532515cf7a7bc8bbd8ee52aa056387011d9a16ef2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLedger (cyclomatic 18, cognitive 18): readLedger has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82389eab2bf81f2c3553f87bc6f1f65ab6f24c91f24f824d6d4dfe1879f212e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCase (cyclomatic 17, cognitive 22): validateCase has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/case.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35d17ca74551a62a43677f722707f0a6a9878b065275ea6329829791a080a36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getUsageFromExternalSnapshot (cyclomatic 16, cognitive 16): getUsageFromExternalSnapshot has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/external-usage.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b3aa3f684aa0b8e0aa1fab8ee4265be23602b736be12fe8bef681dc43c9031"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doctor (cyclomatic 16, cognitive 15): doctor has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bd253cb15d2bff691e20a1045280ce461f4f1bc497e05db14a328843db31cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preview (cyclomatic 16, cognitive 13): preview has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37fd622145a4691918815387c6c36477b847207d971ffb987040505f4c938b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gate (cyclomatic 15, cognitive 17): gate 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":"maintainer/act.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb92877e8700d21378584c198798db2dea7fa75e921a61d1e40c3e6ee5b9e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assistant (cyclomatic 15, cognitive 15): assistant has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c967ec787e9df8bbd295f27334d73d553aebaa355e1ea0695804491d73006500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 15, cognitive 14): render has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/corpus.check.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41fabb3cc780530463d7623cccaee9f8b68b58520aff1bb0c45f1e4c9d590aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGitStatus (cyclomatic 14, cognitive 20): getGitStatus has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/git.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ec2136c29d4cb481dbe36a809e9aced3ad7d3a357938f127e84fef80ae8fb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 14, cognitive 17): inspect 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":"maintainer/act.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc56e117cead58f77271fb1ad01cc445494e09b00de7bc88b79dd787cc8c095d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCommand (cyclomatic 14, cognitive 15): runCommand has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hud.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a901f7dd97985bc331b3c82e1f234e259174ca4d5e132182c75cd4bfc45e3044"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activityLine (cyclomatic 14, cognitive 14): activityLine 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/render/activity.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b12e447fc124bed0f058b68c9a2617c384ad6d87df72e0126ce57630bac06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graphemeWidth (cyclomatic 14, cognitive 14): graphemeWidth 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/render/ansi.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eece5374ea882301d7a3aa871eef3e4fac4a32f4543c94d45033a053677a7fd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 14, cognitive 13): install has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4be47465d994ed7c2d310a2d6284492307247a6cd5b273f3301cc023a9da82a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 13, cognitive 23): apply has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"94421b521274bcc1faf4747f4358fabbe74729e280d510678374a5137c83364e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatus (cyclomatic 13, cognitive 21): parseStatus 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/git.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9458870fde9131e07aa2ebefcf3d3eb29c090c9b301d70c3852732f324e09730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolResult (cyclomatic 13, cognitive 17): toolResult has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba469bf9cd70a7d33ff594551bd3d9499349edd586d0ef9642574f103f131ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countRules (cyclomatic 13, cognitive 15): countRules 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/config-reader.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"88427e8ea2464234ab4b03a8d0a3449b85668229afcf2552254558609ebf72f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConfigFile (cyclomatic 13, cognitive 15): readConfigFile 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/config.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503697d8355d6713bb7e056adb40e2c8ccfbabdf4ed236b4abd26feee2e7185"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 14): main has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hud.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8708636dcf6ee1bd874257ef62dfe05a2d82b2b0219e3bd50f227e13361a943e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveAuthInfo (cyclomatic 12, cognitive 13): deriveAuthInfo 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/auth.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ca24382b438314b1e619ce968c0b0494eac0f19dd83bd6dbef05332ad53c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function environmentLine (cyclomatic 12, cognitive 11): environmentLine has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/lines.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c7e470ae15b2ff9e03a45329ad9d1c05274dc9a74a5b5401c82e2dba777469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitAtSeparators (cyclomatic 11, cognitive 16): splitAtSeparators has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/ansi.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a83ef04c5d8f3eb0c818fa795138c4ed05a1f4ce3e241f2f5bf99ccc38bcf2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatProjectPath (cyclomatic 11, cognitive 14): formatProjectPath 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/render/parts.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a1f30b7aba72116d8c9da5a3d8a83e8e08f0ea4d8db19273fa7743da99f750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeConfig (cyclomatic 11, cognitive 11): writeConfig has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ab30e9967e8572d1578cb7882d76d90578cd97fc6dfda9451d237ff0d213ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolsLine (cyclomatic 11, cognitive 11): toolsLine has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/activity.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6875967e317964d6f2241177551b087296a4c6ae3766b0e4cb62fe9cc11eaddf"}},{"ruleId":"R3","level":"warning","message":{"text":"src/transcript.ts: 620 lines of code: src/transcript.ts has 620 significant lines (blank lines excluded), 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/transcript.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35bd7ba2daae0d4dd7b07838a540529c7ae2cf03b883d131f3b3b6844fc4763"}},{"ruleId":"R3","level":"warning","message":{"text":"src/config.ts: 596 lines of code: src/config.ts has 596 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe8503b3c2a428b8fb22abf2b0423917b3ecc6919a571924ff8f41a86b21a15"}},{"ruleId":"R3","level":"warning","message":{"text":"collector.mjs: 593 lines of code: collector.mjs has 593 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19ffe29692b180734aec35e75de89eab28d78dab20222aacc9802355827c647"}},{"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":"verify/maintainer.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe80d083a3d366ad7d17052003aa44d969436c559ae485382778581312ce4e23"}},{"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":"verify/owner.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4284e705999b398f09593e78fe10fc686745c773995307e3543d05c898a636"}},{"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":"verify/e2e.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d212a3fe3ecc772fd44822c3b3da295c94e59b05cc58d98f468617dea118dd27"}},{"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":"maintainer/act.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa520dc27c50c68844c680cb40b5c6084ba9951bec1f8fd681ea10a6f9036a5"}},{"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":"maintainer/harness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"890af4f66736f7ff5282a8ba65cbb35782f5e3385a02f88e61bb9f52e3065266"}},{"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":"verify/lib/escape-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dad6d8524bc60a32e12efa94a6c66796d5d3b02df85c697638e9fd8edf348ed"}},{"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/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"946268ce27a2cdc9eb38f380166dce7156f676cabefc549c38ecee0d4ded6161"}},{"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/channel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d8739d5958a5b717d1106a2983ef2f021703b222647bd073cf48833ab17835"}},{"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":"fence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e61ae9333470e16eaaca7c7c871660cd7097be4b2b41beb8d0b3af82deb788"}},{"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":"verify/corpus.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"723dd3e37d9913846dd35e7cccdd8c0927143e2ba6340395dbf8507148683943"}},{"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":"verify/case.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11acf430d26029f1fa41b93ff7328f5174a28c6964894409a7914b3a5a1d12f9"}},{"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":"verify/arch.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb98617f9701fa32eca9c3414b4e673aae86aefe1887dc8dd19f1c7dcab2fb3"}},{"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":"verify/escape.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b263083e903eb1b2be44289b0701fcadc4d731863ea02052c08cc5bba8c02d0"}},{"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":"verify/launcher.check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"890efe541c20816a6fa20bb556ef67d9f6fe7ad59d9bc63ad5cbc64fff3602f5"}},{"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":"verify/lib/ans2html.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af19275c488eca275ba085cf2bdfc1e5ff370f44356128078ebf8594fc805a3a"}},{"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":"verify/lib/fake-api.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9a352259babdb687674af43a5d9ac63d671b0190e0e18a0de9bc7ec7f79722"}},{"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":"maintainer/probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c4e19afee1feb8be41e6ad6bbc9c13bd0c892f487ce905d195da0ce80f0f0"}},{"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":"maintainer/scorecard.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8473c840ada4ec28e33b77cde620dc7698c4b34ebd275320d440e4ceef9fc0"}},{"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":"verify/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e9754f1a1e9159faeeae2e708dc194d6c0204557193939d3b6b39c259e1e8b"}},{"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":"verify/lib/claude-code.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a61b9da22f59872ed2cdfd703bd19dbda5240b3c3943c87a5ec9c6f1bfe06ef"}},{"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":"verify/lib/fake-github.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ed48584148d1c4ca83e719204d2f88dcfb68321b1a434313041bc120054734"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getConfigCacheDir\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":"tests/config-reader.test.js"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f939a12aa8e9ef7629cd01e48b5576e930d8b40499335c1ccf3052cdc5a1f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027YELLOW\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":"tests/render.test.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b934c903383698471472bdcf638de62f409b5e666896417b8810c00c510b2046"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060server.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/fake-api.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8356063c3408489f80a5231bee1579381961049e9cf4a1ba69209149ff603da8"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060server.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/fake-github.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09dcb1b42ff2196609553eb4d4db3ed31bfb71ba14d371010ec7161448b20da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060major \u003E 22 || (major === 22 \u0026\u0026 minor \u003E= 18)\u0060 appears character-identically in 2 files \u2014 collector.mjs, verify/launcher.check.mjs. 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":"collector.mjs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec31ab841189a2b5984938038b6a1ba130a99a8116de19ea8ba3ffead0867d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 4 files \u2014 src/config.ts, src/external-usage.ts, src/stdin.ts, src/transcript.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f28653398d0e42abefb8c0dec08e84f8926aac01099c485dd6f8607b43df74a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 2 files \u2014 src/external-usage.ts, src/stdin.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/external-usage.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b186ce9625d0856e7aeab4e20c087c6f09f8d33ce6d09480752e799631a138d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 2 files \u2014 src/daily-cost.ts, src/speed.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/daily-cost.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bec59562b04747093afe2103de1d9d46caf6572ff1fad5445463b52fa1e7de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 src/config-reader.ts, src/daily-cost.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config-reader.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a198346262d6ebf02aff89914ca6e8c4f1b83d4cfecf861db2f9950fb463e4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060scrubStdin\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 245 (\u0060scrubStdin\u0060) with a piece of \u0060value\u0060 (and at line 246) \u2014 and nowhere in \u0060scrubStdin\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 \u0060scrubStdin\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/commands.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c5eb55f09566c6fd7e9e8fa0e8bfe0d3920392636c5e8ec10e0119b87c71ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060configKeys\u0060 is exported and takes \u0060defaults: Record\u003Cstring, unknown\u003E\u0060 from its caller, and it calls itself at line 481 (\u0060configKeys\u0060) with a piece of \u0060defaults\u0060 \u2014 and nowhere in \u0060configKeys\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 \u0060configKeys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9eb0473f3870d3a669bd193b30d72b4dc29d95011cb270cf0b57965f34ca25"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060configProblems\u0060 is exported and takes \u0060raw: Record\u003Cstring, unknown\u003E\u0060 from its caller, and it calls itself at line 514 (\u0060configProblems\u0060) with a piece of \u0060raw\u0060 \u2014 and nowhere in \u0060configProblems\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 \u0060configProblems\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c4315b76dd7ac167d18233fcbaef9fda947b6e15111ee3040342a581ed99c7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060mergeOverrides\u0060 is exported and takes \u0060base: Record\u003Cstring, unknown\u003E\u0060 from its caller, and it calls itself at line 557 (\u0060mergeOverrides\u0060) with a piece of \u0060base\u0060 \u2014 and nowhere in \u0060mergeOverrides\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 \u0060mergeOverrides\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"0002b2aaba858c4131b072f802e686f6edf382186332cc5296c1917438f860ee"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: api: \u0060api\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"900aa6d3edb8a26616d03f82fbfc47fc5bd2700f8563180890cbf8750080bd0a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: gh: \u0060gh\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/harness.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a674c666fef092fe49b4e697944d1cdc2c8319f4c9f918054ffadc84a6d4ad53"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060esc(m[2])\u0060 is text this program did not author, and it is written into the start of a URL attribute, where it chooses the scheme through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. HTML encoding does not help here \u2014 a \u0060javascript:\u0060 URL contains nothing it changes; allow only http(s) or a relative path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/ans2html.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87708675f579dd5c2cfd55a91d1b2b904ef2ea51cd56fc82e7cd32fe2620a71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd264ddf4009e002638fe4dd62c69f942417e5e3f2f4867cfcb377d28e6e276"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc51580bfd3c990df41bdaef9cde1342ab1b56b4ff1496f99bf35afeeaa6f669"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"795040388a77d7e95204e12ca9b6123c4e242a639a7f639f7f9e3ef0bb633d8e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fence.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e056f6302504ebfae6d9dd86772b1663aba54c738b9c133acc24926a2b4a0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fence.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8df939ce01fb2977c49ce4ad81c5afded9915ffb797654308163051afc941a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fence.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbab3e1320bfd770e4fa29dd488a1d64aaf4c7d796e417e63bc54630f8498828"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hud.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"41184b901c09bc8f05ed4acb1b956a5a7f33c6d0f1643acfad4cde9d9eed0bcc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hud.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd69df8e33ca988a9024c8019e58c387e8180680120e1b91167ef4a385fe84c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/launcher.check.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f4c255736167828dcc97d70ab157d69e2b1660a22dfdf06c21b808d6a0d7b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/owner.check.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62c1167fafe9817696efc285e2be4ec6a0503dfb4bb529f9e9171b96670a1e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/escape-probe.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc2e3addf2d58051197a9811597ab7ee7df375d34c4cd0e5de558ec84b335d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/escape-probe.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"282f3458f93b922cdf1d1dbf846407b94159c2506875a34e843bf19e68468820"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify/lib/fake-api.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4d6749eb6187b16b12cfa209206ff294b6f8bd768d354dbc494e3b0f2b1694"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b934ea32bd1e68f8a285d0dd6c14b45b5e6e29f24d68c9626b0a6c0589bd3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daily-cost.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47fd94ef047e6d1e883963c88d1ec665e3bd8deedd8ec492b722539c4d38a6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/speed.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc24a2b435cbbf854f6d23bc37d6e4858b6b06481a5d9f6d671e9b4f8b474c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aabdb54d3a4ddb17b9ecadabe593762b85fab8f3e6eb82d64d776eb2ddf1af"}},{"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/transcript.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ace1ae6b15155bd38274d2ae953a73b2434ef618b41b355b96e4f45eeb32b7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/transcript.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9fe5b663265c56db2d97d1becfb927829dc0b7c7a2e43bae0d4e70e112a2d9"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~1.3 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 7 assertion(s) across the 5583 source line(s) of the 49 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/commands.ts (6), src/render/usage.ts (1). 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: \u0060linkAllowed\u0060 (in \u0060terminalFilter\u0060) swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hud.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25debda770a4a93dcd055f2c1748dd74231fdc26e2e06fad5ccbb954cc127bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gateRequired\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/act.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e0db8561e9744538e0881c9e2b27cbb129f00e8b32e1315e202fa9465cdc44"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maintainer/probe.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"036392e03f3b11e9f865c67c0aa43c6707596954bce721f2767f63af02ee4b66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060list\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/statusline.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"33071da4480b553c108619ae07d334ef1dd2e4e5cba496cd1bf9d349fb58a1d5"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":27,"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."]}]}