{"$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":"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"line-break.walkPreparedComplexLines (cyclomatic 263): line-break.walkPreparedComplexLines has cyclomatic complexity 263 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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-break.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fb742d02a2ac2fc319068e6ee4a93790f750295e02383081e052ac6ecca612"}},{"ruleId":"D1","level":"warning","message":{"text":"rich-inline.prepareRichInline (cyclomatic 187): rich-inline.prepareRichInline has cyclomatic complexity 187 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/rich-inline.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb6564b0a8dd5d80855660758a32d9d78aeefde15ed0df6a485966917c428c0"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare.measureAnalysis (cyclomatic 113): prepare.measureAnalysis has cyclomatic complexity 113 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/prepare.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0b1ad4cd8c7ec47fadc80a3d111847b9e9abd4e9da7f5b868faf314d6be79"}},{"ruleId":"D1","level":"warning","message":{"text":"line-breaks.classify (cyclomatic 98): line-breaks.classify has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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-breaks.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f30aa46fe13643e9ac3068886783a1320dd8f9f9426c49e7a0402f7e8d9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.segmentAtLineBreaks (cyclomatic 65): analysis.segmentAtLineBreaks has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/analysis.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9dc34e529eb133d869c579c3f9e3cde1e2750b4bc494816a5a1134eaea3d63"}},{"ruleId":"D1","level":"warning","message":{"text":"gecko-line-breaks.markWordBreaks (cyclomatic 62): gecko-line-breaks.markWordBreaks has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c68753c5ab5d11d9b01e86afa7944f4338656df433c5abe39a0525f47f6120f"}},{"ruleId":"D1","level":"warning","message":{"text":"store.caseProblem (cyclomatic 61): store.caseProblem has cyclomatic complexity 61 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/store.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b6d0aa613e02afc29fe7b11f4703cf5d43084fcd2ac8cf102fd00881a2627c"}},{"ruleId":"D1","level":"warning","message":{"text":"invariants.runInvariants::rich (cyclomatic 60): invariants.runInvariants::rich has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (invariants.runInvariants, invariants.runInvariants::plain) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4621bed6c2a3f90bd924f1f8864095f32c1c0f6a0978fad4047fdb3d1a3ed53c"}},{"ruleId":"D1","level":"warning","message":{"text":"rich-inline.createLine (cyclomatic 52): rich-inline.createLine has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/rich-inline.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"694d2a8aaa5facceb2ce1c11d3567cbcb528dafe0232f3e971504146e23ec4da"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.analyzeText (cyclomatic 51): analysis.analyzeText has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/analysis.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"871419f497bc971d4c149fbd046cc8f5545f83d21152c80068086b895322c5ea"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.check (cyclomatic 46): cli.check has cyclomatic complexity 46 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c9f892f2686dd79d5d82001ace8330ac58821824c27b4bf52b916b6c433afa"}},{"ruleId":"D1","level":"warning","message":{"text":"rich.richTemplates (cyclomatic 42): rich.richTemplates has cyclomatic complexity 42 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/rich.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec8b63f2f7203b8fb5ad776947855df7839cf97fb24853f662bb52822b45c86"}},{"ruleId":"D1","level":"warning","message":{"text":"line-breaks.nextBreakablePosition (cyclomatic 41): line-breaks.nextBreakablePosition has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bafaa09c130dd3e22059d098c38c756df38c11d8fadfb7aa338636981311cc3"}},{"ruleId":"D1","level":"warning","message":{"text":"gecko-line-breaks.transformText (cyclomatic 41): gecko-line-breaks.transformText has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaafa2dc4b309a5efd5662503ea3c62b7f4d3de621a8dbcfb1af6263a8b1b207"}},{"ruleId":"D1","level":"warning","message":{"text":"sample.build (cyclomatic 40): sample.build has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20140a5bbf04e8c58d4a906116312bd0b0b080bec9abca1019f74f0430ad1a6"}},{"ruleId":"D1","level":"warning","message":{"text":"predict.plainDisagreement (cyclomatic 39): predict.plainDisagreement has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7c446ba616267435a6236c3ec623113e66c2f4750819c8d39836e79fd4e464"}},{"ruleId":"D1","level":"warning","message":{"text":"rich-inline.setEmptyObjectFacts (cyclomatic 38): rich-inline.setEmptyObjectFacts has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b47df346a59db52986cc0deda5810b0afd06be42048dd9370970e89466f7e81"}},{"ruleId":"D1","level":"warning","message":{"text":"widths.cut (cyclomatic 34): widths.cut has cyclomatic complexity 34 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c15f527e6b8db6c531428fa67483a6a997cf9abd901e9f1b4f277b27b7c45d"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 33): cli.main has cyclomatic complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c4b13498180ca2ce29ec0602db470d761fee588b0ca323232f075bde90c8af"}},{"ruleId":"D1","level":"warning","message":{"text":"invariants.runInvariants (cyclomatic 33): invariants.runInvariants has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (invariants.runInvariants::plain, invariants.runInvariants::rich) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21529a3565d693fa05376e1905853cad00e484aa337e760b7bc5d8f570e1423"}},{"ruleId":"D1","level":"warning","message":{"text":"sample.draw (cyclomatic 32): sample.draw has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"12df9e9045026f195f316ddc2ae1da6ffb563f8dd52b695c1b39629d0ebffbbd"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseArgs (cyclomatic 31): cli.parseArgs has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1edc7f1d7fcaaed08f621a5ac25f2042daf9a8a9680918b79b888de6da3d727"}},{"ruleId":"D1","level":"warning","message":{"text":"predict.predict (cyclomatic 29): predict.predict has cyclomatic complexity 29 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc204f2ffbcb75e5d508cddb1eefb7d0f5be93e4d9629cf065bb2f6184881c6"}},{"ruleId":"D1","level":"warning","message":{"text":"line-breaks.markRuleBoundaries (cyclomatic 28): line-breaks.markRuleBoundaries has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabebad3ec2d214add739f53ea618d60c0db074865384ec0f1272189045e9ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"line-break.stepPreparedSimpleLineGeometry (cyclomatic 28): line-break.stepPreparedSimpleLineGeometry has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa64e8704e7696a7d7d68406d77705671bf81611d3d38c03b87cb48e36372ef"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.removeSkippableSegmentBreaks (cyclomatic 26): analysis.removeSkippableSegmentBreaks has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeef431456287c438ddd95267ec35f98bab5d3f0c890197e4f31f9449060803"}},{"ruleId":"D1","level":"warning","message":{"text":"han-kerning.getStaticCharType (cyclomatic 26): han-kerning.getStaticCharType has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/han-kerning.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5da496f7d4dec3875cba918d85cd2f91d09e5537f04c6fbeb7c74d98824c8c2"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.drift (cyclomatic 26): cli.drift has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6412b9f8b5c343ef31a2ff62f347e4aab7beda819cf92b47ddb2846e422ed5c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.record (cyclomatic 25): cli.record has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b0e6d1d603f0b36948fcf5a7ecc85069771208d8c713c9b3c81a298c42cea9"}},{"ruleId":"D1","level":"warning","message":{"text":"invariants.standInWidth (cyclomatic 25): invariants.standInWidth 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":"harness/invariants.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bdbf6d779d1a9c924dbadec0df1b01ba726892eb09a142e58740f32b693f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"invariants.runInvariants::plain (cyclomatic 25): invariants.runInvariants::plain 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. This shape REPEATS in the file: 2 other methods here (invariants.runInvariants, invariants.runInvariants::rich) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e3d05f6a3692c8fd12d2d866ccd41366e420785181d10446ac40d4df76f46"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.gate (cyclomatic 24): cli.gate has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0278c62df2f523e461cbd7a578144de886c7d041ffbe35520daa4046828c19"}},{"ruleId":"D1","level":"warning","message":{"text":"han-kerning.getHanKerningTrims (cyclomatic 23): han-kerning.getHanKerningTrims 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/han-kerning.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef91cf32cb928260f7ae8e07c52bea48b8ff099f124199253d2cc2f07330bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"measurement.getSegmentFit (cyclomatic 23): measurement.getSegmentFit 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/measurement.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e966deb925c397527d1872988ce2f16c3f2f0ffb599cc8b70eb05676645708"}},{"ruleId":"D1","level":"warning","message":{"text":"line-breaks.getWebKitLineBreaks (cyclomatic 22): line-breaks.getWebKitLineBreaks 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/line-breaks.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7d7a9d8f537bee08a7e7dd3bb03241562793f46fcbb6084542feec4284bbd2"}},{"ruleId":"D1","level":"warning","message":{"text":"predict.alignStream (cyclomatic 22): predict.alignStream 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":"harness/predict.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dacf19ba9740d1744f14e66bc7ba4bab6d24eff85ca14cd81f86f856bca35fe"}},{"ruleId":"D1","level":"warning","message":{"text":"observe.searchLineEnds (cyclomatic 22): observe.searchLineEnds has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/observe.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e8449e6831c1083ac42112faf407e5c23cc18cf3af3739792c81b7e745f73c"}},{"ruleId":"D1","level":"warning","message":{"text":"sample.demoBlocks (cyclomatic 21): sample.demoBlocks has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (visit, add). 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":"harness/sets/sample.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f11a9eb7de6393a0c552b86d725881918f8a33d195e1084aef49a155d79b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"sample.drawSample (cyclomatic 21): sample.drawSample has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0431afd1b59fa911e7df05882368fa54711ccc0e86a0323523d06e1e57f3afbf"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.mapSourceLineBreaks (cyclomatic 20): analysis.mapSourceLineBreaks 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/analysis.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5585373a6a1a5d14fdc60ed0fd163fe84feb733862271a78e0844d73c36a3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"line-break.getTerminalLetterSpacing (cyclomatic 20): line-break.getTerminalLetterSpacing 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/line-break.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b35b24ab6555ae953c023f84887d4f48c2a1603adfba78470e7b282b22dd73"}},{"ruleId":"D1","level":"warning","message":{"text":"predict.paints (cyclomatic 20): predict.paints 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":"harness/predict.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad3c09aae9a1ff5072855892962eb27415d32b5036fa061f022a527bad25746"}},{"ruleId":"D1","level":"warning","message":{"text":"catalog.pairwiseRows (cyclomatic 20): catalog.pairwiseRows has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/catalog.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c9a2b25ab3ad7e2ec4176d23b40f5fc3160d45a37bb3ddc13e9dc50e4ec26f"}},{"ruleId":"D1","level":"warning","message":{"text":"run.runJob::step (cyclomatic 19): run.runJob::step has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/run.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f08e5cb22d7940565376a50d4b149f5fef0c19d5e0385ab05e6bb7a3cc3acd0"}},{"ruleId":"D1","level":"warning","message":{"text":"line-break.countPreparedLines (cyclomatic 19): line-break.countPreparedLines has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c960a6f9763913a800745fd8afb7b04d1660c42c8028b4ae1d9dcc65376cc85"}},{"ruleId":"D1","level":"warning","message":{"text":"predict.richDisagreement (cyclomatic 19): predict.richDisagreement has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa92e1fe92039b375143c38eb221ada50b82ece7624750067fe887961490a0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"score.judge (cyclomatic 18): score.judge has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/score.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8dc83c0c38850a84be51064e125c1266c1e9f5799ed6e7a22b95ea1d2b905c"}},{"ruleId":"D1","level":"warning","message":{"text":"rich-inline.getOpeningFit (cyclomatic 18): rich-inline.getOpeningFit has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c70794d88821922114c9316bd7db1b45e90c081c16bfcd1193635e3a00beed"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.explain (cyclomatic 18): cli.explain has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8a5bfebecaad877f85a9548769617c0d1dc847dabc72e516f288c6c97f45f0"}},{"ruleId":"D1","level":"warning","message":{"text":"gecko-line-breaks.getBreakStates (cyclomatic 17): gecko-line-breaks.getBreakStates has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"0192b687664ef9ef9556440f3b31f36b04682eff6152fd0b09de251b66d0c379"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis.getWebKitParagraphBreaks (cyclomatic 17): analysis.getWebKitParagraphBreaks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"16946ac998befc58192e26233727fdc6df6e667225e80a2ee752d6fbb658aa46"}},{"ruleId":"D1","level":"warning","message":{"text":"measurement.buildEngineProfile (cyclomatic 17): measurement.buildEngineProfile has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ceeb3a6b6f42eae844c00de4f4161a5413b5224020157ba5314ab66b20812a"}},{"ruleId":"D1","level":"warning","message":{"text":"sample.loadPools (cyclomatic 17): sample.loadPools has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8716753d25b0273303661bf8f398ebe143c097324b75ed7bc9102015e5e23f"}},{"ruleId":"D1","level":"warning","message":{"text":"break-data.breakDataReport (cyclomatic 17): break-data.breakDataReport has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/break-data.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc30750872769bfccf27e74307c1ac6a3125e3c3f639c85ca1b5039ccceb70b6"}},{"ruleId":"D1","level":"warning","message":{"text":"observe.lineWidths (cyclomatic 17): observe.lineWidths has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/observe.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f66834d3996a3f39bf56e41d22348c7bd3f2816d2b45d746a9933d897d5798"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare.addIdeographicSpaceHangs (cyclomatic 16): prepare.addIdeographicSpaceHangs 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/prepare.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da7ee504222102d7da03521f93acaeca115f0a61ab79c6b464327f9dfd4a247"}},{"ruleId":"D1","level":"warning","message":{"text":"widths.select (cyclomatic 16): widths.select 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":"harness/sets/widths.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ebc289a3622e2cf14f9a007cc63451a0b6ba12f8e3c02ab230b80b75867068"}},{"ruleId":"D2","level":"warning","message":{"text":"line-break.walkPreparedComplexLines (cognitive 599): line-break.walkPreparedComplexLines has cognitive complexity 599 (threshold 15). Drivers by points: if/else 76 (369 pts), ternaries 27 (120 pts), boolean chains 93, loops 4 (17 pts) (nesting depth added 399). 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/line-break.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a466a5456f32d164d25aeead7d1fde8ced654a8474a15cb78f2c962b37791ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"rich-inline.prepareRichInline (cognitive 302): rich-inline.prepareRichInline has cognitive complexity 302 (threshold 15). Drivers by points: if/else 61 (171 pts), loops 22 (54 pts), boolean chains 53, ternaries 16 (24 pts) (nesting depth added 150). To reduce it, split the body into named stages: move each independent step or branch into 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/rich-inline.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e027f3d280e7d5398ccfa42595afb7c6ad18fd02f551d523eae012c9ca7b2fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.measureAnalysis (cognitive 180): prepare.measureAnalysis has cognitive complexity 180 (threshold 15). Drivers by points: if/else 32 (87 pts), ternaries 23 (46 pts), boolean chains 28, loops 5 (17 pts), match/switch 1 (2 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into 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/prepare.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c37639a9e78d009a794db562671ea6d2fdcd3f1e4c03a56586902cc46a529"}},{"ruleId":"D2","level":"warning","message":{"text":"gecko-line-breaks.markWordBreaks (cognitive 138): gecko-line-breaks.markWordBreaks has cognitive complexity 138 (threshold 15). Drivers by points: if/else 26 (104 pts), loops 6 (17 pts), boolean chains 10, ternaries 3 (7 pts) (nesting depth added 93). To reduce it, split the body into named stages: move each independent step or branch into 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/gecko-line-breaks.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f853123eb6f548665d35ca30393fc31ec34ab2dd4381ba82c26efda31dd0415"}},{"ruleId":"D2","level":"warning","message":{"text":"invariants.runInvariants::rich (cognitive 127): invariants.runInvariants::rich has cognitive complexity 127 (threshold 15). Drivers by points: if/else 28 (73 pts), ternaries 7 (25 pts), boolean chains 14, loops 7 (14 pts), error handling 1 (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (invariants.runInvariants, invariants.runInvariants::plain) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b98a8d3d09767bcdfbd4703bde40f80778fc4bb349eb82e55d63d09925021a4"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.classify (cognitive 122): line-breaks.classify has cognitive complexity 122 (threshold 15). Drivers by points: ternaries 14 (51 pts), if/else 21 (49 pts), boolean chains 14, match/switch 3 (8 pts) (nesting depth added 70). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"65978d4dec9a04622e8b729e1c28c840ac5c9a5d8398e3f189e5b52a1fa03b05"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.analyzeText (cognitive 106): analysis.analyzeText has cognitive complexity 106 (threshold 15). Drivers by points: if/else 18 (56 pts), loops 6 (24 pts), boolean chains 14, ternaries 6 (12 pts) (nesting depth added 62). 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/analysis.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb128303b2ef503b4491c46a2809d7ecd8b286d6a2ea4e623ec0c81bca74192d"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.segmentAtLineBreaks (cognitive 93): analysis.segmentAtLineBreaks has cognitive complexity 93 (threshold 15). Drivers by points: if/else 21 (60 pts), boolean chains 22, loops 5 (8 pts), ternaries 2 (3 pts) (nesting depth added 43). 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/analysis.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded9648beaaa27e80bd6757014c00cc868777a0e2c7ea189cf2c6734f715167"}},{"ruleId":"D2","level":"warning","message":{"text":"gecko-line-breaks.transformText (cognitive 91): gecko-line-breaks.transformText has cognitive complexity 91 (threshold 15). Drivers by points: if/else 20 (52 pts), loops 8 (26 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 51). 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/gecko-line-breaks.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"73498fd996f1e2d611a905d3fcab593f96dca028517be2044f3e42743706ea9f"}},{"ruleId":"D2","level":"warning","message":{"text":"invariants.runInvariants (cognitive 85): invariants.runInvariants has cognitive complexity 85 (threshold 15). Drivers by points: if/else 66 (162 pts), ternaries 25 (57 pts), loops 27 (47 pts), boolean chains 22, error handling 3 (7 pts) (nesting depth added 152). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (invariants.runInvariants::plain, invariants.runInvariants::rich) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66fb8049daadaaadf7e518c6d59489e218e2b2bd445c20938602289517f3c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"widths.cut (cognitive 85): widths.cut has cognitive complexity 85 (threshold 15). Drivers by points: loops 11 (31 pts), if/else 9 (25 pts), ternaries 6 (22 pts), boolean chains 7 (nesting depth added 52). Of this number, 82 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9990abe4771a170df19c6bc45e6bd5438117910c41436b49d4a2e47321498aef"}},{"ruleId":"D2","level":"warning","message":{"text":"rich-inline.createLine (cognitive 84): rich-inline.createLine has cognitive complexity 84 (threshold 15). Drivers by points: if/else 19 (52 pts), boolean chains 15, ternaries 7 (12 pts), loops 3 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebba5163a94e11fd19a13987a0357d2f1088de9a56cbe391afe04cda10b5622f"}},{"ruleId":"D2","level":"warning","message":{"text":"rich.richTemplates (cognitive 80): rich.richTemplates has cognitive complexity 80 (threshold 15). Drivers by points: ternaries 14 (49 pts), loops 20 (25 pts), match/switch 1 (4 pts), if/else 1 (2 pts) (nesting depth added 44). Of this number, 78 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/rich.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8127a1701186d0c58f627946788e98fc0d348c26aa722167c714a527a3e094"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.markRuleBoundaries (cognitive 78): line-breaks.markRuleBoundaries has cognitive complexity 78 (threshold 15). Drivers by points: if/else 21 (67 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 50). 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/line-breaks.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"923d9b0f534b9cb0eb282d041fa2d3164d60c0633856d90e31c0029f4fd5b1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.check (cognitive 71): cli.check has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (34 pts), ternaries 11 (19 pts), loops 10 (12 pts), boolean chains 6 (nesting depth added 25). Of this number, 68 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"93363313e7c821e3ab7dac936d21d9733ccb4179ee3b2e6778eb392631642002"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.nextBreakablePosition (cognitive 69): line-breaks.nextBreakablePosition has cognitive complexity 69 (threshold 15). Drivers by points: if/else 21 (50 pts), boolean chains 13, loops 2 (4 pts), ternaries 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5db40f9f6b9797f862875f5e3f6dfb965cedb2d45390f40edc62d370014065c"}},{"ruleId":"D2","level":"warning","message":{"text":"rich-inline.setEmptyObjectFacts (cognitive 59): rich-inline.setEmptyObjectFacts has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 12, loops 5 (9 pts), ternaries 2 (6 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece90dc180459dbfad259abf9fe585862a58ae006152b38622d209fa773683fb"}},{"ruleId":"D2","level":"warning","message":{"text":"predict.predict (cognitive 52): predict.predict has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 7 (14 pts), ternaries 6 (14 pts), boolean chains 4, error handling 1 (nesting depth added 25). Of this number, 37 points are the body\u0027s own statements and 15 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"76faf96d6be2db87556397a74c1b781ef15f9694068e84ce7268dfbd81696ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"store.caseProblem (cognitive 50): store.caseProblem has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 25, if/else 17 (24 pts), loops 1 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/store.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7093d9460d1b0e650bb2154435095d7b33386e396fae872cc9b614e9f0610cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"catalog.pairwiseRows (cognitive 50): catalog.pairwiseRows has cognitive complexity 50 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 10 (23 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/catalog.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef233da659fa2b9f70cd7a5e2f267f34a61159f982241ae820f31b58d036aff1"}},{"ruleId":"D2","level":"warning","message":{"text":"predict.plainDisagreement (cognitive 49): predict.plainDisagreement has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 11, ternaries 3 (11 pts), loops 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d9d99492f056149453c8f38f075293425baf2ea67904656d250ad9f930b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseArgs (cognitive 46): cli.parseArgs has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 7 (12 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5016089f385b4e0b5e6761f40e5f6371138fc3e74e67317defdb910b105b86cf"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 45): cli.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 8 (17 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 20). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb94767767e0317eb74ee4440d5180cbb30e9d8be5dee128cf613ae4da651f2"}},{"ruleId":"D2","level":"warning","message":{"text":"widths.select (cognitive 45): widths.select has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 7 (16 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5395e60fd3a3fa010a2beb63de74950852e648ccef8eb1c3e0f5b1a574e44854"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.build (cognitive 42): sample.build has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 3 (7 pts), boolean chains 4, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbbf3e1a5c4597926d9b4482e55eca1aa4a961a75049372e652b6478fcec731"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.getWebKitLineBreaks (cognitive 40): line-breaks.getWebKitLineBreaks has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (9 pts), boolean chains 6, ternaries 1 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c352542ae86be5b3e2bd4bb2248840a4178857e8e0c062e514fd8187e7c5a087"}},{"ruleId":"D2","level":"warning","message":{"text":"observe.searchLineEnds (cognitive 40): observe.searchLineEnds has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (6 pts), boolean chains 5, ternaries 1 (nesting depth added 19). Of this number, 35 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/observe.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b137ff0e751fab73c324ebae275e565b795fd4ca532530c49ae55586c44891cd"}},{"ruleId":"D2","level":"warning","message":{"text":"han-kerning.getHanKerningTrims (cognitive 37): han-kerning.getHanKerningTrims has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 8, ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/han-kerning.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2577ae24cdf971efc95455279a94e72fca7ce5752006eaf21af1388c12ec57"}},{"ruleId":"D2","level":"warning","message":{"text":"line-break.stepPreparedSimpleLineGeometry (cognitive 37): line-break.stepPreparedSimpleLineGeometry has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 5 (8 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec7b4f4d4aae888f62b901e46f0db204c4779aa9fe20bb61d2a2cbd07926370"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.drawSample (cognitive 37): sample.drawSample has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 12 (17 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4113a8dfdfe5f86cc4c0a1c0ac08938ec9e672c867bb4e8685b7a639e0fa72"}},{"ruleId":"D2","level":"warning","message":{"text":"invariants.runInvariants::plain (cognitive 37): invariants.runInvariants::plain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4, boolean chains 3, ternaries 1 (2 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (invariants.runInvariants, invariants.runInvariants::rich) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccbc18dc5a12feb2ba17b08bcc42f547740075cb09d59f14d8cfa82dfca94b5"}},{"ruleId":"D2","level":"warning","message":{"text":"offline-equal.outputs (cognitive 37): offline-equal.outputs has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 7 (23 pts), loops 4 (10 pts), if/else 3, error handling 1 (nesting depth added 22). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/offline-equal.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"718a91e879299542b042c13e454b08d5ac972fe2e2a53514da5ef21b80b2cedc"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.getSegmentFit (cognitive 36): measurement.getSegmentFit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, loops 2 (6 pts), ternaries 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a6f54c9165b8eedf97342a657f76465614eefee965b53dcd92989f260b82f"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.draw (cognitive 36): sample.draw has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 10 (13 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 12). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f63ad9ec9375ff02c6eea5b9728ef59e4347f6f761b9c6d1b4b7e6275101a64"}},{"ruleId":"D2","level":"warning","message":{"text":"predict.alignStream (cognitive 36): predict.alignStream has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8986812e669c6bab0086e87bd1703d169407ab41d8b8d4d5d9f2d89d6c6bb556"}},{"ruleId":"D2","level":"warning","message":{"text":"facts.factTemplates (cognitive 35): facts.factTemplates has cognitive complexity 35 (threshold 15). Drivers by points: loops 6 (21 pts), ternaries 2 (14 pts) (nesting depth added 27). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/facts.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5467240a828046d56cbf37b512472f30723d0e2d28dbe552da21f0caa888626"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.removeSkippableSegmentBreaks (cognitive 34): analysis.removeSkippableSegmentBreaks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 9, loops 4 (7 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99500ff4b6884e0402acbc5fcb0db3be5c1daea41fd944fd8f491ee41184371"}},{"ruleId":"D2","level":"warning","message":{"text":"line-break.countPreparedLines (cognitive 34): line-break.countPreparedLines has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2145b92a20dbd7bc8d41b183fb5bc29181aebeee1ae86292da22f3ddd62bb37"}},{"ruleId":"D2","level":"warning","message":{"text":"break-data.breakDataReport (cognitive 34): break-data.breakDataReport has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 7 (14 pts), loops 5 (10 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/break-data.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b26b7ba4ede0fd918aa5a7ec292ca33ee0047e0c039305933ff161c0123449"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.drift (cognitive 34): cli.drift has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 6 (7 pts), ternaries 3 (5 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":"harness/cli.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1928cd7b931b5d2dc7458362329e48f75605efa28a47743b55376808a3e9b31"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.mapSourceLineBreaks (cognitive 33): analysis.mapSourceLineBreaks has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d0762e53294c9464f482aa527b971ef4b68f9b4850ca9c73e1f6a2bc4b526"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.getFontKanaKerning (cognitive 33): measurement.getFontKanaKerning has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 4 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eb1c44ceef6b1798179327669d2f6bcebadeeab92d3a2ca3092b216e877552"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.loadPools (cognitive 32): sample.loadPools has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 7 (11 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"157b8f7552ac363c3d98c02c1f9c03703dd4e41425a17886bee91cc6f62a4684"}},{"ruleId":"D2","level":"warning","message":{"text":"score.judge (cognitive 29): score.judge has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, loops 3, ternaries 1 (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":"harness/score.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11768551807ebaf54a13c5fccf184717a7d17ca02cc23a824093e08a7b3e937"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.checkSources (cognitive 29): sample.checkSources has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). 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":"harness/sets/sample.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a45b19b4723a94a465980de0073dcc8d16ea23ed086e63afb103685612525"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.gate (cognitive 29): cli.gate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 5 (6 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78042e4048895159b36636af674b0ef9db34c6bf4a65cd14c74df6fe9d11670"}},{"ruleId":"D2","level":"warning","message":{"text":"invariants.drawnCases (cognitive 28): invariants.drawnCases has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (9 pts), ternaries 3 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8928710ac2682bf64a9025ad10b0a5f07e41d3ac80f33e929a9f68056eed0040"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.unpackClassRuns (cognitive 27): line-breaks.unpackClassRuns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdbcfb5c9de1c628bf12cb347e2a2ebc1580531e4db4eb5b67c60019aebe0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.record (cognitive 26): cli.record has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), loops 2 (4 pts), ternaries 4 (nesting depth added 4). Of this number, 25 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea49f08ca3c52a3c2424b0715ed9a88ac59a30757a4f9fe08c79fc5fe9cafa9"}},{"ruleId":"D2","level":"warning","message":{"text":"invariants.standInWidth (cognitive 26): invariants.standInWidth has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4776f49b574f5cadfd2abd592842f625557ae648a9263878b380eeb827b17a"}},{"ruleId":"D2","level":"warning","message":{"text":"observe.lineWidths (cognitive 26): observe.lineWidths has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/observe.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcefebac88fa2d056cf65077cecbd88ee30bba928244aff232f7018e7068c0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"run.runJob::step (cognitive 25): run.runJob::step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (10 pts), boolean chains 4 (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":"harness/run.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b7c3259d9c14643cd504aefcfd1f65ae0845d8c7e7910cac9e19fcae556ace"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.markDictionaryWords (cognitive 25): line-breaks.markDictionaryWords has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f19f998aa612a2444282b0db99da693884d49c978f01b8e455a6e71a7aa710"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.demoBlocks (cognitive 25): sample.demoBlocks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (visit, add). 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":"harness/sets/sample.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd78f4ebaa1c59d7150237719c0037c7b2bec1b5f8ba8d3a3f2b9b6a6c5488c5"}},{"ruleId":"D2","level":"warning","message":{"text":"predict.richDisagreement (cognitive 25): predict.richDisagreement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5112ae760abc7c86299af507a308d5933a170e2ad050bd0a0e81316efec75a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"widths.survivors (cognitive 25): widths.survivors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (9 pts), ternaries 1 (2 pts) (nesting depth added 14). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b43af9d973735cf3db7d98b3489302da6fd6ae093b92a2177344fa0b0dc567"}},{"ruleId":"D2","level":"warning","message":{"text":"predict.paints (cognitive 24): predict.paints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a480bf2bbbddb93510b15487b5bc7910d1972be088f558adcbd7d91ece7ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.getWebKitGenericFamilies (cognitive 23): measurement.getWebKitGenericFamilies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (7 pts), loops 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d1567c427ed6a8a7794af21c9fa5a25d21508ede0833a1d2300e6d879f457d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.explain (cognitive 23): cli.explain has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 5 (6 pts), loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec630ff9a65274aa624feb133c4a2a261c6dbe3b69bef4168e681fccafbcff8"}},{"ruleId":"D2","level":"warning","message":{"text":"widths.bisect::nextRound (cognitive 23): widths.bisect::nextRound has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae52a88a7c1230daa5489284e081922b66b77c8baaf4ca4aa38392458d8412f"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis.getWebKitParagraphBreaks (cognitive 22): analysis.getWebKitParagraphBreaks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9e610f6597998e2630946e3786df8ce21474f1730345e7e80a4d6b35850e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.readScriptRuns (cognitive 22): prepare.readScriptRuns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prepare.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"89df496bd2f0e518f56f5f79ed6555077d0a9b0a916eefaa511f34b55f9b1e34"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.shouldBreakFast (cognitive 21): line-breaks.shouldBreakFast has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, ternaries 2 (6 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/line-breaks.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8caf5e4849f30543e188f7aff6efa26a4b452b33d87cbc1412df86ce102c7"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.buildEngineProfile (cognitive 21): measurement.buildEngineProfile has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 15 (20 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"59071911d3ee103649a422bd3adbd4b143d22db7ea33670d63b4a6f22fc7d587"}},{"ruleId":"D2","level":"warning","message":{"text":"rich-inline.materializeRichInlineLineRange (cognitive 21): rich-inline.materializeRichInlineLineRange has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 5 (8 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ca8132e3d91bde4ad14d8953948e8adf4cadcd317e9a3885dfda97fb7b4de5"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.inlinePieces (cognitive 20): sample.inlinePieces has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 2 (4 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d931e5220ef9c8b63467d777b93881a96915b79c5dad9df68c54f53dc8ee9fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"sample.familyFor (cognitive 20): sample.familyFor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (15 pts), boolean chains 2, if/else 1 (2 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ca134017c81ac65e9e40d64fa351f328d45c4829d81fd68917ac0e6dd9fe12"}},{"ruleId":"D2","level":"warning","message":{"text":"graphemes.findGraphemeEnds (cognitive 19): graphemes.findGraphemeEnds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/graphemes.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d9b8ed04c45a1dee6e23add894795cdb0c1673a83050591ccf0be008568753"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.addIdeographicSpaceHangs (cognitive 19): prepare.addIdeographicSpaceHangs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prepare.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1f52221a7caaac90a5ddb90d9459ba73489a5f66bbb8e2ee066cb523f87de5"}},{"ruleId":"D2","level":"warning","message":{"text":"rich-inline.getOpeningFit (cognitive 19): rich-inline.getOpeningFit has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, ternaries 2 (4 pts), if/else 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b43d9dd74190390ad4b85c9a1f4b9391c57d95fbfca800da28812d6aeed695"}},{"ruleId":"D2","level":"warning","message":{"text":"catalog.classSamples (cognitive 19): catalog.classSamples has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/catalog.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae600a4e6eb863def29e53decdab05492f4e3758ab9cb6ae1adb31adbbf8da6"}},{"ruleId":"D2","level":"warning","message":{"text":"line-breaks.getBlinkLineBreaks (cognitive 18): line-breaks.getBlinkLineBreaks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd36858f278053bfe770dbf741478801d73907d4ce39794b1cd66dc632109c6"}},{"ruleId":"D2","level":"warning","message":{"text":"gecko-line-breaks.getBreakStates (cognitive 18): gecko-line-breaks.getBreakStates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d6b8d2f1d25b73030f8e5af50aadcf83cf07771bca07bdec969a30ca6245d2"}},{"ruleId":"D2","level":"warning","message":{"text":"han-kerning.getStaticCharType (cognitive 18): han-kerning.getStaticCharType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/han-kerning.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d9d54c8905711ffb54a0bc44745d9422f40c7238731a1bafa76bf0b93bafe4"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.getEmojiCorrection (cognitive 18): measurement.getEmojiCorrection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9934f857489695e7bfc4afbca0e7993bf29cf14e85223eef14d565202c48198"}},{"ruleId":"D2","level":"warning","message":{"text":"line-break.getTerminalLetterSpacing (cognitive 18): line-break.getTerminalLetterSpacing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"600c8d92d36266b8f5852b1f067037ba6202bafdc8b9353d2e479a08df78221c"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare.addKanaKerning (cognitive 18): prepare.addKanaKerning has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prepare.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"77560a340a4f15c6e9f36a24826d8c82fe0f6499ce7953fa317deb45a6db0194"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.getHyphenText (cognitive 17): measurement.getHyphenText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a38e86e61cfe8bbe460b3009c3066a425e4e692c488cc5d7372063c6926f58"}},{"ruleId":"D2","level":"warning","message":{"text":"measurement.getKanaKerning (cognitive 17): measurement.getKanaKerning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd44ded3e9bc2fa099e6bbe23a77520e0a0da207cc1463b284eb71a7d621b29c"}},{"ruleId":"D2","level":"warning","message":{"text":"line-break.normalizePreparedLineStart (cognitive 17): line-break.normalizePreparedLineStart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1cc55b913b60b68469d93363482aef584aa406b0e591a6ca89c4f3ecc16615"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.equal (cognitive 17): cli.equal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (5 pts), loops 3, boolean chains 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4f3c8396b248b8b71ca04feffa2cfe00b2de0eb00744fe8a7e8a8c5a66382b"}},{"ruleId":"D2","level":"warning","message":{"text":"score.score (cognitive 16): score.score has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/score.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a60987c1f95f1e7a24c0b9b98d082436e73151c4be98962eba821c2a2f0bfca"}},{"ruleId":"D2","level":"warning","message":{"text":"gecko-line-breaks.setupClusterBoundaries (cognitive 16): gecko-line-breaks.setupClusterBoundaries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (3 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/gecko-line-breaks.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"866bba638e2249b87c190fee55d46f6bed3306d4819c31a5a285489835e0ace3"}},{"ruleId":"D2","level":"warning","message":{"text":"gecko-line-breaks.segmentComplex (cognitive 16): gecko-line-breaks.segmentComplex has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"538802ebdc04005c4bdf2b88351a53e78e5f5d59d00aa62a0f4d1417fc07b8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"predict.unsupported (cognitive 16): predict.unsupported has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"56630d51b0148e3e3453efe81cfdab16f360926fe806fc64431ed22ef5fb1601"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: line-break.walkPreparedComplexLines: FunctionTooLong \u2014 walkPreparedComplexLines runs 357 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 257 over it, 3.57\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/line-break.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17b9e0792d9a657593e803d3145bd80f82ac758b1d3be88ebf1dcf0a8596f67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: invariants.runInvariants: FunctionTooLong \u2014 runInvariants runs 310 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 210 over it, 3.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2cd398f5393f03176509d99447245257bd2d0b28ba4e21bbd347966e0db0b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rich-inline.prepareRichInline: FunctionTooLong \u2014 prepareRichInline runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"441330eab216451854e6f32c10b5c36b15bdb0f8c74ee5b93169c87951e3a4cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rich.richTemplates: FunctionTooLong \u2014 richTemplates runs 261 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\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":"harness/sets/rich.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ce1ef5b777781b9d66790d9f87d28a63d6822e6fd11846fa506540956f46a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: prepare.measureAnalysis: FunctionTooLong \u2014 measureAnalysis runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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/prepare.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa676aa8802fbf431a9428878654af45cd87dd8bf08f8146789f0d9a80a4817b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rich-inline.ts: FileTooLong \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 244 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dcfbb22240927474c6ffa1b27ec198e272c2180425178f084c3c3b88b0a306"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/line-break.ts: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db92725096411c344317cc0ded885668cd57c52784d3982e2c9561e86ad9bf5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/measurement.ts: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"addc791baead1f637c71db0d390647629a48bae4e6e3a48881a0e7198a9a9b34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gecko-line-breaks.markWordBreaks: FunctionTooLong \u2014 markWordBreaks runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c62621f46348480330dd98059d70f2e878f500c089da2cc65c5c39a403dcad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/cli.ts: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16abc26ad55d6dc63af9752f546382218763aa6a7649c2a32b719a56251e3008"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/line-breaks.ts: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0acc67c6242300b1c808586bccb33f301e051afdb52fcf4d4836ecbaa725fbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rich-inline.createLine: FunctionTooLong \u2014 createLine 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/rich-inline.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"7082364263d380985c2b6d6456cdc9b466fc8ed443addbf5a7e740b418424c19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sets/sample.ts: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0909b30d7d47d982aa8bcc504e7231681e4b147c06ff2d169b13df94bbb5d7b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/line-break.ts: src/line-break.ts changed 109 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 263 in line-break.walkPreparedComplexLines at line 464. 2 of those changes were fix/bug commits, and the other 107 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/line-break.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/line-break.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca63ae5884d9fd9066b59f2f88aff48ffb108d3cfe40852baf2da0dd9f2f829"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/rich-inline.ts: src/rich-inline.ts changed 143 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 187 in rich-inline.prepareRichInline at line 186. 2 of those changes were fix/bug commits, and the other 141 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/rich-inline.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/rich-inline.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e67eb78072c90e9e5e4d7de3d59d028e2fc0b23b319fbae30858069aa6bc0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/prepare.ts: src/prepare.ts changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in prepare.measureAnalysis at line 352. 1 of those changes was a fix/bug commit, and the other 87 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/prepare.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/prepare.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"457498de6b6abeaca612131857ef97068253a22520d0b5a14be790283ab96c6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/analysis.ts: src/analysis.ts changed 100 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in analysis.segmentAtLineBreaks at line 334. 5 of those changes were fix/bug commits, and the other 95 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/analysis.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/analysis.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d251427cadfacd46c81c237a22a8a88268dfad7e85ee61b651a56ff5710305f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/invariants.ts: harness/invariants.ts changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in invariants.runInvariants at line 213. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/invariants.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":"harness/invariants.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edda1573fb646e023741a75e9102d1cb21cd964d955da480e04438eb1d5ab35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/measurement.ts: src/measurement.ts changed 139 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in measurement.getSegmentFit at line 1193. 3 of those changes were fix/bug commits, and the other 136 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/measurement.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/measurement.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23beb367aaaaebed735c6a0dc1ce7ac00e3195979b9076fe17b793d8b0e4a57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/cli.ts: harness/cli.ts changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in cli.check at line 274. 1 of those changes was a fix/bug commit, and the other 51 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/cli.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"733badfb21f842f86858cfea528adb4484cca37df26f57b792858770bddfdd4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/gecko-line-breaks.ts: src/gecko-line-breaks.ts changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in gecko-line-breaks.markWordBreaks at line 448. 1 of those changes was a fix/bug commit, and the other 36 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/gecko-line-breaks.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/gecko-line-breaks.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3b92e520253d6931b3ab979cbd3840009a994f8bcbbc35a37920e0ace45d7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/sets/rich.ts: harness/sets/rich.ts changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in rich.richTemplates at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/sets/rich.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":"harness/sets/rich.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"82421fe4ee6ba6bb373ff2f081e42da8a41d1da675ae2b2ec10de32af6635c6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/store.ts: harness/store.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in store.caseProblem at line 206. 1 of those changes was a fix/bug commit, and the other 15 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-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/store.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":"harness/store.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca756fc93ddc1e7760faf781f50baf39251d8474ff352b1e56e77d8b7503c92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/predict.ts: harness/predict.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in predict.plainDisagreement at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/predict.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":"harness/predict.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19ec6fc88d9568113e915a22f30d7e4c4fdeb13158d1245578af0a986cbdf4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pages/demos/editorial-engine.ts: pages/demos/editorial-engine.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in editorial-engine.render at line 623. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- pages/demos/editorial-engine.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/editorial-engine.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ea602c692e740cb65f1fa6f52a10e96bf165c31dc8820ec196e16346075772"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/line-breaks.ts: src/line-breaks.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in line-breaks.markRuleBoundaries at line 328. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/line-breaks.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/line-breaks.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f299a34a0be42aae40540decd7fa317062194e4423ae7054bde01ef2ce1b1a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pages/demos/markdown-chat.model.ts: pages/demos/markdown-chat.model.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in markdown-chat.model.parseBlockTokens at line 343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- pages/demos/markdown-chat.model.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":"pages/demos/markdown-chat.model.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"258900f6165768634cb8471fa1885b372ec090c140438b7b38cb8ea636fbd439"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/run.ts: harness/run.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in run.runJob at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/run.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/run.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a919ab6df25af2971c401252c1c5138914838a3abb6be1f03de4b61828d889f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/bench/run.ts: harness/bench/run.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in run.documents at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/bench/run.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/run.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25b0279b67c93756a97a8396e31e628e39507bc2f80dedc26667df704a9077e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/han-kerning.ts: src/han-kerning.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in han-kerning.getStaticCharType at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- src/han-kerning.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/han-kerning.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2aa8d553698a8d8bce5bfdc96b26961d2726538aada0ff9851976d5b0b5548"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/sets/widths.ts: harness/sets/widths.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in widths.cut at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/sets/widths.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":"harness/sets/widths.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a458088e226b208de9912fff2c35b64b53a88cf3e29ff16de84ce0bd01c07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/score.ts: harness/score.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in score.judge at line 408. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- harness/score.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":"harness/score.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eba806b93c40e8cfe48ccf49ae35a401c53f80a12285f77b615e11cd00a4655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pages/demos/ellipsis.ts: pages/demos/ellipsis.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ellipsis.render at line 240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-17..2026-10-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-17 10:02:17 -07:00\u0027 --until=\u00272026-10-15 10:02:17 -07:00\u0027 --full-history --no-merges -- pages/demos/ellipsis.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":"pages/demos/ellipsis.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfa35003efa61cc1e5bef9bd52074ae169858bb52e52b88336eb82d0a84ed46"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060package.json\u0060 makes this repository a deployable product (line 55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Paired ratios: a label\u0027s cost over base\u0027s in the same round, a ratio a round.\u0022 repeats the code it sits on: 6 of its 7 words (ratios, label, cost, base, round, ratio) are already in \u0060const ratios = (rounds: readonly Sample[][], label: string): number[] =\u003E rounds.map(round =\u003E cost(round, label) / cost(r \u2026\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":"harness/bench/report.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bacdbc81f3f9deaaa3a9669ddb1a13c2f4ed43e509dbb6f0181f58103a0fe3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Per call: a label\u0027s units are one.\u0022 repeats the code it sits on: 3 of its 3 words (call, label, units) are already in \u0060doc(\u0027new\u0027, \u0027labels\u0027, STYLE.labels.lang, STYLE.labels.font, {}, [{ op: \u0027new\u0027, batches, batchUnits: batches.map(b =\u003E b.len \u2026\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":"harness/bench/run.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d79f9109ed4393507d2c53728a74ebb188098d8ca57fe9124b8093c90cab387"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The cases, and each case\u0027s set: the name of its case file.\u0022 repeats the code it sits on: 4 of its 5 words (cases, case, set, file) are already in \u0060function loadCases(files: readonly string[]): { cases: Case[]; sets: Map\u003Cstring, string\u003E }\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8698f94e1bca559003bc830c6e13e175d6d1fd1afb17a02c19e05c27fdb447"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The old-gate set, by its cases\u0027 family.\u0022 repeats the code it sits on: 4 of its 5 words (old, gate, set, family) are already in \u0060const old = { family: \u0027old-gate/arabic-brackets\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":"harness/harness.test.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c557722ee9dde440f4326c7e110bbb6d4c91ac37ee13d81aa432f0b345eede"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The counts over every pinned case, as they printed before the tiers.\u0022 repeats the code it sits on: 4 of its 5 words (counts, pinned, case, printed) are already in \u0060expect(printed).toContain(\u0027; 50.00% where the browser wraps; 25.00% with a wrong height\\n    every pinned case: pass 3 | \u2026\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":"harness/harness.test.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6a256a92c635de395a6bcf1facad632d85e5a7d642a1a0e19d31a938ed5d1b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022layoutNextLine builds the text of the same range.\u0022 repeats the code it sits on: 5 of its 6 words (layout, next, line, text, range) are already in \u0060if (range !== null \u0026\u0026 offsetOf(range.end) \u003C 0) return \u0060layoutNextLineRange line ${i} is ${showRange(range)}, outside the \u2026\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":"harness/predict.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f426e3049c224f3f069ffced9965f0c716b6ca81983d61d613e6cb282ae0eb53"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The same for rich-inline, against walkRichInlineLineRanges\u0027 lines.\u0022 repeats the code it sits on: 6 of its 7 words (rich, inline, walk, line, ranges, lines) are already in \u0060export function richDisagreement(api: LineApis, prepared: ReturnType\u003Ctypeof prepareRichInline\u003E, walked: RichInlineLineRa \u2026\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":"harness/predict.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0392a8395f6ca6ea62a5eabfe128fc3f584313587f14c21ef7441b7297ea8c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The share of the weight of the draws \u0060among\u0060 picks that \u0060of\u0060 picks too.\u0022 repeats the code it sits on: 4 of its 5 words (share, weight, draws, among) are already in \u0060export function weightedShare(draws: readonly Draw[], among: (draw: Draw) =\u003E boolean, of: (draw: Draw) =\u003E boolean): stri \u2026\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":"harness/score.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cab94888485893bf7fe60ece7130d18da47a14bd5155d47575255b0117dfbea"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022An accepted failure: the reason it was accepted under, and the failure it was.\u0022 repeats the code it sits on: 3 of its 3 words (accepted, failure, reason) are already in \u0060export type Accepted = Map\u003Cstring, { reason: string; status: Failure }\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/store.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b2a1a29bcc00f42146201c3ca1f4179ec6c8c0eb3b0db4f0a22792da214dff"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Where grapheme \u0060graphemeIndex\u0060 of a segment starts in its text.\u0022 repeats the code it sits on: 4 of its 5 words (grapheme, index, segment, starts) are already in \u0060function getGraphemeStart(prepared: PreparedSegments, segmentIndex: number, graphemeIndex: number): number\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/line-text.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5065e3b0f475adcb58707a3be5cadbaf099f745a4177a3795f57475b63334a3c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A text\u0027s width in the font, less the emoji correction.\u0022 repeats the code it sits on: 5 of its 5 words (text, width, font, emoji, correction) are already in \u0060export function getTextWidth(text: string, measurement: FontMeasurement, emojiCorrection: number): number\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/measurement.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a1b0221f2de84ceda9b15b66a4c01bdce7c833618395f3a42564c67b33014e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"781214c1da808d575116bb01553961ddc8988da13fddb43ada338aef61f3d2ab"},"properties":{"commitSha":"36ce24d56bf5aad95eedd0f76f9e41d4d14023ea"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b9b05b806fad8c53ffc7393c35b0070367f413069384b924877c10eea890ebd"},"properties":{"commitSha":"120cf900428c706026ce731f900e783f905186fe"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46ed5088e372a1645841089d14aca0a25845741310820ce62e7cb1a6cd16763b"},"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":"4fd1bf349e9e261b9e801e13eb43ad5155f3f1454bd7b93ad861b53884c5c18b"},"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":"29a123e5ded039aafc5f9608aaec5c5e039833e07d8997aa993c9ad344fa17f1"},"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":"e4cb465e1f0d2eae4c574d9bbda594dca37b461c20ca4391a9a1ab1fb76b76e5"},"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":"34f998d59eaff18b05f62f3ffd53eb1d86ddd758e021a3b06f3dd141181d69a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1adb7623990a68e816d3b6cf50228d263614987bbb2282f5a33b4107da357396"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dea3421cedd888fa4459d5189616997b44609555020106963a18172a307310ba"},"taxa":[{"id":"CWE-601","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0351efd81a6132a7b15927bfc6e17e901d7da98cc8ef138adf7fd87a81222ef"},"taxa":[{"id":"CWE-601","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72eeadc50bae814e483e64ef073652fac05f40902026e87ae030dbd0c3bd05bf"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14df2a9206c42a0834fe1cf274906606b9854593007dc48da114d04121398b5a"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ef8663144438b47d99b64c78fb91a2ddee072e15836096ad76db527148a91d2"},"properties":{"dependency":{"package":"smol-toml","version":"1.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe5faf496d2e13fc3410c1b7b538e2a11d29abc74f2c5b93d49330a2a833b43a"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: han-kerning.ts \u2194 rich-inline.ts: \u0060src/han-kerning.ts\u0060 and \u0060src/rich-inline.ts\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060605b04d2\u0060 Pass measureAnalysis() its paragraph from every caller, with no defau\u2026; \u006018fcc9f6\u0060 Type a pair of marks that two items split once, and ask no font where\u2026; \u00604bd41113\u0060 Name the Blink function the pair halt follows \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/han-kerning.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4c048cb86de6bb434459d0c07003d2d96b0ba813b23fa39c42db12a53ebdf5"}},{"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":"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":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 34 JavaScript/TypeScript, Swift production file(s) this check read across 2 module(s). Each was searched for its ecosystem\u0027s logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Swift: os.Logger/os_log/NSLog, swift-log, CocoaLumberjack, SwiftyBeaver, XCGLogger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 1 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":[],"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":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060benchBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/lib.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d23147e235b9efd1a549a97a71950f374c2bf3060b876111f8ec89e92f38e97"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060benchBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/lib.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30f1ecacbea012c4c6ac020573efbad16d20abdcb2c65dc74dc38621122a91a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.gzipSync\u0060 in \u0060benchBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/lib.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79f44aef0a3a79f898c3951dca9182b1a82d80e941f248774e9a494b19184cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060bench\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/run.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c664fbefa256a8c8f6fa4ce950a68cf68f0a737ee4264571a3f3b897982f9ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060bench\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/run.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"640f6063977ccb173108fc295c78bb0cdf66a304466fe874e5caeaf0390fc595"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/bench/run.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe3d0c395af5cd4c27f2a97b1e32386864cb5aad2484e26099b16e058c56c55"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060same\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e50b4dc664a0083bdf2d4f1def0cc20badf3e045ec971e5b30f35e0f6cd7a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060openApp\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"db45a08330516adebe035a54a9d16544c375a61078ea5b6c33f979f188373799"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060cleanup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"318e648dfd3fdf82e6bb4f69cffd51407bb6f916075b0a4d78efafd7f647dcb1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060launchChrome\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d184522e9b31b919840de53f931eecad89433d8a6e3b983c700de0d72aa22899"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060launchChrome\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f01846050b3e1e2218d59cad232ae757c6943a71d5691a19065cb6e9bdb45a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launchChrome\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c578bd1d05d45194ffde34600aa7e6ab0d2bfb68cf05dbf51128c1bc6a238"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launchWebKitHost\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"152e5cfdb1706c055b4541b1bacc04a1762f0a11226aea8798e44e6d473e45d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060remove\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bebf6ffd7dcabd42a1d1622a3d2c61d3f9710136eb97cb73a10b1c51c101676"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060record\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1bf219a54c48b155216ee0e98bf840b31c85bf6cd09359ec99f3f8356e9f38"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c03bb5b9305764fccbc30350abdebb32208bb8632884c08f2816f0d9759f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060drift\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"724284710f3ac75a67d5abebe2f9d3ce36d261c9fb1056d9f60e039d16e133b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060drift\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ef0e27cc7377ae0f114699a7458b7c651b8fbeba2788078926c065e3855712"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060drift\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a78984223932aabadfcb5f6714024e5b2ed85d311454c005cf75b55285ddaef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060drift\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"843de25bd0d5c6f97cc895dc78ad93f6c008795db64431d8963358a2a7200deb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060drift\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8caf387c350e50f03b0e612b22207c71f818f5032b39fc3dd2f89fe963bfade"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"76688828fb5350d411207b40c4d5fc879d289201ab4ae849bb8fd4fe02ff626e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a36c298160994c0210d9a622801fd82b435de96d12c637f8c7aeab39b7b09a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060bundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/run.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdea25fbdff37f2c50bd8ce0f7bab5a4c22896c6f5e6b589f7adb4971cff67d0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060fetch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/grapheme-check/run.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32f708ae746fdd085b30af3f62e315b4ae0e1448abb645ebc3e7dd76f156681"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060fetch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/grapheme-check/run.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ece9b8d8ab6273c0cbea3151d28422df62f791525c5e9794edc5d237270ac1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): harness/invariants.ts:250 \u00B7 harness/invariants.ts:336 \u2014 the two spans are one implementation copied and then locally edited \u2014 200 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":"harness/invariants.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a28abb3325ab8379c3b16600ca499545815022da8e4f6d45755622bbbdc874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/rich-inline.ts:993 \u00B7 src/rich-inline.ts:1017 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4245322cac2a4c3946573156642af28b2ab29d8b528206e5619e4e4d2b206d61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/package-smoke-test.ts:40 \u00B7 scripts/package-smoke-test.ts:69 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package-smoke-test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbe1bdbca92e10e0e4ada41ee42f91de945af227317fb21e3936b74d37763df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/layout.ts:300 \u00B7 src/layout.ts:323 \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/layout.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c2b0b23fad1983e5853af3afc40e63642bc89ebf564da5a5e237ee12ad7191"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/generate-engine-break-data.ts:891 \u00B7 scripts/generate-webkit-generic-families.ts:200 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b07da1d3390b9c5e3ef3d7bf83a6ef8cd8844bb62536d469074c616cd331e1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): harness/store.ts:150 \u00B7 harness/store.ts:165 \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":"harness/store.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0acea603d3ab9a640908bd742fc25dcdb2f5fe84309a0e22637d13d547c8f0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/generate-engine-break-data.ts:89 \u00B7 scripts/generate-webkit-generic-families.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1908c5acdda215251f54e4743aa6604351c32703e0a50b88f543d49d0cd85827"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/gecko-line-breaks.ts:484 \u00B7 src/gecko-line-breaks.ts:552 \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/gecko-line-breaks.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5436a80501d7ac26c1e21ac1a3dfc8737c9af28feeceb66f660068ea7435ccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/invariants.ts:284 \u00B7 harness/invariants.ts:306 \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":"harness/invariants.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"318aae8203c86da0619ff9ad910acdde7d2711925ddef5dbc5a5db58c1ee6a29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/predict.ts:206 \u00B7 harness/predict.ts:267 \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":"harness/predict.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28200877d1e753d614ebad0a55a04a03d3773993167747e226c2d1b58005056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/predict.ts:399 \u00B7 harness/predict.ts:413 \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":"harness/predict.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaccceafc9e1bf5d48ce8c6b268657ef2495d91ee9156a558651f2ed2cd8e4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/sets/rich.ts:401 \u00B7 harness/sets/rich.ts:523 \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":"harness/sets/rich.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f857a235fcc9faca7dd57a5f7de0a76f5aa99a7e749c7d1e3a22ba70fa5bfbe7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/generate-engine-break-data.ts:809 \u00B7 scripts/grapheme-check/check.ts:85 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eef158f93fcefcd7ce82ff613324c29c13f2a1ff89f9234204fe77e0c3fb7aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/grapheme-check/check.ts:69 \u00B7 scripts/grapheme-check/check.ts:112 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/grapheme-check/check.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"825cb765d63a98dc2d013e86ae0e52571bceb6c81b45abb42e39f2f7f4c4cc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/gecko-line-breaks.ts:69 \u00B7 src/gecko-line-breaks.ts:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a443865ee797d2bdeb6dfc07c7e8eb0956497d98f63b299661097844445f79b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkPreparedComplexLines (cyclomatic 264, cognitive 749): walkPreparedComplexLines has cyclomatic complexity 264 and cognitive complexity 749; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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-break.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09452545c6da3f0a84ada71e2a29aed787e24ee70177aec95db7a950e895bc0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareRichInline (cyclomatic 196, cognitive 350): prepareRichInline has cyclomatic complexity 196 and cognitive complexity 350; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rich-inline.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab64a28e4618a9a4fcb69f6b4a1cf1f69b70f7e13fa7a9a40bbf797dae1ddd69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureAnalysis (cyclomatic 114, cognitive 194): measureAnalysis has cyclomatic complexity 114 and cognitive complexity 194; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/prepare.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7e603d4f3fd937bc95829777ec3969b2d212cae7c1fa5d33c0a3c41eaccdbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 98, cognitive 110): classify has cyclomatic complexity 98 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"373452efdc734beb7fb698b51356f3e3556c9191b2ae88f2b2816a324db3c96c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 65, cognitive 130): (anonymous) has cyclomatic complexity 65 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1d65eaa5031ee05bd068a58008a7dbf270ed9c38a8d33e9cd406e01a34285d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function segmentAtLineBreaks (cyclomatic 65, cognitive 94): segmentAtLineBreaks has cyclomatic complexity 65 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/analysis.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef84913102c147ac1e33faef8db43f465d0aa205bd63d064bc7153536afeda3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 64, cognitive 98): render has cyclomatic complexity 64 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/editorial-engine.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf1d86124e57c5f54e1d1eb67de83d62e09bd8c030dd75ae2249a64347a3296"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markWordBreaks (cyclomatic 62, cognitive 163): markWordBreaks has cyclomatic complexity 62 and cognitive complexity 163; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/gecko-line-breaks.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"631237cd73c2de6da55704c614cbc44d718a54ce58804c377c4c083510a1e7f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function caseProblem (cyclomatic 61, cognitive 53): caseProblem has cyclomatic complexity 61 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/store.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"22210126bb2d37e4fdf917397879a0357b2e11d7e968d8d6a0ddd39b3190ff1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createLine (cyclomatic 52, cognitive 108): createLine has cyclomatic complexity 52 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rich-inline.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"14feb15a639b7c12540f373ba73fbf965f95017ce41c8c98dfc74dd5ec56dccb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeText (cyclomatic 51, cognitive 121): analyzeText has cyclomatic complexity 51 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed1a160b083fbab3c6a45492e048699ca2a9854d46cdd609cb23b5a3272d76a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function richTemplates (cyclomatic 46, cognitive 68): richTemplates has cyclomatic complexity 46 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/rich.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6c8e12696b41e754f09d38ff69b134a37f88bb3632e7741c9ddaa2fcb8bde5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 45, cognitive 68): check has cyclomatic complexity 45 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3ab62add4cdae2813aa2ddca4f72af85bfefc9a7bcbfa97297cc5f20642c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformText (cyclomatic 41, cognitive 96): transformText has cyclomatic complexity 41 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/gecko-line-breaks.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2dbedf940b4732ede5767803626af852973261d5a928504aae162888bac772"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextBreakablePosition (cyclomatic 41, cognitive 69): nextBreakablePosition has cyclomatic complexity 41 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"089762a6bd2c2996f59798259b438176d28d819edb182d66ca5bb3ae34d73374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 40, cognitive 69): build has cyclomatic complexity 40 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6cb188477a09f67028bdb631cdde498e478c5214d27f3e78183a00c33bce55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setEmptyObjectFacts (cyclomatic 39, cognitive 68): setEmptyObjectFacts has cyclomatic complexity 39 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"083d4fefbfa331492796d234d11ed3b928b9621b565dfbbcbec785634bfe8043"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plainDisagreement (cyclomatic 39, cognitive 54): plainDisagreement has cyclomatic complexity 39 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b5f3e1a4f8d6ac59ff7f936e4810d2cfe60b51adc0872e74e1f612e29f2077"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 64): (anonymous) has cyclomatic complexity 38 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":6110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d74487934f9da53cebdf578a89dc36b33da0c3ae710ad28ef5cfd94e1b533b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isWideCharacter (cyclomatic 38, cognitive 37): isWideCharacter has cyclomatic complexity 38 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6760474ef96f37500c839f565f8600eef1e5adaaf9f3d2f83e5710d0ae23ac46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 35, cognitive 54): parseArgs has cyclomatic complexity 35 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71650d9f43c86f95e9a211d67e483d870daddc3b99ac4b850e568ea814080da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cut (cyclomatic 34, cognitive 84): cut has cyclomatic complexity 34 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6930c0a8dae9d5a92007d0e685e261508ed91129b0789ab102223c9c9aac081"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 34, cognitive 45): main has cyclomatic complexity 34 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b7f59c3126e57d61d6604b29a97a5c0d3312bed9559065c667c7b65fe257b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInvariants (cyclomatic 33, cognitive 83): runInvariants has cyclomatic complexity 33 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6d0af61eafbd81028413c0ebb867ac6257f62c952d575b981f568e2acd4bde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeWrapHull (cyclomatic 33, cognitive 51): makeWrapHull has cyclomatic complexity 33 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/wrap-geometry.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"34df8245c6ed32114247563174bd203d69058573fceede4af48780b0e8dacdee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 31, cognitive 38): draw has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1298c9bdca4b8fec485b0a9653e96eb585159b3721421e6f0083a18ea8a68a15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepPreparedSimpleLineGeometry (cyclomatic 29, cognitive 50): stepPreparedSimpleLineGeometry has cyclomatic complexity 29 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"35381926258193cb8e4873267344fa87134b63523d240901c76f2d885d7d630d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markRuleBoundaries (cyclomatic 28, cognitive 78): markRuleBoundaries has cyclomatic complexity 28 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d668c854130fda652f1c5ed03a178e1a96b62fd06e16ac04d45d632780495e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drift (cyclomatic 28, cognitive 35): drift has cyclomatic complexity 28 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1f9f2df7927d3d3e4b31520f8c976c1d95f51e5a1af1f9e9408a8f4b5e0661"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeSkippableSegmentBreaks (cyclomatic 26, cognitive 33): removeSkippableSegmentBreaks has cyclomatic complexity 26 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b520ffdc8ce693c7e5f5460bff4efb8210d6433e5b4541dccd1e67263a737c7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function explain (cyclomatic 26, cognitive 31): explain has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"b976016c71bd04e8219f59322c668a8536fa72b1972e85ecd230f7fda9e49076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function standInWidth (cyclomatic 26, cognitive 31): standInWidth has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e61220982c1156334140981144403c0936f3ba0f528ef78335f4739da5bac12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStaticCharType (cyclomatic 26, cognitive 19): getStaticCharType has cyclomatic complexity 26 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/han-kerning.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9784e8713a371374280d1e8fcaec07d3a77e4ea6e6c58a038fb20064533bbbd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 37): (anonymous) has cyclomatic complexity 25 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"21616d35215f0d3ad7f543e33135f1f835b11bd85c9ac5530b77af8ca06f578b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 25, cognitive 27): record has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"576439451e0a55a2dd92ebdb46e04fef4b484e8450e4cefb91038af78dcd5d26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlockTokens (cyclomatic 25, cognitive 26): parseBlockTokens 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":"pages/demos/markdown-chat.model.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"473c07f05c27689ddef52a7f97d1e0908ac9f3e7f32430f76c8db196fc97680c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSegmentFit (cyclomatic 24, cognitive 39): getSegmentFit has cyclomatic complexity 24 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"957b66f4c6a3f2d48457dc9887d4a1b89c49d51669c613d25d2476d9935a1164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gate (cyclomatic 24, cognitive 29): gate has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b3cf19231cb5b1aa4518582da0644f04c423035e43add7e55a5eb035bdf88f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGraphemeCheck (cyclomatic 23, cognitive 46): runGraphemeCheck has cyclomatic complexity 23 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/grapheme-check/check.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbac30f58eb7d224d1a64be7bc3def8bad263651af7b46d5e51ddfd09bc4f7c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getHanKerningTrims (cyclomatic 23, cognitive 36): getHanKerningTrims has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/han-kerning.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a83bc6f536de48884399b035d672cba3f73f6cf57e728b6e561d8bf421d14c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 23, cognitive 32): value has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":6126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c70ec58a60df1f3c773a3538b0ee64584dad4af9b671747b2451cd8e27f04fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAssistantMarkdown (cyclomatic 23, cognitive 10): createAssistantMarkdown has cyclomatic complexity 23 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":"pages/demos/markdown-chat.data.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0406b10b255de86c19f5eb8db039fce2af50eee2a1b25663b022f00352ca198e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alignStream (cyclomatic 22, cognitive 40): alignStream has cyclomatic complexity 22 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ceb2a785a3aa4df56ff02c0c968e733de0bee4bac844787683aed7a6ccd2a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWebKitLineBreaks (cyclomatic 22, cognitive 40): getWebKitLineBreaks has cyclomatic complexity 22 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25da9bdc3c7de4676490ad797c6533da0c1b96f876bb1bdebe1df84ddaefe20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawSample (cyclomatic 21, cognitive 37): drawSample has cyclomatic complexity 21 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08c91b041cdf9dc07208e59910549da39f4580b9e77ae697eacf5bf69401540"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 21, cognitive 18): walk has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/markdown-chat.model.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea7aa9792e8090eca31524d8ab62c3634674290371c7cebb4d095e1c4341048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 41): (anonymous) has cyclomatic complexity 20 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/doc-citations.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1660c083432f18a6ff9ea57694fd6354f0cf428ab1616a081f7a8455c2334d56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapSourceLineBreaks (cyclomatic 20, cognitive 39): mapSourceLineBreaks has cyclomatic complexity 20 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7b800186985bafad42b3d57b3ba9f5a403c083d609d8c3e861a55e04737d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countPreparedLines (cyclomatic 20, cognitive 39): countPreparedLines has cyclomatic complexity 20 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2a49c8b83495d95ba454feee9d9bcb456ea1b543232a9a9e20d4cd82f1e183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paints (cyclomatic 20, cognitive 25): paints has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3e7422cbd06344d545806ff79758967ffb061e55f0322996eec3802ba1c03e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 20, cognitive 23): render has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/ellipsis.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba85d22d42b32c63d8b349034ec1cd08645a38ea1db3c67ce451dc99b4a4c59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectTextProjection (cyclomatic 20, cognitive 19): projectTextProjection has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/editorial-engine.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"331fa722411ad7c226f73b91b59d02fe7ce522cd7f77af1238ba0d04928bcbc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTerminalLetterSpacing (cyclomatic 20, cognitive 18): getTerminalLetterSpacing has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24099a80670eea99e9ab9bb9602b2a526385ca90d0701605d1ff40b310d72ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGeckoClusterEnds (cyclomatic 19, cognitive 52): getGeckoClusterEnds has cyclomatic complexity 19 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a8f7a87da00b529c429384b674983a369f652ef65aa35df6182c624ceeb4bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairwiseRows (cyclomatic 19, cognitive 50): pairwiseRows has cyclomatic complexity 19 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/catalog.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"febfa78293c7a4a5b08538705711de9747bb6eea2877aa4fdb9c043d891f9754"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function richDisagreement (cyclomatic 19, cognitive 26): richDisagreement has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"597671ec6c8bb946731c32aa1df432c5ac41a919f38485aa30dbd47b7883bfab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 25): (anonymous) has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/run.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef2f6f4b947475c736084e8b842364c62789a26fe3f9528006e962f7c107d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlinePieces (cyclomatic 19, cognitive 24): inlinePieces has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6cde128a9555a32c8e4b95a524e5baf8e7f92048a36aa62cb33dc4136e7a62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64f4cfd6fff7323f5989f6717ca795f4433ebd3b591fe77809713e24b350c67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEngineProfile (cyclomatic 19, cognitive 18): buildEngineProfile has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0d362ad8839226178262b4791648cd72063294d186e0ef1991eb1acd5e9daf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function predict (cyclomatic 18, cognitive 37): predict has cyclomatic complexity 18 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab41fa88dbdf087a59724bb22f013a51098fe64299bd53573bd8ca493153181"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 33): (anonymous) has cyclomatic complexity 18 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":4976}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c2652075ee7cf6eb71fa8e1ce436ac997009f392b052837b8e678f524fd04c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 18, cognitive 29): judge has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/score.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36778af2613a8c38e799b1edd3f02d31fe3bf3d5564ab8ee9059f63c0b0efaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOpeningFit (cyclomatic 18, cognitive 19): getOpeningFit has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1ee115d4d3288cb1df6c2112f331578b49d6b0fcbaaf540eeada8edb03a5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchLineEnds (cyclomatic 17, cognitive 35): searchLineEnds has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/observe.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e513d75cf059c36df93f34a8ea37fc4d99212c16d6aa6680f47d9309e85b46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function breakDataReport (cyclomatic 17, cognitive 32): breakDataReport has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/break-data.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d731c675f24a4bb1527ff9f5da7d66b99516f64f5b8b143c0c8bc75ebd825a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPools (cyclomatic 17, cognitive 31): loadPools has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"face13f78e3f2b933ed59ce08575bc6895e6f9c642d609b3be604ff68667276f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lineWidths (cyclomatic 17, cognitive 26): lineWidths has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/observe.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84bda63d802168a9f92d441d6d9397bad759534f5ef41818bbc81ba0eda8c3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWebKitParagraphBreaks (cyclomatic 17, cognitive 21): getWebKitParagraphBreaks has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"477602bd1fb555e5a40c8d90ee074b6cb197ebc33c7af835e7b53a42c476ad92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBreakStates (cyclomatic 17, cognitive 18): getBreakStates has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"055fcc5d009c54afb9bf2bdc80fdb73677f9725b55b49b774c67a2148c9ad266"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 54): (anonymous) has cyclomatic complexity 16 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/justification-comparison.model.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab041ff7fb9ae8cb56c53d6392891087efe0be5ec250d64e640990b5abb3504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function select (cyclomatic 16, cognitive 45): select has cyclomatic complexity 16 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcd52bcc4e1610d50780f00716d7b770c0eef69d7cd1b99cfd1c0527db9aa22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 16, cognitive 28): render has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/variable-typographic-ascii.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1a60bbaf2fefb97f770ec024c719d8d4906a7bf60c43518e46d6bd9c7a6a6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializeRichInlineLineRange (cyclomatic 16, cognitive 22): materializeRichInlineLineRange has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rich-inline.ts"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b082a0b2739b5d5d20f7c223b85b1c58d48c5c3d59eabebf9ed3860bf3fcf08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addIdeographicSpaceHangs (cyclomatic 16, cognitive 20): addIdeographicSpaceHangs has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prepare.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf10202fe8f0c039eb198b82939588063bb3ab232b50b02493b054e693fd2ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEastAsianSegmentBreak (cyclomatic 16, cognitive 19): isEastAsianSegmentBreak has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef276ae1586d1f6a2ac447dc749a46b189e81b2329d32dec155847da1ffc53cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFontKanaKerning (cyclomatic 15, cognitive 33): getFontKanaKerning has cyclomatic complexity 15 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0200ea6c9c5fbe8623e55ea1d462014a42ff3f239ca26753ea565b620c44a42b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawnCases (cyclomatic 15, cognitive 31): drawnCases has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d84ac23427158abf3d288ca0767a93368cebbf95bbb63ba7892a9733fadcd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSources (cyclomatic 15, cognitive 29): checkSources has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547314c709b8fe9ebd510676843cc9cb4814050dc931ac3c028d31e8e07736d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 27): (anonymous) has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":4810}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb335dbe86ffd8bf236544a103f0768d41d3d8f612f6914bcf9fc9af585e9c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSinglePass (cyclomatic 15, cognitive 20): checkSinglePass has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"939324ad33a4165d540884ad7f208904b9c92cade17ebb8ecdc558b325611070"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureWidth (cyclomatic 15, cognitive 20): measureWidth has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1a5914613f50363a71b71226d7f92e3de8bb60a95b34bd6e85d58cff4dc8b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function widthFor (cyclomatic 15, cognitive 18): widthFor has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8b56ac5b3df53975f5f3a9cfdb538fd7e04fcee52e0d4bba9796089101390c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function familyFor (cyclomatic 15, cognitive 17): familyFor has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cc49ce3901f9e54dc62b099e371345058cd0cdc04df17866fca1bc24f42e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unsupported (cyclomatic 15, cognitive 16): unsupported has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b86d783991f05761a14e34ca11ba236640287531a78fffdd4c1e1871297259"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setupClusterBoundaries (cyclomatic 15, cognitive 16): setupClusterBoundaries has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c4e332a64ac7dd5e55ce4e71f9b27ffb791d9abe8a60ce3fec5dac062f9271"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getComplexLanguage (cyclomatic 15, cognitive 14): getComplexLanguage has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"007474636e0f26a3b06d343e62d2bd38f8a4029fcf5ab6eaf098e129a91b5b48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outputs (cyclomatic 14, cognitive 36): outputs has cyclomatic complexity 14 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/offline-equal.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d858c4db3ded5fc4b7d6a9460d4f426f7f0b1d12f7ed360ac27962e7650b206"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldBreakFast (cyclomatic 14, cognitive 21): shouldBreakFast has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf78c72cadd62465cc4e2765ed8c6a3ddc61eb33c4511097a1884b6c40f48a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c914b0f3db8f2abcc82f9fb72e567160d6ba08ad0f93f5e838506e65471ce05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getKanaKerning (cyclomatic 14, cognitive 17): getKanaKerning has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b180cfb9055e7b51605a2e951156c079c40b2e8f340d573360d3eb4ad2e56c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function score (cyclomatic 14, cognitive 16): score 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":"harness/score.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3be969809d2bb0ebe547a4d86dc199ad2c7092984f4733e5f6a5ac5db3c0913"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGeckoLineBreaks (cyclomatic 14, cognitive 16): getGeckoLineBreaks 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/gecko-line-breaks.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b64a7307fa48c7a1098bc5e319683a59686d66954b4a0d398c39a9d7e1f9054"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutColumn (cyclomatic 13, cognitive 30): layoutColumn has cyclomatic complexity 13 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/dynamic-layout.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd624b4eca673a52ae78ea5ee8966916255700981b93d513a9e595a992a3b579"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readScriptRuns (cyclomatic 13, cognitive 24): readScriptRuns has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prepare.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e56251d629c60856df5286bd2ebc627e24777350983a5de63bf82ff3430d1a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWebKitGenericFamilies (cyclomatic 13, cognitive 22): getWebKitGenericFamilies has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"522d3a0efd091239484f1cc0efe76b8250f0c3b5528c0f25e01b8d1cc14089c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findGraphemeEnds (cyclomatic 13, cognitive 20): findGraphemeEnds 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/graphemes.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45ee5d07cd455b6945a0d53092d398319e9a04af23895c2703624af2d98dfea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alignToSource (cyclomatic 13, cognitive 18): alignToSource 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/analysis.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccdc5f33aa9c1e7ba006802d43b2a7b618b4a99b8cd5fe2719f2c71c7b4c64e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinsWhiteSpaceRun (cyclomatic 13, cognitive 15): joinsWhiteSpaceRun has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a71fb9a263b9eea208229aa87ff5b49878711ff78c7fcefbaceacff8c6b396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function explainCase (cyclomatic 13, cognitive 14): explainCase has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65558d71f7c8a6934a92c653863efcd2fd429ef1a35d218df54f83ecbc75aa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 13, cognitive 14): render has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/markdown-chat.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf9b7eb82f0bf5c3f530eec5b3d228fcdebf88385772a0b981340e441493ce7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRangeText (cyclomatic 13, cognitive 14): buildRangeText has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-text.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9246b95986fc651faabf2bcaa9aba2b8a9e25b91a2dbaed4c931b6ab08b733de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fragmentProblem (cyclomatic 13, cognitive 9): fragmentProblem has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/predict.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ec2a22c1a8b298e060f8a6746446e7e77c40b8eb1374e111e9dcb0162748f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWebKitBreakBetweenItems (cyclomatic 13, cognitive 9): getWebKitBreakBetweenItems has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad34d1c6d97a6e8a9ca1e229b1f1f29e14d136a3b73243fd8cb7daff7a343137"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function factTemplates (cyclomatic 12, cognitive 38): factTemplates has cyclomatic complexity 12 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/facts.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b754ec9dcc3669d88eed706800e82987a5726270a004a44daed5e1aa673ec4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markDictionaryWords (cyclomatic 12, cognitive 25): markDictionaryWords has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a34f380979604ed89ef375036cf6114947d9852596f213947063f3198213dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutColumn (cyclomatic 12, cognitive 22): layoutColumn has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/editorial-engine.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee422c63e19a0c13bf3a6746c7b1ea1fda115869e8693d6f45788faf9cfddfae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFamilies (cyclomatic 12, cognitive 19): readFamilies has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-webkit-generic-families.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d8e40fbfbbc1860b797ff68c014c97d4ff51405fa15ac4bbf710fc55ff0d9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 12, cognitive 19): value has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/layout.test.ts"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5001c354c4e421aae12b020d5e6117719f14df634b44961184ae39d0ba9a689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBlinkLineBreaks (cyclomatic 12, cognitive 18): getBlinkLineBreaks has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb29ce376b45bca8b61adf7c291f3d21f4c95442f5f18e04516caea29c0f04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equal (cyclomatic 12, cognitive 16): equal has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/cli.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaac1e78b4d8d2348095a6b34a9e45e0fe1711442087044647d845e1b65a397"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutMessage (cyclomatic 12, cognitive 16): layoutMessage has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/markdown-chat.model.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f69b5eaeee1eb4089ed526148fa2bbcd93e108f2555ecfecfd52b8e0b9a7405"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countedTallies (cyclomatic 12, cognitive 14): countedTallies has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/score.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0345295dc6b4a6a131a280bd6ebddd0047d04d3c2d30b3e0bba381e0f2b241"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWebKitLineRules (cyclomatic 12, cognitive 14): getWebKitLineRules has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"9313c6fe8c56a8c2c70ed2494b0f94715114a82076f6028801b7e0f5da0e1627"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBreakRules (cyclomatic 12, cognitive 11): parseBreakRules has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e54b3e94a707069eb747e0156e4dbc6bbeef80511893305c42e2b189d1fea13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBreakLanguage (cyclomatic 12, cognitive 10): getBreakLanguage has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcc2c9b6f365a79cc592121da8e32f31946359fd22ebb6916c4edd34e1d7b6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unpackClassRuns (cyclomatic 11, cognitive 27): unpackClassRuns has cyclomatic complexity 11 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e4c4708da0a823cf24696cc60fe1700f4e4fc8cf2c9cb5bbff1641332ca2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function survivors (cyclomatic 11, cognitive 23): survivors has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/widths.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"748536ced3380c07402ccf024d437ef9ca3253b57eab2236bf992d3b349edc65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paintLine (cyclomatic 11, cognitive 21): paintLine has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/justification-comparison.ui.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b42f84a23c70042ec3e8b0dc417f030e5fb7140bdd23f46677aff0fe0118d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutParagraphOptimal (cyclomatic 11, cognitive 20): layoutParagraphOptimal has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/justification-comparison.model.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e0331599602d993010135f334de879cb91abf5d9db3737b1dd6e53683b1a74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classSamples (cyclomatic 11, cognitive 17): classSamples has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/catalog.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f59c07c889f285358cb4d4728c9399326d1a22921bcb294bf5e001bf2e7c8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getExtraSpacings (cyclomatic 11, cognitive 17): getExtraSpacings has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/measurement.ts"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ef1277c7b9552a7931852c92e9431029adfdcd5793391f886d66ac50f058d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function behaviourLine (cyclomatic 11, cognitive 15): behaviourLine has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/score.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b6ccdbcbcb3cf7a1c2fe5f36e43acba742920e5964f6ef76014750d3f911f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hyphenateWord (cyclomatic 11, cognitive 14): hyphenateWord has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pages/demos/justification-comparison.model.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58c9bb262c64f6c23f494d5683cab99473b17a3ed7dff548a4a2c5d2e06cb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchChrome (cyclomatic 11, cognitive 13): launchChrome has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cb98c2574168b5bfa3a9abf188f1a01c35cec72e47851121fb0a55857bc756"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spaceSharesScriptRun (cyclomatic 11, cognitive 13): spaceSharesScriptRun has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/prepare.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358430fbefaf8f4bcd21cfdc60b2e0212e9a9d11295a7ea42c9122721bbf894"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function breakAt (cyclomatic 11, cognitive 12): breakAt 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":"harness/sets/widths.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea52ce6e8d42d02133883c6cc64ff65abf7c1b7f221d3bedc67b39a25778e1b"}},{"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":"harness/run.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9eb3c2c15459e98c9ab2f0d6682a7ac9ed7637ecc3c110ca95039705c8396e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/measurement.ts: 1386 lines of code: src/measurement.ts has 1386 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/measurement.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd42feea144f408fd328cbe8d51c62a02e2f4f131a124bc2dbfd8a6e5693b9a3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/rich-inline.ts: 1218 lines of code: src/rich-inline.ts has 1218 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/rich-inline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3995e51fa2e68db61e422ee59e581f4a2de1562899c2384ed7ae7ecefb5380b8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/line-break.ts: 1134 lines of code: src/line-break.ts has 1134 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/line-break.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75adde3acc515068fb1b49b584cac1ec50fb4ba6dc49628475418f5080351b14"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/generate-engine-break-data.ts: 852 lines of code: scripts/generate-engine-break-data.ts has 852 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-engine-break-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ecf33bdc2ded0302405d699b61de96ac04ef9a48071a8b4eb546d0bb54466e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/line-breaks.ts: 823 lines of code: src/line-breaks.ts has 823 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-breaks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edef1e7b85bd523c2921709065ffde07e7132962d5dc1f03f49e700bb99da2fc"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/cli.ts: 757 lines of code: harness/cli.ts has 757 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":"harness/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3661fdff37abaa3be08a86649156af88f4c06e5b6bcf0e26e362c65b6d2d335f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/prepare.ts: 694 lines of code: src/prepare.ts has 694 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/prepare.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f516e4f9252ec4ba5b7d119d840edc29269cbf30118412dcc2329edc815b7f95"}},{"ruleId":"R3","level":"warning","message":{"text":"src/analysis.ts: 674 lines of code: src/analysis.ts has 674 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/analysis.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd11d074e38a69f2f368511771dcd6e733188e1286ba506e6801ede53af02b8"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/sets/sample.ts: 650 lines of code: harness/sets/sample.ts has 650 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/sample.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4095cced3992d8235b69d43d1d492f6eac8f068b54fdc1e87dcc5a0c4139038d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/gecko-line-breaks.ts: 636 lines of code: src/gecko-line-breaks.ts has 636 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/gecko-line-breaks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06640495ef3e973d10a5d4bf15cf24b6b5b0f6d80950b30a886615378ca89ce9"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/invariants.ts: 615 lines of code: harness/invariants.ts has 615 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":"harness/invariants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"764f9b23f9289227fa7f8fec8d1617fa2650c9447913908c6a37b612c6aa099a"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/browsers.ts: 564 lines of code: harness/browsers.ts has 564 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ccf5a76035958668447370a17f8b42d878a8763e8935bd87a4abcbaaf0461"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/score.ts: 531 lines of code: harness/score.ts has 531 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/score.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d580c62b8e6cab2241a5ee11a88e283fa8cdce7de4399970b32813a1d56f9c0f"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/sets/rich.ts: 525 lines of code: harness/sets/rich.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":"harness/sets/rich.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8e597b265f4232881922fe7d215fa7e875cff3d48b200b9db9d7f7b83a3b25"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/sets/widths.ts: 487 lines of code: harness/sets/widths.ts has 487 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":"harness/sets/widths.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29183098a7ae800b16c50aa97b451dfd18a0be5b98da9e576f8552073d9d1ee0"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/predict.ts: 449 lines of code: harness/predict.ts has 449 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":"harness/predict.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb19ab567da62c9271ef6f985dc881bd7f8fd57469b774a31a7b5c1b560f1ed"}},{"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":"pages/demos/markdown-chat.model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9e33bbbab38db5f69dd1b49297d5a5cad9b47c0b7f0214a4ad4e6d8c5ad0a0"}},{"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":"pages/demos/editorial-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7c2ad59b028b6b8726c1b4c7d7acee57f997710d3af39066762eb15059618e"}},{"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":"pages/demos/dynamic-layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0f78d8c0d434bbbccb8901705c16c35dc9e7e5bbdc5406cdbc1336101b1919"}},{"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":"harness/sets/rich.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de967b58d360f0ebc6ea0dadf258c179c96dda5c956ea2ddb5a33c4969efbfa"}},{"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":"pages/demos/markdown-chat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1b5aa832eb6ee1524efce838015d5fc93319dc2766849ac237eb28cacd5f20"}},{"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":"pages/demos/variable-typographic-ascii.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"327e434c98a96386e9282545b8abd0c546fe90afb17644ef65491c34d1df6e25"}},{"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":"pages/demos/justification-comparison.ui.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f236acde537cf362b273664917ccd78702fca0a3da214b016abea9e3822651e4"}},{"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":"harness/sets/catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec4ae3dcf3538c07f91914e791789173860450cffcd687b2702cd38d2b9fa4a"}},{"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":"pages/demos/wrap-geometry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b2a5dc706dbd6d3fa9703a5e349fbd92261ece2a9ee130a3e60b8ae7e33512"}},{"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":"pages/demos/ellipsis.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2099046f378b35a1bd2bd32af147c2234722283733fd2a16c29cc07822354485"}},{"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":"pages/demos/rich-note.model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcca89923ea1aad06bca9e4413526923baf8452ae421b1b1473be5e9d2222e7"}},{"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":"pages/demos/ellipsis.model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af43e5e14fb5e7a8eaf1231cad0248581d84ef860b380ef06dfd6abec6477d1"}},{"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":"pages/demos/accordion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ac4907c03ac59d46dc14f772c418833505d70e469a7336ddc55f4f7f965458"}},{"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":"pages/demos/rich-note.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73bd755ae21e2c8ba9456b63222fdb718e58ee9085ade6fe0cbb9f98ed41dab"}},{"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":"pages/demos/masonry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae76297a2b4627babf525c8472d3ce802b276c06b3f516de5c2dafda8a1936ec"}},{"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":"pages/demos/bubbles.model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821691d482d84e9a16f1e60034dd6ac4c1096fdc8c888b43de541f2957a3d98a"}},{"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":"harness/sets/make.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef29229f55c2a9c5f4fa5e08bc67da32b29d4f8a1722ec72bb10cac95a9353b9"}},{"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":"pages/demos/bubbles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea008688efbefe02c8cb6bac466b5ed5bb298bf2ecdf8bb88a1c73f70883554"}},{"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":"pages/demos/justification-comparison.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dbdc5bb180d4edb6cdbb470d2ab009cac1768daa2dbd753ae9ffe2c4d8f391"}},{"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":"pages/demos/line-nodes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620466c12dd64936b633f98ff34921e15a5f8b28c678eef9d53489869dc0cf57"}},{"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":"harness/sets/facts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8650a1db1b308300fa4459381fef94e15a700aae32c64b6a780efb08e5fd9dfb"}},{"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":"pages/demos/dynamic-layout-text.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff74ef90f52a0f39973ea1eb9171d5a5ad6e3cc60e1783b19f65dab91b91d887"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027oxlint-tsgolint\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"acf5d7947eab1ad075f69b144f1510d5169183f27f63bcd36a22c7295a611492"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i === startSegmentIndex \u0026\u0026 startGraphemeIndex \u003E 0\u0060 appears character-identically in 2 files \u2014 src/line-break.ts, src/line-text.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line-break.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab77fbc08bfe4ecc697a4c0ffe03a3879e34be9c0c0e1822c97565bca7302af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.text === undefined || item.break === \u0027never\u0027\u0060 appears character-identically in 2 files \u2014 harness/invariants.ts, src/rich-inline.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/invariants.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"581dacf6cd0977d974212b499c291cf7f34f3f161c37cdb5789a23f7e2cbc031"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 harness/sets/build.ts, harness/sets/sample.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/build.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1840cdc5a645e9335487658d246ebbccbe64f4b08197410bf37e3b8b4c776697"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 177 (\u0060canonical\u0060) with a piece of \u0060value\u0060 (and at line 183) \u2014 and nowhere in \u0060canonical\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060canonical\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/sets/build.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adad1cb9c8ef26dc021c6b640fb00a56667086f381826d2f01c6588d881a5e3"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/page.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"347d636b8818df7c7072480b415ad75d930382199f16f0405c1b858605f3615a"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060lang\u0060 is text this program did not author, and it is written into a quoted attribute value through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/run.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0b12fd28b0861bd750bbd1e3c12997316948ffa63123a104c13d03a9ff798"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060JSON.stringify(fonts)\u0060 is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/run.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"373b738f39c63b3bfdbb9300dbb7871554c915cb503c049ba614eb7e4284b4f1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e47f985064c2e1d39382b3fec49e3d81c42ff77baffbf414bdf82b70230d7bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d084d5bfd7db7a2da3e95c24f5d005ecc7aa6d412ccbd2369ff81e95065e74de"}},{"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":"harness/browsers.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27d0cbd5189ec380536411fd07f520ef192d405ac92b3e60940aa038d927fc3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a4af629aea0de02a2d26f40725bb28d583920c216f861a816c68eb7ff67e31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb97797c8473c1631661342ec767930a2f1a644b643785be8c504f2c78a8c2ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/browsers.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3f4170007525433f0def84dfe119cd0662bce792f1cfedcad4f61a91c0ff0a"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~74.8 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 1104 assertion(s) across the 14752 source line(s) of the 32 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/rich-inline.ts (157), src/line-break.ts (99), harness/cli.ts (80). 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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-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-601","guid":"9b8963d5-129b-475c-90cf-2d1766e66f2f","name":"URL Redirection to Untrusted Site (\u0027Open Redirect\u0027)","shortDescription":{"text":"URL Redirection to Untrusted Site (\u0027Open Redirect\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/601.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":16,"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."]}]}