{"$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":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"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":"App.App (cyclomatic 96): App.App has cyclomatic complexity 96 (threshold 15). Most of this is not in the body itself: 1 of the 96 points is its own statement and the rest belongs to 30 function literals inside it that branch (lines 276, 714, 391, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"715654d071706149858ea55e6bdc294e5c8087182573118d97edba3863ddb7da"}},{"ruleId":"D1","level":"warning","message":{"text":"parse-keypress.parseKeypress (cyclomatic 46): parse-keypress.parseKeypress has cyclomatic complexity 46 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fe1b96d7518c79e14b6b4def4771ac6579f89ada3189d9636544063e81191f"}},{"ruleId":"D1","level":"warning","message":{"text":"Output.applyWriteOperation (cyclomatic 36): Output.applyWriteOperation has cyclomatic complexity 36 (threshold 15). Of this number, 34 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/output.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7d47d2128c990f75bb96625718e5aa094c43df859e622df0757f64f5ae4b93"}},{"ruleId":"D1","level":"warning","message":{"text":"ansi-tokenizer.tokenizeAnsi (cyclomatic 27): ansi-tokenizer.tokenizeAnsi has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d16273543309d83f3c697da4c3c1982e61863efd03a9f7dbd26e6741b0a8b42"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorOverview.ErrorOverview (cyclomatic 26): ErrorOverview.ErrorOverview has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/ErrorOverview.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd15fd27967e236b137993b1c5ff9972bb093ebfa03deee924041614d195946f"}},{"ruleId":"D1","level":"warning","message":{"text":"line-update.lineUpdate (cyclomatic 25): line-update.lineUpdate has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-update.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d7eabebd888e0f9ca0c2036852e6d1a63d273906f60c16e0cf00d996cca244"}},{"ruleId":"D1","level":"warning","message":{"text":"Ink.unmount (cyclomatic 25): Ink.unmount has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (finishUnmount, finishUnmount::resolveOrReject). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd807941d7bc45d7301e065e45da47541ea6681f94703d9d9d45d8c9662a71c5"}},{"ruleId":"D1","level":"warning","message":{"text":"log-update.createIncremental.render (cyclomatic 24): log-update.createIncremental.render has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log-update.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc15d06db58f24725fe669935c2bf9cd12972483c2ac3c352b22ba0ab761e60"}},{"ruleId":"D1","level":"warning","message":{"text":"styles.applyFlexStyles (cyclomatic 23): styles.applyFlexStyles has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"468c199c2a4e714ef5954f082155dbd44af5360343b9823904d24ccb17da1055"}},{"ruleId":"D1","level":"warning","message":{"text":"render-border.renderBorder (cyclomatic 22): render-border.renderBorder has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-border.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a46708114de61275bfe804eae49e13e71f343e021d9cc11ccdb0ec7e71548"}},{"ruleId":"D1","level":"warning","message":{"text":"Ink.renderFrame (cyclomatic 22): Ink.renderFrame has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1605c8254d2988115b61126b0fe306ff899dfaa3e9e3c7b061a46e491f1ee2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"render-node-to-output.renderNodeToOutput (cyclomatic 20): render-node-to-output.renderNodeToOutput has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c78cfdc6f129ea631016a58217e87b6033e7ccfdee74a6af9b306ade3519f2b"}},{"ruleId":"D1","level":"warning","message":{"text":"Ink.renderInteractiveFrame (cyclomatic 20): Ink.renderInteractiveFrame has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b1969b48480b11e3ec20b9e9c4b676e97d0b53f8d87ca4312e129dfd706ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"parse-keypress.parseKittyKeypress (cyclomatic 18): parse-keypress.parseKittyKeypress has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1bea7fa3357cfc4031ff1162942e7ba14c3efad1d4e578c87e7e917c2d1c61"}},{"ruleId":"D1","level":"warning","message":{"text":"use-input.useInput (cyclomatic 17): use-input.useInput has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 176, 164, 259). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/use-input.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"df09252f1412dbd1c5b9919da783a7d3f94e59b004f0f90ef4fcab93d0f6244e"}},{"ruleId":"D1","level":"warning","message":{"text":"render-node-to-output.renderNodeToScreenReaderOutput (cyclomatic 16): render-node-to-output.renderNodeToScreenReaderOutput 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-node-to-output.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53ea294196e9b7d277ce050ae276ab21addbd08a28b10acac08469ec1f66e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"input-parser.parseCsiSequence (cyclomatic 16): input-parser.parseCsiSequence 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/input-parser.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"90545c9ac5951bb766882c5e6e4f3fe6114f7a4ef715ec4a9457e4b881307f43"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 96): App.App has cognitive complexity 96 (threshold 15). Drivers by points: if/else 46 (61 pts), boolean chains 23, loops 5 (6 pts), error handling 2 (4 pts), ternaries 2 (nesting depth added 18). None of this is in the body itself: all 96 points belong to 30 function literals inside it that branch (lines 391, 329, 714, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"30044f88213d744e06302c246eeee5b3262ad3cc3e1024a23f8070b5a20214e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ansi-tokenizer.tokenizeAnsi (cognitive 72): ansi-tokenizer.tokenizeAnsi has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (71 pts), loops 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f3340f4c055dd384ef60ec75a3b590ee816bbb2afb5a20df20e543de6ce29"}},{"ruleId":"D2","level":"warning","message":{"text":"Output.applyWriteOperation (cognitive 54): Output.applyWriteOperation has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 9, loops 4 (9 pts), ternaries 2 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/output.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"765e7611f1dfbd70d90fcd7d1a50fdfece8b28042a55441658291a9e9f4b0268"}},{"ruleId":"D2","level":"warning","message":{"text":"parse-keypress.parseKeypress (cognitive 42): parse-keypress.parseKeypress has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 17 (nesting depth added 2). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ab530a6111431fc017c510840301c8d4f7f995d28cdc77d2877998ef412b7"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.applyFlexStyles (cognitive 33): styles.applyFlexStyles has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (24 pts), ternaries 5 (9 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa3d4e8436f816a47df3fd718abd2d707b8c47d29fdf1edb9e32fb574f95cc"}},{"ruleId":"D2","level":"warning","message":{"text":"render-node-to-output.renderNodeToOutput (cognitive 31): render-node-to-output.renderNodeToOutput has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (13 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"592b6672a688cb0a4cef68666a22ab11e4942b9a58b9b5592578483425c18ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"Ink.renderFrame (cognitive 31): Ink.renderFrame has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4088d494591303df89658919dd77c064e604926fab0284fbc30a3d5c46d0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorOverview.ErrorOverview (cognitive 28): ErrorOverview.ErrorOverview has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 13 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/ErrorOverview.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfea9e95d58ec4890771f59e05bd9682eb8fa0ce2a50101700cc68e4dec0074"}},{"ruleId":"D2","level":"warning","message":{"text":"log-update.createIncremental.render (cognitive 27): log-update.createIncremental.render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (8 pts), boolean chains 7, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log-update.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c7da1cd1dfc362f290013ff12a16d84b8c91978b29899447661b7f9b45b469"}},{"ruleId":"D2","level":"warning","message":{"text":"input-parser.parseCsiSequence (cognitive 27): input-parser.parseCsiSequence has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 6, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/input-parser.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a285e4d73e9233d1520bd12e4d0ea79b0580cf77c136f17f2ba8e485676577"}},{"ruleId":"D2","level":"warning","message":{"text":"line-update.lineUpdate (cognitive 26): line-update.lineUpdate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 4 (5 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-update.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dee35834a7b7ada9c2fd99d074462d55c48ef921cfc790f011b5408f6dc2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Ink.renderInteractiveFrame (cognitive 24): Ink.renderInteractiveFrame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c6cbd6dc4ec7944539bee146d1333d3a34ecc768aeba34d61bcdf55432b062"}},{"ruleId":"D2","level":"warning","message":{"text":"wrap-text.wrapText (cognitive 22): wrap-text.wrapText has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wrap-text.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"82518d031fc4f6d65dffb454453b178cc408abe0dd0fe63e923d10717e41a0c6"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.applyDimensionStyles (cognitive 21): styles.applyDimensionStyles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (21 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"3add48ae18a68458c596a35598adb28dc3a1ec45ca25943808032b1ddb1a6e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"render-node-to-output.renderNodeToScreenReaderOutput (cognitive 21): render-node-to-output.renderNodeToScreenReaderOutput has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5221bd692d0d0d900d1b7e7b279a547b0cfaa01abee2b3b6c9869e2d0c0652e"}},{"ruleId":"D2","level":"warning","message":{"text":"Ink.unmount::finishUnmount (cognitive 21): Ink.unmount::finishUnmount has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"64949eefa1f204deba4691c6ac4cd781b66ce977576dd23152a64afce71f4672"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitize-ansi.sanitizeAnsi (cognitive 17): sanitize-ansi.sanitizeAnsi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sanitize-ansi.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d74307e67c2addca36ee31493f7de31c0051e29a44b16d8b979e9f27f555fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"squash-text-nodes.squashTextNodes (cognitive 17): squash-text-nodes.squashTextNodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/squash-text-nodes.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b5ab32da92328e0cdaab5d9d92bb1e5d7bf6c015c3cc4b67d8893a23fbebcd"}},{"ruleId":"D2","level":"warning","message":{"text":"colorize.colorize (cognitive 17): colorize.colorize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/colorize.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f292f732edab2ef2fa929d65164d2736fcccb3b58810970844891e45e454d4"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.renderer (cognitive 17): renderer.renderer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e65241f2693f22ae48cf92af526c4ed7299a0d326ea5204b0ef580969c79431"}},{"ruleId":"D2","level":"warning","message":{"text":"parse-keypress.parseKittyKeypress (cognitive 17): parse-keypress.parseKittyKeypress has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 2. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ddea7880e6418c29273de4b6e8c869f7b731f832b50106297a978803228bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"sanitize-ansi.normalizeParameter (cognitive 16): sanitize-ansi.normalizeParameter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sanitize-ansi.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8754bdfb70bae8c2ba54529578f5f0aa029d5ecda27440b80e250606adc8df0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: App.App: FunctionTooLong \u2014 App runs 468 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 368 over it, 4.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6417fec69b100773ca332e0c67bffbc264a78e1d4aa543dc5bc11647bfd55c8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ink: ClassTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 349 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"440739c9d9fe936fb98d81d91eb87cdd5ac57fee635c78ad7dc212c25c0b3853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ink.tsx: FileTooLong \u2014 888 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: Ink (256-1552). The bar is 500 significant lines; this is 388 over it, 1.78\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3759c1ae64abbb7fc944c7b8165fbf4e4da5a8423feb99375d93c1fabe94fd84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: log-update.createIncremental: FunctionTooLong \u2014 createIncremental runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log-update.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"81df376ea02fbe97e80a9f980fe5cee7193a60654c54d8f88573052dde4d28aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ink: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"45189753ef8b12b2012e55f9ba1b9b76fcbabcb01d1b2433e205a7c30cba793f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 468 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 68 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e48ee6842fccbf92fa18ec7d5f6c22a9227abbfec40bb3c535cfec9243f8a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ansi-tokenizer.tokenizeAnsi: FunctionTooLong \u2014 tokenizeAnsi runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e9fb0a77a82ab6d02e652bc11262a991584625dafb0e9c3f88d81849d45fd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/App.tsx: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: App (82-848). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c7f9481d59cc3cf47622767a3e59ba095e65a2fbd4432c4c8cb4ccfe54f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ErrorOverview.ErrorOverview: FunctionTooLong \u2014 ErrorOverview runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/ErrorOverview.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b9de860f69e0826d142765e40f0421f2bb980659cd78458d1a3717785f5b48"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: exit when app finishes execution: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/exit.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df4372bbd8b5f2e6b567f20b2d84515d1dec6c2cf690dee53e15a7f97624bc8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: accepts standard Node streams without stream-specific assertions: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/render.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1591436d61aaf79b109f4c8e045b6206b3d96c00348ce8dc8a384c922be10af3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: waitUntilRenderFlush resolves after unmount: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/render.tsx"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd2a548f790f4302c962934524d6f54dd8cc93b60b8cfdd992827990a8d907c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: useWindowSize does not crash when resize fires after unmount: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/terminal-resize.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dab30eb8b12cd1032041cb29623280bf0943954ef1d8e532ec94696cf0ae14d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not crash when resize fires after unmount: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/use-box-metrics.tsx"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a195e9fb59684f7871fb6c6cac99738cd00780815c4b8076486eba14289d8c19"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: useInput - discrete priority keeps states in sync with useTransition during rapid input: This test starts work it did not wait for (\u0060ps\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(200)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/hooks-use-input.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b029af7c849e34755d74e8954ef2cf9eae31ca5a8ae3e71030b8ef5fbd05b9f1"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: terminal resize example stays open to report resized dimensions: This test starts work it did not wait for (\u0060ps\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(100)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/render.tsx"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3749d48f9b18c2e53114e5c077c4ea06fd8b8a2fb8e26c8943f5c8d65389b8d8"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: createDelayedWriteCallbackStdout delays only the first matching chunk: This test starts work it did not wait for (\u0060writeChunk\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(20)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/render.tsx"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a5fe2e31eb2e8caf3391003522eaf223123f238474af5cb3f9b708d2fc17ed"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: waitUntilExit resolves first exit value when duplicate exits happen during teardown: This test starts work it did not wait for (\u0060exitPromise\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(0)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/render.tsx"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cef633cea6b562d83e8da0516cda4bd3d34d73d09323a5e35b652588acf76b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/components/App.tsx: src/components/App.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in App.App at line 82. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/components/App.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c888367a44acc1fa398e84906612b1694deb22ce79fc0b7bca006d9010ff7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ink.tsx: src/ink.tsx changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Ink.unmount at line 1269. 3 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/ink.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bfefc82bdf915737c470d169edba6f532f6c306a212242e442c6bcd09f2069"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/output.ts: src/output.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Output.applyWriteOperation at line 260. 3 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/output.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/output.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c622f39b1171eae0da46c6adc51a9f9c1e841c8efc391a957724b7de9b1a37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parse-keypress.ts: src/parse-keypress.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in parse-keypress.parseKeypress at line 439. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/parse-keypress.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parse-keypress.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d27dbec76c09576d60d3d8f6d03cd9045f7cc5ad60685ef2db133f0e9b06747"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/log-update.ts: src/log-update.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in log-update.createIncremental.render at line 205. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/log-update.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log-update.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d254ac535fd21b0f61aaa91578491153d667063d511895f44c55996aa00af5f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/components/ErrorOverview.tsx: src/components/ErrorOverview.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ErrorOverview.ErrorOverview at line 35. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/components/ErrorOverview.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/ErrorOverview.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e0aabf565a39b8db9617ea8c5afd9a6d591c5513ee4d1896e3b3810fdbaf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/input-parser.ts: src/input-parser.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in input-parser.parseCsiSequence at line 28. 2 of those changes were fix/bug commits, 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/input-parser.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/input-parser.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa253404a810afafaf5b4b249c1acdf6353d92fdf0be09d8aa6678e0fe8b220"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/styles.ts: src/styles.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in styles.applyFlexStyles at line 569. 1 of those changes was a fix/bug commit, 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/styles.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/styles.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"718d00da34cf8fef3db0ac96e3e233e8f8b1eacc52b60597fdcbf9020075ad10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/render-node-to-output.ts: src/render-node-to-output.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in render-node-to-output.renderNodeToOutput at line 103. 1 of those changes was a fix/bug commit, 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/render-node-to-output.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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-node-to-output.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2239119dbb86a7f69f710ad8dd8e599cf160f20b0b71a8c57d949b9470b61cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks/use-input.ts: src/hooks/use-input.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in use-input.useInput at line 159. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:20:20 \u002B07:00\u0027 --until=\u00272026-11-14 01:20:20 \u002B07:00\u0027 --full-history --no-merges -- src/hooks/use-input.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/use-input.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d964f61e00acf448d03bf335cdeac608d53e6cd534d7a33f780aab524e5a5e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: src/hooks/use-animation.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f498656a6aca0c59248eec5e17b1ee3b34074ba8dd3cce6226756aa083580cae"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (3 single-owned of 33 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 33 of the 74 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: src/line-update.ts, xo.config.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060{expectFailure: \u0027\u2026\u0027}\u0060 instead of \u0060skip\u0060 when we target Node.js 24. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/flex-justify-content.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbddf2c0a8e55950b500e91f19517a6eaa0da35584d44fea787e0ce53665972"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060{expectFailure: \u0027\u2026\u0027}\u0060 instead of \u0060skip\u0060 when we target Node.js 24. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/flex-justify-content.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"665a9613c7dcfb59da71bd882587b279b7b98af616dbfdf4381d53ccb68887ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060{expectFailure: \u0027\u2026\u0027}\u0060 instead of \u0060skip\u0060 when we target Node.js 24. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/width-height.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b79a75ca84f79773af1573f786d9d6e9c885e5b13570f256e7497e2d5090607"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use \u0060{expectFailure: \u0027\u2026\u0027}\u0060 instead of \u0060skip\u0060 when we target Node.js 24. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/width-height.tsx"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29683dd157ce8a00df0e1e0da70e339e297d6a8d909f289e315538d718e35d0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Count how many components enabled bracketed paste mode\u0022 repeats the code it sits on: 5 of its 6 words (count, enabled, bracketed, paste, mode) are already in \u0060const bracketedPasteModeEnabledCountRef = useRef(0);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef548fa6e3e6a4d1c4a140b3c61173ab474ff6c934d1eb98238ffd8e4b76527a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 14, 40, 67, 86, 113), for example \u0022CursorPositionChanged\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cursor-helpers.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c04979eba0a5906d92fbd3427f851784679a4ca7dd57dab2e17eb9b5b350015"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Throw after enabling raw mode\u0022 repeats the code it sits on: 4 of its 4 words (throw, enabling, raw, mode) are already in \u0060throw new Error(\u0027Error after raw mode enabled\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/errors.tsx"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bba398aa96d85a4c48f30bf23073b17efa910a21c55063ba5d4233396f34adb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 77, 94, 106, 112, 118), for example \u0022Test capsLock\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fixtures/use-input-kitty.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b6fc869cc86e512e5209a67ac666487f5bb936c688e19711c83992d81b7635"}},{"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":"b923d2a6d4bf9f3d17a069114b8d29dce8e6bc49ce4ae2931de0efd9a515de40"},"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":"904b3f333838d97fde9dc807fd4560c10f8371b02ab76c0e403975727509d022"},"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":"d40ca5f6448da5ab58da77f158ca164f9f772997ce1c9e783cfd31deca6343f9"},"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":"ca0061937a4e5339e256448113a8b0d83e0aba601d98a4359ddfbc3237d4b68c"},"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":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bee16a916192bc47803c755fa5c777c01a15fb56e69ce46b43bdf718adcb77fa"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78e98d5a2beb12495a5cd8e348012f11df0718564ba77773ae9b36d0f2d5fe7f"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060exit\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/AppContext.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71d8ed4cf913ec4c76c3b2b7ca341e033e416d75a25d9b86717299b036b01e3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060resolveEventType\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cbb80ae5967ac1f08699e0dcdd1481e52d0db0cfc3db1f3393cc3a5911c740"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060resume\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/AppContext.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bffdb280828f0c9aa6267a1d1834601b0c84c0acaf63369f86038eb66d30657"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060waitUntilRenderFlush\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/AppContext.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a3b634d829dcffb67c1c96f70129aae09ebda0577fd371ac0f8d4426855f3c"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060resolveExitPromise\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b3dd704ed7dbced6358e581668488a2537f585492ca3d4e42822b684fbe5c9"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060rejectExitPromise\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d34aaec5a6095c8ac4bac92a713c5435f036fb61605f5ca4283bb45f1d63311"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060unsubscribeExit\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"606da4431496b19aa5686ce3d96dae4b16431011d5663e738af26b3a4b686bf1"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060disconnectFromDevTools\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffbc8ce4bf762d41572bdfd76451b905bd46facfe4616310a48b6d7bae5af8a"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060resetTextContent\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56c0d7d016fea6e3ebb403549c9142db460201f3b9ff4677d567cbe3853710c"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060beforeActiveInstanceBlur\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19fc35493a18ec513abe0af2f1349311f9cd4ceea09cd7c9e01ad22f5657f30"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060afterActiveInstanceBlur\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e8d8d4b6995d89c8eff787be75425dcc40e66d4380f311abc77436cd634238"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060detachDeletedInstance\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71db14ab7262c5de3deef3c89c73c021f79eb1c2114d33845dfea891ff1d625"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060prepareScopeUpdate\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8192557716a7e0cd4a12393b2b0a7f7d4bde1db6025c960149d7dd44aa77b952"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060resetFormInstance\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d014b2223a942b46954f3ff98d94075147914aba59b68dedf769f9a1f08a77b3"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060requestPostPaintCallback\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"072a97df17d9f59f7ceb29d39883edd8dd38d8f7969dddde8f470d333047738f"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060trackSchedulerEvent\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dfa12933821c970be2134d276035436042ed7774a76f179b6d70db11d07c38"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060startSuspendingCommit\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b6a1dfd1b4cdeba1605cac3c2e76292350749b4592748ea92b43992a395ed4"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060suspendInstance\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b363763b50520f0924ded811085346a83c054959ac45509e86c338f9b8f3acd"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060applyViewTransitionName\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6944df64e1c945491586989332c8e2ddb869bf738c2d4c80482a3ebaeec102"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060restoreViewTransitionName\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf193c82311828804e12a3e1f9ce2aa2039f97897c563e270c84317cdcfbaa2"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060cancelViewTransitionName\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68957240fae248a685c2d3446e2341a6407fcd2f500376cad83dc016384ba67"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060cancelRootViewTransitionName\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5416d277449714162c912b0b01cf30d32eed46693266be84a76d2a365367d29"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060restoreRootViewTransitionName\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3d529dbc2a8e8b753d777bddb6a01e537867b481edad06090eb62716c03b9a"}},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"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":"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 2 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/test.yml"},"region":{"startLine":2}}}],"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":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadPackageJson\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4193ac981cd97a3246d83b562b0edc5e40fb9019ef33cc7f5aa9d2713493cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (104 matched lines \u00D7 2 locations): src/log-update.ts:41 \u00B7 src/log-update.ts:186 \u2014 the two spans are one implementation copied and then locally edited \u2014 512 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log-update.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d7594df9e4335d6526be3854d5833b62be939a3bfd76510e9a69d5a6f8e3d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): src/ansi-tokenizer.ts:348 \u00B7 src/ansi-tokenizer.ts:431 \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/ansi-tokenizer.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1971fd325fda3009cce315c9f738530ebfb0d850cd201ca933764170db1ebcde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/ink.tsx:1211 \u00B7 src/ink.tsx:1245 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0801d11c2d50f2a851fb0267a8cf0da081b9f608a65f4bd87ba8a91ecab709d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/ansi-tokenizer.ts:128 \u00B7 src/ansi-tokenizer.ts:201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff7630257dc76b836f899462a2beba224b2cdb51693525f9d474bfb7480a7bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/render-background.ts:5 \u00B7 src/render-border.ts:20 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-background.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b5ab14021c7ce266251cc02b79c563cc27f73451d8006bbf679164a1181fcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/colorize.ts:39 \u00B7 src/colorize.ts:53 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/colorize.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"659e4156b329d578f9f4ad9a43606320f1e8c0280c354a4c5dd61f5883cf5652"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/components/App.tsx:541 \u00B7 src/components/App.tsx:568 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5eac34b6a35b857ea4b27f6d0db151cefa163639108b59f5c9c1382876fc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/ansi-tokenizer.ts:480 \u00B7 src/ansi-tokenizer.ts:492 \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/ansi-tokenizer.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03adbca826294e81e0491b83969123036fd3a1399a1e5ef5ccf749405ef3bfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/styles.ts:597 \u00B7 src/styles.ts:659 \u00B7 src/styles.ts:670 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3184fd75ee1155bab61b4e045e956566af3024c3f5859a911522f5ee3d5449"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/ansi-tokenizer.ts:60 \u00B7 src/ansi-tokenizer.ts:72 \u00B7 src/ansi-tokenizer.ts:84 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2693c2b0c75e5b1e74eaa39950eeeafeca588c4daa62be6dd66135cee7f7cba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/output.ts:173 \u00B7 src/wrap-text.ts:67 \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/output.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12058a54e74a3d78babf7eb0aca9f1001527281fa2f3d2a1b1cde9c7315205"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/parse-keypress.ts:331 \u00B7 src/parse-keypress.ts:405 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb121deca3f15790eddad244059f7b67bb7e50b6ba6378e648885a4b62d643a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 47, cognitive 45): (anonymous) has cyclomatic complexity 47 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a480f32d164fc5e42cf51005a1fe42e666810dacdaa410ec6ce4214d5c45f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyWriteOperation (cyclomatic 35, cognitive 61): applyWriteOperation has cyclomatic complexity 35 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/output.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc498b8b7a3ad26724e37a3e48689217b267502020c0128691744fa5c0a15082"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 33): (anonymous) has cyclomatic complexity 34 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-border.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ff0fb79b20ffd57799354940215a788dc3344671b5f95b1dc8ba48ed17afa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 32): (anonymous) has cyclomatic complexity 33 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/reconstruct-terminal.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd54599b9790f0bea61156442bdcda9597d6060ed26e1b4dca1b9844e1831886"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 72): (anonymous) has cyclomatic complexity 27 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c7421da7c80975a61322541c7bed6049771582dbb4a3efa919954f9faf73af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lineUpdate (cyclomatic 25, cognitive 26): lineUpdate has cyclomatic complexity 25 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-update.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946a186f897633a1320d6be8ee534a81bc2e35b9720ae8b58b0543ea850eeea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 24, cognitive 34): render has cyclomatic complexity 24 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/log-update.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"954768c8c4e8fc4735f1344e83012c08ea16d4d5c1b6041b39473c2cf2273dd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 34): (anonymous) has cyclomatic complexity 24 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"339df06b585cc5336fd6ef6cba135f1fa415f51f1c2e1ac65335228800df3d8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderNodeToOutput (cyclomatic 23, cognitive 34): renderNodeToOutput has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"831843b31e800a31d0516d899d536edb96f25f38e3482ec4511123b4db4bfc93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFrame (cyclomatic 22, cognitive 33): renderFrame has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a7261a2157be4fdb7bd1e6fa226bfad257c073a8538122e90111e6711dbbc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks/use-input.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"002fa10b2f9a8935ef8a4013f0c37424677bd5912be352c7ea90206ebb354230"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderInteractiveFrame (cyclomatic 20, cognitive 29): renderInteractiveFrame has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02002e76b24587616214c1fa7b8a87d75c0a0f41475c10255d7bab2cfd05e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse-keypress.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcd872d22371143d0cb9a8c6f03ce5beb672d788dcb472e3a9030b2fe9c324f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 23): (anonymous) has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98e99992a2f5f753007290a815c4053aee66df893528a7f47a4c6db95b62bb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c1defeaae75ca9dff66f9cee97288df076bfc938a1757832608ddfafec176d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 16): constructor 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/ink.tsx"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38042a9f37fdec3b96fa4b810f6b99def6547a9e7a2106db2d5e1e35eb5896f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 26): (anonymous) has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/input-parser.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d1c33797421c1b0939d0be16ade6a7a82cbf4b9d735632a93c51d4713d8347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wrap-text.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"95136c7dbe18b06b65a7c05fbc13d5923c86461941ccae007bf9e00e96c0fbf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ErrorOverview (cyclomatic 15, cognitive 15): ErrorOverview 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/components/ErrorOverview.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd2ffc79e6469a02ca189edbd64db7abbb3df8e658282aec7450fa1c776cb5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gameReducer (cyclomatic 15, cognitive 12): gameReducer has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/alternate-screen/alternate-screen.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89e6fec49870eae40365599577381f6fc0ec1e2373e82df0dbc56f4dfca5bb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea3ca59e6d2e6a67ab6b9829a8240b1b0508a1077018870f20f189bc4d41967"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a964b256efd7b1c52382938065ff0882b3e2330708b1890a98e44052945c4c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sanitize-ansi.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0aa759795ae8b761cc879228ab88624385594dbc06982648dbb3af754b8648"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitUpdate (cyclomatic 13, cognitive 20): commitUpdate has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"105fff341526215bbb3486f0861eb49f7462904a0ba570b5f15b62bd53e8ebc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sanitize-ansi.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2162411951e9358b22db60b09c0fc67ba884608f753484aba9d23c378ddc2aef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/alternate-screen/alternate-screen.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d714c755448e80eceba979d5d56fc16aaab81a6cd7d62d3be78b5fcc449a9b14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-background.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21ddcedc9cee32e3975f674eb731537cd287f9f8026d18432df4a158dadea89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/colorize.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4efc46770898f1a327f942090b53f46c34dda8462824bcebd8929a84be5ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unmount (cyclomatic 11, cognitive 12): unmount has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d785ea9293a5903b584aaa3cd922c8ed2c257e0a42fe7a8366f2f6c4dd5ba29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c57af0c0d665b63d7ef10942a1dacb75d28c1c196638f9b87ef34aaac114e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initKittyKeyboard (cyclomatic 11, cognitive 11): initKittyKeyboard 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/ink.tsx"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"3441ab84fa99baee499984ddafb97e9f8234aecfee76e7f5f2ed1fc5476e8cdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1f3aa78568fd1b28ada5a9266a37ed2d35b4a0dba2d2b8cbf37b214e68de99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7dd4ad3d855679d98126312859b8e6cbfefdf961b52cb372236a677f0159db"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ink.tsx: 1304 lines of code: src/ink.tsx has 1304 significant lines (blank lines excluded), 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/ink.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b4bb9406432633ed4f74543b5be299c3cc5382952b656caf6836d822128a2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/components/App.tsx: 738 lines of code: src/components/App.tsx has 738 significant lines (blank lines excluded), 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/components/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82f0cfc25922b7b6652a72bbab1a38ad4d8d96466685b31c96937be3a256ea9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/styles.ts: 639 lines of code: src/styles.ts has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/styles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa73d31a6d314722c8e191b1a5267a717018ede196068d85944e21050d6f18f1"}},{"ruleId":"R3","level":"warning","message":{"text":"src/parse-keypress.ts: 525 lines of code: src/parse-keypress.ts has 525 significant lines (blank lines excluded), 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/parse-keypress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c1210aa28b30df83d718d7500702ad2d77f6b99ac2f31fd0cd2b17095890a3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/reconciler.ts: 490 lines of code: src/reconciler.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"288f1a70f5b87b001007d60074d45483ac4f74cc3dd41f368f00f0d5f20797d4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/output.ts: 416 lines of code: src/output.ts has 416 significant lines (blank lines excluded), 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/output.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d18a3719dffe4940e47a7bc5c243518d922cf27845ca2dcfb5b7fa99b14cabe"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ansi-tokenizer.ts: 409 lines of code: src/ansi-tokenizer.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ansi-tokenizer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd886ce57f3d002c63ec926560723cd2c0766e275558f7ab743c0ab02e90e2a8"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/helpers/term.ts:11 imports \u0027../fixtures\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/term.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc21787cfc9c00b5eb947fe15f3b28016f829388b4bbcdba56212e6b26a6ded"}},{"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":"examples/use-animation/use-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59aa7d9556f526d719a299a182b27ff0196a5e1c30c248732faadd26fb7834f"}},{"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":"examples/concurrent-suspense/concurrent-suspense.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da250c24530c37dda23a4f99fd950ff8d2ef1eb292d7f36df13317e3ee1fb58"}},{"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":"examples/box-backgrounds/box-backgrounds.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e3ce4e960553f4e7724b793ca7d277fc391d0836a8f264dfa0b9f51f195e86"}},{"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":"examples/router/router.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b6b050ed12210c6950a156c677e5281258a760742fa324fb34708a8d23be20"}},{"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":"examples/border-backgrounds/border-backgrounds.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3e14cdd66e9586a3f4c53fd64f7921a6fe7be4547132db19ee4b0c6b7785ec"}},{"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":"examples/select-input/select-input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45056aff4977c0ee29d333f624a6d4b3a189824ea96c82025cebb4f230172443"}},{"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":"examples/justify-content/justify-content.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5249c488ac4f2bc276e9ad0fd3294e4c3cb36e4a8841b2c3943fad485e493b04"}},{"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":"examples/static/static.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"661703ffc4d9b0db458b47fb9d55c28fa21fd1df21e679b0505ae9cc4168d1c9"}},{"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":"examples/use-focus-with-id/use-focus-with-id.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0400f4a3dc81fb5424c6ee79c70f08538a73a72c43b990a65a6cd075083cf7c6"}},{"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":"examples/suspense/suspense.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4e0409bb2c6ef08e1f6efa13966536517bdd02ea5e697645173c5dda77998"}},{"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":"examples/borders/borders.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a76ae4a05629025524aa8bcb5af701f02005c8daa63c03657a00a1c693601a"}},{"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":"media/demo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cf6e885ff558bd8b8ec2eb9539b58161f0251796de6380563d05fc6c1b8c4c"}},{"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":"examples/render-throttle/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e615368d6d271bfdbf7076d0872875b2200346ee3dad01beaa9c2172a8679f42"}},{"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":"examples/use-focus/use-focus.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352fd5d40046fd118091afa8721146f8e1a89daaa23c462c31cc7fe66df11497"}},{"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":"examples/counter/counter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f811522926a619f2c961efc2fc798a3e0aaf61652a94ba60dd81b80bf511e5fd"}},{"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":"examples/use-stderr/use-stderr.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24258b6ec589a14edba15bb20a6318a508e03f05a617049a6013440201ce4ac"}},{"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":"examples/box-backgrounds/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2d1b925ea3acdc4fd3250d987961b0feceee7b7b45675b6f5d49184b81476b"}},{"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":"examples/alternate-screen/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041a721955c5ccaba481b4eaa77d483b5f27327c015ea2aed2a6d80b0c269ed"}},{"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":"examples/aria/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c848aacacd7eb25c93631f23548ebd762b849053d07b6882e7d63877c7b5a18b"}},{"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":"examples/border-backgrounds/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0dd4ad10ec06e68dc80984e99162a79dcf87fa5851c3d0b77a2318aba2f961"}},{"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":"examples/borders/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62acc78ef8e37753cb2a0664d7b81f79f6b2d319e384a1c8eecc114d093ae91b"}},{"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":"examples/chat/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1747e886449ad63ab248f90dd22bc7b31d72a49d79ec8e716213b0e1811224a6"}},{"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":"examples/concurrent-suspense/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bcc3123baeecf51513b638e6f68cc5fe6ad3db4950a0f6515b10bf8f7b5174"}},{"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":"examples/counter/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d766b17a9b3db36bc2f270097f5e2bdc16caea7538522bb400cdfe50cd59f1e"}},{"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":"examples/cursor-ime/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24024330a5eae436356915c52c21c814107223cb60899f17edfe041900034bd4"}},{"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":"examples/incremental-rendering/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15676846d4644545b73644c625d161a4bc9cee8831fa1d97106f6b94e7e1696"}},{"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":"examples/jest/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24859b48c2334da06e591fe60e70b0842929b2b098b8d876a21c46be5679fbf8"}},{"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":"examples/justify-content/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae588ab93053293ec2dc1382117ba1bb7c1d13f627e99dc114fc8fdfc5f7c5e"}},{"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":"examples/router/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a35bc50fac5baca08dabd1985385011c98ea5a79e7b22b76a6126db1c4829b8"}},{"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":"examples/scroll/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb5d8d42b806c84dfe599ef4ab074b1331ed63ad09c7fc9666ed009316bb415"}},{"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":"examples/select-input/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca39581c3245bbf169df8c1e01a926e973ecd08c5b9d9194b320ada7969570e8"}},{"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":"examples/static/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"291fc7b5031ae6698811c3adbc2c457da726f4e5bc18465ba4c3ea41d631cb1a"}},{"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":"examples/subprocess-output/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19bb3e85b30cbfdd48d6261f7d49b475a4e3228650fbe489ea02af6299e44fe"}},{"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":"examples/suspend-terminal/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cfecbabcdd02fe299474931a0bd712053412ff84080404df373ee125c902b3"}},{"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":"examples/suspense/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289c3246842dfccc69a70f5656da979009fa3c0bf37781b49974b3f69511447a"}},{"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":"examples/table/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df6249226bdd818aaef3244cc45f756fae0be4f8ecea7aa334d312408fe1871"}},{"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":"examples/terminal-resize/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb20149359ddc741d2f3d9506e835d144f6d629f3b04697eb7cc9038cb815c0"}},{"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":"examples/use-animation/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"336c7b9a02bdd1b111e9e43d994e9c612c5efcdd694974fbe6049f3adb3dc36e"}},{"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":"examples/use-focus-with-id/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8246c5233366868382e28cd91aa856bbe43f404f14d1abf4f236e12c1d6fe931"}},{"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":"examples/use-focus/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b578ccf7170eb8b11dbe4956edf344caa9bb1da362dd05ca9f570415af425f9"}},{"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":"examples/use-input/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fbd71bb6a741d729e5eb4119f186fec25de2f4c479d941d57637631c3cf08b"}},{"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":"examples/use-stderr/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f95f6e8358eaf00e993d70cd2645c46ba5da9ac92a3bad4dd73f1edbe9e0ad"}},{"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":"examples/use-stdout/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d5c6301e059d2da4ceb673428ce60b7a045d9f0b5b426e855a523335062d59"}},{"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":"examples/use-transition/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71f28706b6a77244cf681f82909c32b21a1b6641473ddb5774d3dbfd0a0a73e"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but test/helpers/term.ts cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/helpers/term.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00258c7e3fce4bf0bfadf6fbfe9030505fb1ece0e77c93bc38778b00614cb1e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~262 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/incremental-rendering/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/incremental-rendering/incremental-rendering.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71570b37b7b1d25eba1b5b7169cad82a0f36b89c47100a203f7d5b10f68af482"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~141 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-animation/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-animation/use-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbaed205d2a9fff4b4daa7dbf958c53213324e86c34aa514b024dfe93a61de1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~120 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/concurrent-suspense/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/concurrent-suspense/concurrent-suspense.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f1e9b48e66d9379d555bfe468215a1ee75d78f4be4ca364bbfd28bc7e763a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~107 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-transition/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-transition/use-transition.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1474f58399ef4c77e960be656de1edd04b5c235a06a10fac0bff3f016324bc6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~103 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/scroll/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scroll/scroll.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee3408a2ae35da180e702a98ede517eb314444752e3ece7161ae6a0e52dd51"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~85 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/suspend-terminal/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/suspend-terminal/suspend-terminal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e585cf90760c4511d08abbb7ae403a1162cf186728d4c20a5ce6f7f196550"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/router/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/router/router.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac25acaed9cef855ed4e15f5cb6e6890038f9a06c3d2d2440695ec003f2e6f14"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~62 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/border-backgrounds/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/border-backgrounds/border-backgrounds.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46ffac60aa87b510a57c41c5057878a29b60e7a20b15a1724143623e8b7c44"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/chat/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/chat/chat.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac29ef15c43086b615da934b9a0900c4eaf112fd5a8a0251efcb0d7998465ba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~60 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/select-input/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/select-input/select-input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7db3c39b9877f58f3538719ff5a216fc033472dbbfeab45f40793110b15c5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~59 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/justify-content/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/justify-content/justify-content.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4fa226b1d6ad15ce70e4f71736cd77cef5f8a5af7d813556c1b5f99ddd75d8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~57 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/cursor-ime/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cursor-ime/cursor-ime.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e164a1e8b9805086849d7a0269801a590daee055be7ebcc6fb1ea8ccc12fef0a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~50 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-focus-with-id/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-focus-with-id/use-focus-with-id.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9cb7100cd469fd877978a2f3defb65f68a241938dc6133153a0fc342b93c88"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~47 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/table/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/table/table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f3f6c6f7819fbea96008cbe2d573f6b1cfb8a56e497cbadb367688060fa9c0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~46 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/suspense/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/suspense/suspense.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2699ed3cea94ff62a19d523c7c20fe35efcac38b8ca4a9b91e53f21c07a158"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/borders/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/borders/borders.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa38c69ee5baf4076e1131d7d99c502a5dd70a5ac13dd6be4ce15a159823b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-input/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-input/use-input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2428642a431eba6588fca21a4131af795d666ae0269029d622fb09614ac995c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"media/demo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2f0070b5728201aadd9f425908f263075908ee16730ab529ad8feaf8f6e53e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-stdout/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-stdout/use-stdout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ec62b5af7fd0ee273a6f3d5c9cd5a1032334869c5f51c150be8b41365adae0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/render-throttle/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b80fdf00710a7862bf05e59452516365198b104997afb84bf38dca3c6241ae8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/terminal-resize/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/terminal-resize/terminal-resize.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78153f677eb5262954c434d3fb90e26f165c6ac7cee06b65990a4574661d01b4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-focus/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-focus/use-focus.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1479ec9dac7f50673b7c8b20dd9d529fa662a87b632d82ae65e50ffb7a1920"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/counter/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/counter/counter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83357c7b3bf1aaef63bd8b11f1bd2c28c8a64d4f4db7a1c4dcd46da600cc5a51"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (examples/use-stderr/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-stderr/use-stderr.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f290105c8b940eaf846e5d4bf6a9949cf9949d9d9221d100a652f7867df1ca"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/alternate-screen/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c4fb5e10339c9ea45fcf8463816262c48f1abc70830d211a11e4ae2e4980c9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/aria/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09a25f80e94007a60ce794a9685933aa7137ca8b09ab6d8547b2e7b97ed396b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/border-backgrounds/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c2a20f69d1e9f6266f85824863797b556443e4719ec32b47fa40c164e3e35d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/borders/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e8d18a8d8b7423b1393bae126d25fd4f9155aa243c5d02d8801b96049e8019"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/chat/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"165bf79a5697ef04b3289390b56632c7ed9a7961be479ed1d37c9411c5383adf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/concurrent-suspense/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f13f070237bc9672b5b21e1e3c6ea5a43e74794a3d1e0a905bfb6bd4b8e44a2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/counter/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae4e04be890bdd125269d9b5560076b322c4f80afda948239f1e51e02576c4d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cursor-ime/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f68650baa4a2b458186070e4e1aa0179a37c927e16ba8b6a1df992dcd33bb2a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/incremental-rendering/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b054124960a241e57ec9872ca662591b069d5ffdb4ec4fc07f88912533b36e3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/justify-content/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd13043781706d5bd51da43c6419875bb6b110c0f3da05b7554c98af9822055"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/router/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"036190645938f18ee417a183d2624cb340fce7b189bc237d1c690f587ec8620e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scroll/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c9f546c1e67951016be71d147a662aa4915f2df1a9da992e65b8387a6a56f4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/select-input/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f41a99af27ac6caeea518091596dbb3616447a628a44410fff0fa4d5b2c1468"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/subprocess-output/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a5ab32ef5f1b575937b3411a55f118d9d10ee6f85f58a7b8c5c36c0f03c6d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/suspend-terminal/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4e74205912499ddd7e17524625f1ad34d2a6bf2cd326ebc4cad168af093b96"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/suspense/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f61ba44d1accddfdf220824fc620e04f4f60da01c8b0eac6188a581e842471"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/table/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a19c7d130d1f398cdd04838774ef0252d31dc3e0b6a5dfe2117ac8899784fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/terminal-resize/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cf4e5b0cc8253c572c4fd65c2bb26694e4043163a11959d135a66c6907fbaa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-animation/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edafbb9ff9a124de9d27fa18a7558d6b0ed0e94f6a25a00e0773de8b014bde2d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-focus-with-id/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc456e51d0726f8fb2e55cc6c3502e9f4c8635ac0b660add040b7e3a6b9d726"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-focus/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e442f30b3fc6c872eaf2abb57a3f1f90321957bdd286a5f38f0ec1f5d9fc2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-input/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e9d77284ebebe56092f689b36904e00853f5578fb12b1aa2cefa62294d3941"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-stderr/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bc13f65a8aec3979501edf656280d746dc218d50f6944d4f3bf75471cc4feb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-stdout/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec79d17fe99a404e11124e917c17912b3a9242c3a461825b727e5a86f66f8e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (74 application, 3 tooling, 182 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/use-transition/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaaaa84b4898e4a0674a595d9f116a7a14f4d9086d70d60bdc13382c051609e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opposites\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":"examples/alternate-screen/alternate-screen.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b4e119aa2bba263a88388e23fdf777efc970691c94b6d0b0edc216c38bff32"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/dom.ts \u2192 src/render-node-to-output.ts \u2192 src/dom.ts (one verified cycle inside a mutually-dependent group of 5 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dom.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37873d4b39cc637869d8f06c19e4b0d78084c0b627185717c1de05471bf3e9a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd699919aa591b262d8f4a07a70eed2e90d52ddb856cc6e42aa98540126b06b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isScreenReaderEnabled \u0026\u0026 Boolean(ariaLabel)\u0060 appears character-identically in 2 files \u2014 src/components/Box.tsx, src/components/Text.tsx. 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/components/Box.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca160fd725b1a7f96fa3fad4af23be38310e8300294ed65455b2a54b9f9eb09"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060appendChildNode\u0060 is exported, takes a document from its caller (line 154) and hands it to \u0060createYogaSubtree\u0060, which calls itself at line 146 (\u0060createYogaSubtree\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060createYogaSubtree\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 \u0060createYogaSubtree\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dom.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bad9c7d91f94c54c760fcb4f817341e73d920bcc1b8075acd1cc65ad4de286"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060freeYogaSubtree\u0060 is exported, takes a document from its caller (line 258) and hands it to \u0060nullifyYogaNodes\u0060, which calls itself at line 243 (\u0060nullifyYogaNodes\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060nullifyYogaNodes\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 \u0060nullifyYogaNodes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/dom.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"402bff1ddd4ad465a75ad7f60b47d0254364d2c5a5284bbfbf552c5491774f96"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060renderNodeToScreenReaderOutput\u0060 is exported and takes \u0060node: DOMElement\u0060 from its caller, and it calls itself at line 69 (\u0060renderNodeToScreenReaderOutput\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060renderNodeToScreenReaderOutput\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 \u0060renderNodeToScreenReaderOutput\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3c2308dc91cc1a03b4c1484d9a24402385a5bda72c2a9ead010a9a42f316d0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060renderNodeToOutput\u0060 is exported and takes \u0060node: DOMElement\u0060 from its caller, and it calls itself at line 203 (\u0060renderNodeToOutput\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060renderNodeToOutput\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 \u0060renderNodeToOutput\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-node-to-output.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feeabbf24a350deb5009cc411123292764ff1da9c7e2865f99e05f3e211eb02"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060squashTextNodes\u0060 is exported and takes \u0060node: DOMElement\u0060 from its caller, and it calls itself at line 28 (\u0060squashTextNodes\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060squashTextNodes\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 \u0060squashTextNodes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/squash-text-nodes.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf3018b17dd37acb01c577d47a028778fff3b277335f6ade7a3131e8b85314"}},{"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/devtools.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3e2c08248c53145b6f997baa627da05cd46df0ce489977b24b6bdae058ea39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reconciler.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a0bb304abde4fb5ea9f4c911f58ea9ca363bb1c44372e21b0ae4ebfd21293"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render-to-string.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e62648c74efd17171f0a57cdf6461f8d6cc2434a9cc2c01a5cd0ae48e2beb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(noop)\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6eaa8dfda2931cebad9bdf93ab2487e8b11586f18c5fd446b1c66e86c5f3d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6e9fb39b492cadf75eb751542a03e6b27643b700529a6b501c6c8be0f05670"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"10194c4141bb0f38e9ccf93ceaf17312ddddf1247bd9bd4d66acfcee55f49bf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca0f61718c0ed3bbe9ad59bf921e298a65d5267a368b08ece883e199dca6cb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"102701f51937fbb0378ef3c477877d2e6306ae5d8ff321fbf821859191a3c7a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ink.tsx"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f532d97521d7041421f48a09f0daa3b20c2a99149eb0dfa6b2ba639f9b2a15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcfa5ca261f6fdc96758199abe0048401cc6ec06b6e1ee303388e821d9e0f39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/App.tsx"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34ac4d5185d0e300ebffe21f3cf9df221f65c66136087d62755e1268f1c20de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/components/ErrorOverview.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8e77a122f8331dfaf67688862e842bf2412aa8fbf6e0ff7f4ba50789e4123f"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 0/2 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~4.8 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 51 assertion(s) across the 10700 source line(s) of the 67 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/output.ts (19), src/parse-keypress.ts (8), src/input-parser.ts (4). 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"}}],"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-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-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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"}]}],"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":8,"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."]}]}