{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"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":"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"uPlot.uPlot::updateCursor (cyclomatic 120): uPlot.uPlot::updateCursor has cyclomatic complexity 120 (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: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5501f056f6f0e76a642fa21779f123f1091d4f0bbb807ba0fb99e0a2f2cb6635"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-trace-browser.validateChart (cyclomatic 103): benchmarks-trace-browser.validateChart has cyclomatic complexity 103 (threshold 15). Of this number, 97 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7aea391060bb247cf52282a034cd92fd7d60f3e003e6f6e5f37dfa0aaff89e"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot (cyclomatic 91): uPlot.uPlot has cyclomatic complexity 91 (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: 11 other methods here (uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, uPlot.uPlot::initAxis, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98448991b3d3b6ac07d998f968149a4cca2f15b17bf67ec8b2aeb315a6ac76b"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-trace-browser.validateInput (cyclomatic 85): benchmarks-trace-browser.validateInput has cyclomatic complexity 85 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 10 belong to 6 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b895c2764d6f0e8e6698163542e623501316790d246208f6885475e07393890d"}},{"ruleId":"D1","level":"warning","message":{"text":"points.points (cyclomatic 65): points.points has cyclomatic complexity 65 (threshold 15). Most of this is not in the body itself: 3 of the 65 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 24, 76, 147, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/points.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"755846b7bdae092f27f128a0afb892c260145f036d863fb11276fce808db268f"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::setScales (cyclomatic 60): uPlot::setScales 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a55bb2186f721ba54ef954ad8600bce135f785e1cc6d33184ff6eefa051e8d"}},{"ruleId":"D1","level":"warning","message":{"text":"selectRangeY (cyclomatic 58): selectRangeY has cyclomatic complexity 58 (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/rangeY.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f59e40e6b14300af57f9cd207d87768f701332eefe08dd3e0e63c2607605cf"}},{"ruleId":"D1","level":"warning","message":{"text":"bars (cyclomatic 57): bars has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 12 of the 57 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 64, a function literal at line 57, a function literal at line 61, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/bars.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c786f49bfbce7fa0f59ab63ab945aff08ef0b59791ac8e99d8c7bac5d8f943b"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-samples.captureBenchmarkSamples (cyclomatic 55): benchmarks-samples.captureBenchmarkSamples has cyclomatic complexity 55 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-samples.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8b9898e45218af12673c831defedb89f3298783147cfdfdebcf2eb9487f89"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-trace-browser.teardown (cyclomatic 54): benchmarks-trace-browser.teardown has cyclomatic complexity 54 (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":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a069d43b8f885cced21899f718b37861333f7915e46db32df453dcb73a27391d"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::initAxis (cyclomatic 48): uPlot.uPlot::initAxis has cyclomatic complexity 48 (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: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"deecfc92a3cf01496c60adf1f3810292393190ba31aa363f71fa78cb905a1be8"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::drawAxesGrid (cyclomatic 45): uPlot.uPlot::drawAxesGrid has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e806066e52fd8b9abbdbf03caf089ac2bfae8b7a8c842dba340c930764fd98f"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-trace.captureBenchmarkTrace (cyclomatic 45): benchmarks-trace.captureBenchmarkTrace has cyclomatic complexity 45 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e34ac6d79784bf899c099b72b9a3ec3a0d57fabc8e1c2f298510e7c426feb53"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-paths-browser.runCase (cyclomatic 45): benchmarks-paths-browser.runCase has cyclomatic complexity 45 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 13 belong to 8 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":"scripts/benchmarks-paths-browser.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0ddfc01e8be71bdff04367b0d61def264132eaac4138f334090f0071a1a3b7"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::initScale (cyclomatic 44): uPlot::initScale has cyclomatic complexity 44 (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/uPlot.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced7d37564638fe4c1d25fa10e6fdbee7d5aec6a01368495cc531676a5c1a8a3"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-webgl.createWebGLCapture.complete (cyclomatic 43): bench-webgl.createWebGLCapture.complete has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-webgl.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5011d80a517ab4ae7aa43f9a9c97298fb69d6b7e5b4505f43c680c5188edbe2"}},{"ruleId":"D1","level":"warning","message":{"text":"TraceJSON.token (cyclomatic 39): TraceJSON.token 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":"scripts/bench-trace-stream.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b99da7141eacd3cfac729743bbb95bfe2aeab62317900f943a02f1e44c44dd"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-suite.runBenchmarkSuite (cyclomatic 38): benchmarks-suite.runBenchmarkSuite 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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e4c2ba8f81581588b9aa518aebfce52dbeacffa0058148a5d8f2dcde8a16b8"}},{"ruleId":"D1","level":"warning","message":{"text":"genTimeStuffs (cyclomatic 38): genTimeStuffs has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 163, timeAxisSplits). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/opts.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05fddbdb8c90b8fafaaa71496b274fc8a1f789dae878667fdc32b58c8947579"}},{"ruleId":"D1","level":"warning","message":{"text":"linear (cyclomatic 38): linear has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 22, a function literal at line 21, (anonymous)::(anonymous)::pixelForX, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/linear.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a84914338a9d970354659adb54b23aa296331ce25351a1b35559224f5a075fb"}},{"ruleId":"D1","level":"warning","message":{"text":"investigate-g2-webgl-fill.sample (cyclomatic 37): investigate-g2-webgl-fill.sample has cyclomatic complexity 37 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 20 belong to 11 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":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d6fe2ce313edfdc08338e9d407fd5ff1dff8842ecec812e0fa789091fc19bb"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::_commit (cyclomatic 34): uPlot.uPlot::_commit has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e2966ae5fdc6110dbfa1a7242d9fdae5b0e12cc7ad9afea4018792e88c531"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-mouse.installBenchmarkMouseInput (cyclomatic 34): benchmarks-mouse.installBenchmarkMouseInput has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 79, listener, a function literal at line 53, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-mouse.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded46425042421f9c4af9d709e85d03d2c3007ba43b065b70c844abd1e8a09b0"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-process-memory.readProcessMemory (cyclomatic 33): bench-process-memory.readProcessMemory has cyclomatic complexity 33 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-process-memory.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"694ec8f209264ec210150ff1d25a3687de1c332f3841220f55741e30d116477b"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-benchmarks-trace.createTraceAnalyzer::finish (cyclomatic 31): analyze-benchmarks-trace.createTraceAnalyzer::finish 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. This shape REPEATS in the file: one other method here (analyze-benchmarks-trace.createTraceAnalyzer::push) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-benchmarks-trace.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a2c5d10999b9caa7a5d3a7c82a894d4da7540c301cf362dee6cae7a9607e02"}},{"ruleId":"D1","level":"warning","message":{"text":"stepped (cyclomatic 31): stepped has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 4 of the 31 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 14, a function literal at line 11, (anonymous)::(anonymous)::pixelForX, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/stepped.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9371e72bdeca63cec2573459241a1fefeda2d4e2958d6dcb6910de268bf7c701"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::initSeries (cyclomatic 30): uPlot::initSeries has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0349c36073e8f4cc97e6d1c1259918de765b054af302c540ed0587a4273e3aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"points::(anonymous)::(anonymous)::drawPoint (cyclomatic 30): points::(anonymous)::(anonymous)::drawPoint has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/points.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"282cd50bab0b1686572baed7e5e0c26cf631c055b8a8d414548fac07df853264"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-benchmarks-trace.createTraceAnalyzer::push (cyclomatic 29): analyze-benchmarks-trace.createTraceAnalyzer::push has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (analyze-benchmarks-trace.createTraceAnalyzer::finish) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-benchmarks-trace.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454c547a469306fbad66b634ced3f9af731ba9a7ae2c6a44730ee17b87728fa"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-module-bundle.bundleModuleDependencies (cyclomatic 29): bench-module-bundle.bundleModuleDependencies has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 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":"scripts/bench-module-bundle.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8722a27c6fe28f236084efae06cd2985b0c5857c69728cc1054ec713de70a7"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-display.formatTable (cyclomatic 29): benchmarks-display.formatTable has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 116, a function literal at line 126, line, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-display.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"514db6011c160a945cc8b36198cef7b8f91cf4a358c8e647796951ac76bafbef"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::dataIdx (cyclomatic 29): uPlot::dataIdx has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c6015202d701311be94de64e6c5fbb5886fe86b1e62c19415e6f479e72dbc"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::fillStroke (cyclomatic 29): uPlot::fillStroke has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d75a9f61095f3a5b494bd044fcb5b37560362ae710bc6306e4d1d3d43a4d656"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-webgpu.createWebGPUCapture.complete (cyclomatic 28): bench-webgpu.createWebGPUCapture.complete has cyclomatic complexity 28 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 8 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":"scripts/bench-webgpu.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"271a1eae84dafa3a9dfa9a02d04f2e947cecb28e89f53f809909b2e1843da2cc"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-demo-sources.loadBenchDemoSources (cyclomatic 28): bench-demo-sources.loadBenchDemoSources has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-demo-sources.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fef13767d786af9c6e0149be67dc22531f049e45f482f27444f162e15246a52"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::strokeFill (cyclomatic 28): uPlot::strokeFill has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2250}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f091e906ef5a1a3d39f9e9380eac865e731c2bbfc7dfdc81bc25edc19e509c"}},{"ruleId":"D1","level":"warning","message":{"text":"_rangeNum (cyclomatic 28): _rangeNum 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/utils.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8357d75151ae2841bb82448146ae15e9f06f7f7d755acfa8f10f456016c478"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-display.cellWidths (cyclomatic 27): benchmarks-display.cellWidths has cyclomatic complexity 27 (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":"scripts/benchmarks-display.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53233fc856440a61fa49ceed34fa0c43bef48a2f64fb09b594010935ebc9a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::cacheMouse (cyclomatic 26): uPlot.uPlot::cacheMouse 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. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c30024e2591ec12859a1b4e97b5c6d015b2301b2018c635d076dc22c31aecc7"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::mouseUp (cyclomatic 26): uPlot.uPlot::mouseUp has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6241b748eea32ca51b68e56bacf949161fe087aed51ab467fd138be71f058d"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-benchmarks-raf.summarizeBenchmarkRaf (cyclomatic 26): analyze-benchmarks-raf.summarizeBenchmarkRaf has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-benchmarks-raf.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5173ee7dae06bb0cd0bb27dc8233ba4500ec067d7929ea1d98f29dba378b756a"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-phases.benchmarkOperations (cyclomatic 25): benchmarks-phases.benchmarkOperations has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-phases.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71f157afadc28979a21be3b10e0adc730e1c8b4d0fa5c42134ca800612826d7"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-benchmarks-process-memory.summarizeAdjustedProcessMemory (cyclomatic 25): analyze-benchmarks-process-memory.summarizeAdjustedProcessMemory 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":"scripts/analyze-benchmarks-process-memory.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaa027eaa813b2642ed647c0ef6cc2f23b0c0e074e3bc4dcb12b154bb7f3ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-browser-process.killBenchmarkBrowser (cyclomatic 25): bench-browser-process.killBenchmarkBrowser has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-browser-process.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"723e2ee2062925f311e4df08ca56bfc8cb103aee658636c643c5cbe4b300b5f6"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-suite.benchmarkView (cyclomatic 25): benchmarks-suite.benchmarkView has cyclomatic complexity 25 (threshold 15). 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, 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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"001cba616efb61eb2bd5db04b0ce78f8e1f60c385a6ecc05a6e0478c7885e8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::updateLayout (cyclomatic 24): uPlot.uPlot::updateLayout has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::initAxis, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2958a53726a101905e80795a52891e1ae0de92fdb39d71b8943e3c5d279e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"number-format-virtual.fmtNumEn (cyclomatic 24): number-format-virtual.fmtNumEn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/investigations/number-format-virtual.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab1f1c54c7adcb8380427946d1d18eb721fdba1b1e2eaaa3160d3334d2acfcc"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-heatmap-asinh.benchmark (cyclomatic 24): bench-heatmap-asinh.benchmark has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-heatmap-asinh.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03197e5186db1addceeaf566c83874b0560a0cd0e1b1854126e934fba23ac4d"}},{"ruleId":"D1","level":"warning","message":{"text":"scanScaleInternal::acc (cyclomatic 24): scanScaleInternal::acc has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d680cfcfc3e3b926b4f8be2df011f341271cd1cdc705a8350fe15b288b1b6a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-heatmap-minmax.benchmark (cyclomatic 23): bench-heatmap-minmax.benchmark has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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":"scripts/bench-heatmap-minmax.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77176619f481e5e2e233b7491257cb282c46aaca19e2a20899364d49a8714c"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::drawSeries (cyclomatic 23): uPlot::drawSeries has cyclomatic complexity 23 (threshold 15). 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/uPlot.js"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54860fe538b57c35a0e2b60dc833bee8f0e9dafafc8538e92488d4d30723c0"}},{"ruleId":"D1","level":"warning","message":{"text":"number-format-structural-variants.directFixed (cyclomatic 22): number-format-structural-variants.directFixed 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":"docs/investigations/number-format-structural-variants.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaeaf26773f10e670970e00dd3c173278777b65099a82007cef06d07f2b6780"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-legend.benchmark (cyclomatic 22): bench-legend.benchmark has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-legend.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee236e5efa3a1236d0c0353c7047ea1e07a5fa2017cfedcee0eaa422e8d1d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-suite.benchmarkView.rows (cyclomatic 22): benchmarks-suite.benchmarkView.rows has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-suite.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c898e6d0fac82504293d3f1fbc8f8f6c727acd7f5e6aeeb51c1ba474c07924a"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::selectLegend (cyclomatic 21): uPlot.uPlot::selectLegend 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. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::updateLayout, uPlot.uPlot::initAxis, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73ae5478fb33bae415cf0e372d4d6d72edb3afa653662132da1c882b10f66dd"}},{"ruleId":"D1","level":"warning","message":{"text":"number-format-en-baseline.fmtNumEn (cyclomatic 21): number-format-en-baseline.fmtNumEn 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":"docs/investigations/number-format-en-baseline.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f44e70570fdc8846c22927b769fa5d830c2a29b8cb63bc318392b0d1973e28a"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-heatmap-grid.validate (cyclomatic 21): bench-heatmap-grid.validate has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"scripts/bench-heatmap-grid.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ac78509faa69459fe7e9cd0c040a5cf3c6f5c18a0d4cf2fb31ec513c97632b"}},{"ruleId":"D1","level":"warning","message":{"text":"investigate-g2-webgl-fill.run (cyclomatic 21): investigate-g2-webgl-fill.run has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 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":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9c0f23fb7ef9e17e35b0ac67210002321500fee4c952c5071c7dfeda5c2a1"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.rangeAnchors (cyclomatic 20): utils.rangeAnchors 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/utils.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a3b518e23a9f40c2df7af2ba1c15ec6a013665e6d23f3028eb9064b5f815d3"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.fmtNumDec (cyclomatic 20): utils.fmtNumDec 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/utils.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c0b32b861a2789546257366c13bfbbac174302ac9dca2318171a760db8fac"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.scanScaleInternal (cyclomatic 20): uPlot.scanScaleInternal 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/uPlot.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa61a62faf2f332ff89694fcad45171ced7f0be90c07435b135410bbdcce263"}},{"ruleId":"D1","level":"warning","message":{"text":"number-format-en-611.fmtNumEn (cyclomatic 20): number-format-en-611.fmtNumEn 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":"docs/investigations/number-format-en-611.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2838d4a56f0865892716455527ab45478f25aa48755fad51cc95e1f14351c3e2"}},{"ruleId":"D1","level":"warning","message":{"text":"number-format-en.fmtNumEn (cyclomatic 20): number-format-en.fmtNumEn 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":"docs/investigations/number-format-en.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db2ad20f63670a629e8a5c7667b186d5c1855b10dd338d57e0e4278adca532a"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-heatmap-grid.runBenchmark (cyclomatic 20): bench-heatmap-grid.runBenchmark has cyclomatic complexity 20 (threshold 15). Of this number, 19 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":"scripts/bench-heatmap-grid.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"657fce65ed8f7e815cbbd203938d5acb4b5ef46bd389bcc8160ec8f17013373f"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-heatmap-log-blocks.buildLog (cyclomatic 20): bench-heatmap-log-blocks.buildLog has cyclomatic complexity 20 (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":"scripts/bench-heatmap-log-blocks.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5550323c71479d090c205ae55687ffe8bb016ea89849d568a166dd75fd42984"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::setCursorPointPos (cyclomatic 20): uPlot::setCursorPointPos has cyclomatic complexity 20 (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/uPlot.js"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5cc11a4b4b70771fdc4db31c638dfadbe5b136a70fe34f3d756a2159165f3"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-benchmarks-process-memory.summarizeProcessMemory (cyclomatic 19): analyze-benchmarks-process-memory.summarizeProcessMemory 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":"scripts/analyze-benchmarks-process-memory.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7b0d2940068a18e98ad65bed74771af924529f0a40e97cb98f79775cb315ac"}},{"ruleId":"D1","level":"warning","message":{"text":"number-format-en-compact.fmtNumEn (cyclomatic 19): number-format-en-compact.fmtNumEn has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/investigations/number-format-en-compact.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b252c2fb87fc4fd4f573780f3cc3a2a88b67f8aa66434c9e912fbd192ce6e4"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.findGaps (cyclomatic 18): utils.findGaps has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/utils.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"334b0aeaefe5d40f4c5fd64617aecd6ed55394f2459139d984f2f6ace3dc4d63"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-phases.benchmarkTimingSamples (cyclomatic 18): benchmarks-phases.benchmarkTimingSamples has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 68, 69). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-phases.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc365ba315b5511d817e057248c2fb17d0808f58987832c7f3a4e1e2425495ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokens.write (cyclomatic 18): Tokens.write 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":"scripts/bench-trace-stream.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0214bbd98d49ef099b35f40d7b25aee3383b1ac1342ee69f7ca0386707322429"}},{"ruleId":"D1","level":"warning","message":{"text":"prepareRangeY (cyclomatic 18): prepareRangeY has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rangeY.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2c8bfd8a9ddb90b77fddcd137339536b7c29acb74feeec627e52bc2343d684"}},{"ruleId":"D1","level":"warning","message":{"text":"splineInterp (cyclomatic 18): splineInterp has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 6, a function literal at line 5, (anonymous)::(anonymous)::pixelForX, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/spline.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e311cac2a70a26f24069477ed0cb7d4e426cc94ae26723b0c1634d000965f916"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.join (cyclomatic 17): utils.join has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"11112c66365ab2bfc152b776b8151eddf5e01d1efe355867c773a8d2c138cce9"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::resizeOverlays (cyclomatic 17): uPlot.uPlot::resizeOverlays has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74ef039cd79f6770dec84bfaca69186ef1d742050862568ecb8cb59b90fb071"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-legend-browser.run (cyclomatic 17): bench-legend-browser.run 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":"scripts/bench-legend-browser.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8522547ec748ae225e4899cb207a4f5ae461823a93a19790c46196421a9d37"}},{"ruleId":"D1","level":"warning","message":{"text":"probe-worker.createProbeWorker.start (cyclomatic 17): probe-worker.createProbeWorker.start has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 65, a function literal at line 32, fail, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/probe-worker.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e7b9be00efa3f35687e1007d62af739201864f27ea1d322b25f5440c3b4922"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::drawSeriesPart (cyclomatic 16): uPlot.uPlot::drawSeriesPart 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. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfbfcdbfde15003138eec01a014308c8d6222da7aae3c3245d84057f2c1a3fe"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot.uPlot::mouseLeave (cyclomatic 16): uPlot.uPlot::mouseLeave 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. This shape REPEATS in the file: 11 other methods here (uPlot.uPlot, uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 12 times rather than 12 independent problems. Splitting this body alone leaves the other 11 exactly as they are. Where these are variations on one operation, the change that clears all 12 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":4035}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee4cc9e99913258815dc3082cd38581bc4ca30c0037160d67a36561fb7a93d7"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-heatmap-grid.setup (cyclomatic 16): bench-heatmap-grid.setup has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-heatmap-grid.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5308ec75a8c71714aa2df477cc57a450777c9932b9da5bcd1d1397141fcf79"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-suite.assertCompatibleReports (cyclomatic 16): benchmarks-suite.assertCompatibleReports has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"312a94f3eca8a183c0868893628940fe40af5502e7d1538baa464f79f004652e"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmarks-suite.summarizeSavedBenchmarks (cyclomatic 16): benchmarks-suite.summarizeSavedBenchmarks has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-suite.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f960f51ad64a71b6a6b0a6aa2d0b4e3703af2cd7c6979cedd86cd2a09dce390"}},{"ruleId":"D1","level":"warning","message":{"text":"uPlot::rangeYScales (cyclomatic 16): uPlot::rangeYScales 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/uPlot.js"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"9920b6b7c9ed0bb35a338dea18bd28aaa36aa30794db6247d57b6d1810a310fe"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::updateCursor (cognitive 329): uPlot::updateCursor has cognitive complexity 329 (threshold 15). Drivers by points: if/else 62 (178 pts), ternaries 27 (111 pts), boolean chains 36, loops 2 (4 pts) (nesting depth added 202). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41583671813cc015a5614727ca3192c79ea2ce16bc54d1d20f3b7ae9e3ca34e"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.uPlot::drawAxesGrid (cognitive 115): uPlot.uPlot::drawAxesGrid has cognitive complexity 115 (threshold 15). Drivers by points: ternaries 24 (75 pts), if/else 13 (30 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 72). 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: 5 other methods here (uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, uPlot.uPlot::_commit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eafb60e10800694153f386633dc5ad2f48ebf4cff5f9f7b557c059269504b5"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::setScales (cognitive 102): uPlot::setScales has cognitive complexity 102 (threshold 15). Drivers by points: if/else 23 (48 pts), ternaries 7 (21 pts), boolean chains 20, loops 9 (12 pts), other 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e66ad3a89a41afe07ed5efb0d425c14b5e8168d389268eb4d827128c2373bda"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::initScale (cognitive 100): uPlot::initScale has cognitive complexity 100 (threshold 15). Drivers by points: ternaries 18 (58 pts), if/else 9 (25 pts), boolean chains 15, other 2 (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3ab028f4b1fcae0cd4153ca93f6997a1aac15d53db3fe1522e05ab833345c8"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-trace-browser.validateChart (cognitive 99): benchmarks-trace-browser.validateChart has cognitive complexity 99 (threshold 15). Drivers by points: if/else 28 (41 pts), boolean chains 38, ternaries 8 (18 pts), loops 1 (2 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":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b540087355309904806ab7db208dc15639a8a22288264a5596359d45758bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"selectRangeY (cognitive 99): selectRangeY has cognitive complexity 99 (threshold 15). Drivers by points: if/else 24 (64 pts), boolean chains 16, ternaries 5 (14 pts), other 4, loops 1 (nesting depth added 49). 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/rangeY.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0438b7a286cecfa4a1c6be6fdc4a5190da606a86ef789f2ecd47439bf40e5a87"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot (cognitive 98): uPlot has cognitive complexity 98 (threshold 15). Drivers by points: if/else 483 (872 pts), ternaries 230 (569 pts), boolean chains 397, loops 54 (118 pts), other 29, match/switch 1 (nesting depth added 792). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"924829d5da6c80aef7366d3643e788e6ddf74cb9f96fa2aab9110d980a6b0d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-samples.captureBenchmarkSamples (cognitive 91): benchmarks-samples.captureBenchmarkSamples has cognitive complexity 91 (threshold 15). Drivers by points: if/else 16 (43 pts), ternaries 9 (18 pts), boolean chains 12, error handling 3 (9 pts), loops 4 (9 pts) (nesting depth added 47). Of this number, 69 points are the body\u0027s own statements and 22 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-samples.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"438a16e662df48b2790d39c05230256e62b8bb8ae6ac91d38ed561a7772cbd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-asinh.benchmark (cognitive 87): bench-heatmap-asinh.benchmark has cognitive complexity 87 (threshold 15). Drivers by points: if/else 12 (42 pts), ternaries 6 (25 pts), loops 7 (19 pts), boolean chains 1 (nesting depth added 61). 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":"scripts/bench-heatmap-asinh.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5319a0883e3a553b0a9f25b4a38322fca0c039347689a7a0bc032c441926fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"linear (cognitive 87): linear has cognitive complexity 87 (threshold 15). Drivers by points: if/else 25 (57 pts), ternaries 9 (21 pts), boolean chains 4, loops 2 (4 pts), other 1 (nesting depth added 46). None of this is in the body itself: all 87 points belong to 5 function items inside it that branch (a function literal at line 22, a function literal at line 21, (anonymous)::(anonymous)::pixelForX, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/linear.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74d379241d505003e037b4e9fd4b46d833e8051be67c3402ed86d4001f381af"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-trace-browser.validateInput (cognitive 81): benchmarks-trace-browser.validateInput has cognitive complexity 81 (threshold 15). Drivers by points: if/else 31 (46 pts), boolean chains 34, ternaries 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":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"21afdc9f45629e5bb7b8a214ed0ac1086ad3d76ab68425922678cc080873beaa"}},{"ruleId":"D2","level":"warning","message":{"text":"genTimeStuffs (cognitive 78): genTimeStuffs has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 8 (16 pts), ternaries 5 (11 pts), boolean chains 7 (nesting depth added 40). Most of this is not in the body itself: 1 of the 78 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 163, timeAxisSplits). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/opts.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58db2c339742aea39d674f4aad08bf491bf827b4e1098525e29e1122585a71c"}},{"ruleId":"D2","level":"warning","message":{"text":"bars (cognitive 78): bars has cognitive complexity 78 (threshold 15). Drivers by points: ternaries 22 (31 pts), if/else 19 (30 pts), other 9, boolean chains 7, loops 1 (nesting depth added 20). Most of this is not in the body itself: 11 of the 78 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 64, a function literal at line 57, a function literal at line 61, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/bars.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae14232c01138d7450c55a724910b5fa07256ec7c8922cbf41bab3cd8c42942"}},{"ruleId":"D2","level":"warning","message":{"text":"points.points (cognitive 77): points.points has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (38 pts), ternaries 19 (22 pts), boolean chains 15, loops 1 (2 pts) (nesting depth added 18). Most of this is not in the body itself: 2 of the 77 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 24, 76, 147, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/points.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89626dbcb4973b07406bdf3c93fed78fee829c3b509f127670c286887b433d6"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::dataIdx (cognitive 72): uPlot::dataIdx has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (38 pts), ternaries 6 (21 pts), boolean chains 6, loops 2 (6 pts), other 1 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd81ddfa3900904e33574f9722e1b6a767252a578814addd4ea9205d6f9879a"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-webgl.createWebGLCapture.complete (cognitive 69): bench-webgl.createWebGLCapture.complete has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (33 pts), ternaries 8 (15 pts), error handling 4 (10 pts), loops 6 (7 pts), boolean chains 4 (nesting depth added 28). Of this number, 66 points are the body\u0027s own statements and 3 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":"scripts/bench-webgl.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e612572fac9c9ae3459fb3b063298f7a1141c0bb1b5cd3cdf516d3456dbfe629"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-grid.runBenchmark (cognitive 69): bench-heatmap-grid.runBenchmark has cognitive complexity 69 (threshold 15). Drivers by points: if/else 8 (33 pts), loops 8 (25 pts), ternaries 4 (11 pts) (nesting depth added 49). Of this number, 65 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-heatmap-grid.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"046707385bb5aa9462c16af0f10b151f282f90222217d7cd96f29beaeb741cac"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::drawSeries (cognitive 67): uPlot::drawSeries has cognitive complexity 67 (threshold 15). Drivers by points: loops 9 (38 pts), if/else 8 (21 pts), boolean chains 4, ternaries 1 (3 pts), other 1 (nesting depth added 44). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"281ea54c8525a5140842e841305d95091e4b09527ce4c73c8fd1f467d83933a2"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-paths-browser.runCase (cognitive 64): benchmarks-paths-browser.runCase has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 17 (23 pts), ternaries 4 (11 pts), boolean chains 5 (nesting depth added 24). Of this number, 54 points are the body\u0027s own statements and 10 belong to 8 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":"scripts/benchmarks-paths-browser.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df529eb524ba0afe469794c4ff10b7f500c8dbe8075f02af4ef28c47044160b"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-demo-sources.loadBenchDemoSources (cognitive 61): bench-demo-sources.loadBenchDemoSources has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 9 (33 pts), if/else 8 (15 pts), loops 5 (9 pts), boolean chains 3, error handling 1 (nesting depth added 35). Of this number, 57 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-demo-sources.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91257959079c24ae8e96c195bf372ab98434d84d8ab586a0fc1cde6c45ffd73"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::initAxis (cognitive 61): uPlot::initAxis has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 15 (31 pts), boolean chains 23, if/else 4 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"640b73154689c1cb23726ef9908e2c67eba8f77d00d5773fc9c59d224e4dd0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-browser-process.killBenchmarkBrowser (cognitive 58): bench-browser-process.killBenchmarkBrowser has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (35 pts), error handling 5 (14 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 34). Of this number, 54 points are the body\u0027s own statements and 4 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":"scripts/bench-browser-process.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c526bbef9ce819461069a81a37c17a619268417234195a4952e4ffc526c03e"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-trace-browser.teardown (cognitive 56): benchmarks-trace-browser.teardown has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 14 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e8ee500eed44350b30029849c88cc2e9254fe549eee5bb46888c156219a88e"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-benchmarks-raf.summarizeBenchmarkRaf (cognitive 53): analyze-benchmarks-raf.summarizeBenchmarkRaf has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (30 pts), ternaries 5 (11 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 26). Of this number, 26 points are the body\u0027s own statements and 27 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":"scripts/analyze-benchmarks-raf.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3853a977ee007c765c280619b1158349b6bfc21067b5cea54d3c7891ce525cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-minmax.benchmark (cognitive 50): bench-heatmap-minmax.benchmark has cognitive complexity 50 (threshold 15). Drivers by points: loops 12 (25 pts), if/else 7 (15 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 27). Of this number, 31 points are the body\u0027s own statements and 19 belong to one function item inside it that branches. 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":"scripts/bench-heatmap-minmax.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"754492e33dd8c0daeffa0fdc9f8bf8e1bfa9e74eef9ff08b2f82aada987f3418"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceJSON.token (cognitive 49): TraceJSON.token has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (32 pts), ternaries 4 (9 pts), boolean chains 8 (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":"scripts/bench-trace-stream.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea02dc16dee04395b1babac9281d6e5100bb8692cb7fdc95a9443cfa8bbed294"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::cacheMouse (cognitive 49): uPlot::cacheMouse has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (24 pts), if/else 14 (20 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"135655642d9f9c428840ccc4c5fcca7adc57a4cfabcad0cc9f0d4f8f1b856bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-suite.runBenchmarkSuite (cognitive 47): benchmarks-suite.runBenchmarkSuite has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 16 (25 pts), if/else 7 (12 pts), boolean chains 6, error handling 2 (3 pts), loops 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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87ce1237a898a9268095647ac128e178e908d1d48bc0f6c534e8a0c5c3fccb9"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::fillStroke (cognitive 46): uPlot::fillStroke has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 11, ternaries 3 (7 pts), loops 2, other 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"96174d7101e86de94cfc338a47f9b543c527888bad2ab62e60a8f5c7bcae683b"}},{"ruleId":"D2","level":"warning","message":{"text":"DateZoned.getDay (cognitive 45): DateZoned.getDay has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 9 (45 pts) (nesting depth added 36). 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/fmtDate.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4264d2a9f1e2c694c78998c340ae2e8799f542e7ba86405a762757d265a30b"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-trace.captureBenchmarkTrace (cognitive 45): benchmarks-trace.captureBenchmarkTrace has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 9, loops 4 (6 pts), ternaries 5, error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cfa5984491bf2b377a6f31fffa77a74973c91e2e59859cedde52804d1cb6d3"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-legend-browser.run (cognitive 43): bench-legend-browser.run has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (11 pts), ternaries 2 (9 pts), boolean chains 1 (nesting depth added 27). 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":"scripts/bench-legend-browser.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce20d56ebd63236f8bb2111184217b13a9ad9cd520918366baaa729851b1445"}},{"ruleId":"D2","level":"warning","message":{"text":"join (cognitive 43): join has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 6 (12 pts), ternaries 4 (10 pts) (nesting depth added 26). Of this number, 42 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe9c3f7248ac0386d83db486aab9bf6da770e86c54505caef596990ed1c091c"}},{"ruleId":"D2","level":"warning","message":{"text":"scanScaleInternal::acc (cognitive 42): scanScaleInternal::acc has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 6, ternaries 1 (3 pts), other 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e77a366a7d529ed9ed1b0f283baba945e0c23cf1fd97f96e24ee6a64002de5"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeXVals (cognitive 41): mergeXVals has cognitive complexity 41 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 6 (17 pts), boolean chains 1, other 1 (nesting depth added 26). 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/utils.js"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"7942ddfa1e84928f93d907dbbde521a53a5f44f137b7c0d94f743b4e05add699"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-display.formatTable (cognitive 40): benchmarks-display.formatTable has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 9 (31 pts), boolean chains 9 (nesting depth added 22). Most of this is not in the body itself: 2 of the 40 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 116, line, a function literal at line 109, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-display.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d396e5982a17c81e7df2f4000ae3560f5df3286abd768fbac59048051945b1"}},{"ruleId":"D2","level":"warning","message":{"text":"investigate-g2-webgl-fill.sample (cognitive 39): investigate-g2-webgl-fill.sample has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 8 (10 pts), boolean chains 7, ternaries 3, error handling 2 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 19 belong to 11 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":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e22345ec6a98166dbbcb7ea957d3d2c39259f1058799bada032f8e648daf8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"stepped (cognitive 39): stepped has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 9 (14 pts), boolean chains 6, other 4, loops 1 (nesting depth added 9). Most of this is not in the body itself: 3 of the 39 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 14, a function literal at line 11, (anonymous)::(anonymous)::pixelForX, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/stepped.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b70393f72e42b339a5a31798f6d91e05e5c43f392306446380dddb1a18fc26"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-benchmarks-trace.createTraceAnalyzer::finish (cognitive 38): analyze-benchmarks-trace.createTraceAnalyzer::finish has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 7, loops 5 (6 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (analyze-benchmarks-trace.createTraceAnalyzer::push) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-benchmarks-trace.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"21da02551fea5af7f938d8f4b901106294ff45eb750dfa6692ca002bcbf3ec98"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.scanScaleInternal (cognitive 37): uPlot.scanScaleInternal has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (50 pts), boolean chains 11, loops 3 (9 pts), ternaries 3 (4 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c359cabecaf30fdacf81cf8d4bd2a065c448b3ec0babfab4a6422c9c1c9659"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-mouse.installBenchmarkMouseInput (cognitive 35): benchmarks-mouse.installBenchmarkMouseInput has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 10, error handling 4, loops 3 (4 pts), ternaries 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 79, listener, a function literal at line 53, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-mouse.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c182b1806b03055431c2d388b483023801760b91a76f8acc4561cffe8fa1aa"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-webgpu.createWebGPUCapture.complete (cognitive 35): bench-webgpu.createWebGPUCapture.complete has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, error handling 2 (5 pts), loops 4 (5 pts), ternaries 2 (3 pts) (nesting depth added 11). Of this number, 29 points are the body\u0027s own statements and 6 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":"scripts/bench-webgpu.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bd9915def42e9192424242e04909b7e42153b65e517c739caf2812109c0641"}},{"ruleId":"D2","level":"warning","message":{"text":"_rangeNum (cognitive 35): _rangeNum has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), other 10, boolean chains 4, ternaries 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":"src/utils.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc757361bee2eaa45670d340069a183b195a25ff5743515717a2098d3bc62a9"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.findGaps (cognitive 34): utils.findGaps has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 4 (9 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/utils.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"072742a5410962c4c00a3c0acee15f747039a15ad67e8d69859e26fbfb5ce4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-process-memory.readProcessMemory (cognitive 34): bench-process-memory.readProcessMemory has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 7, error handling 5, loops 3, ternaries 1 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-process-memory.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a34e27e998846da864b06d4555a69438f2c70f7dd83c140f6f7efea62f9d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-grid.validate (cognitive 34): bench-heatmap-grid.validate has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 4 (11 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 16). Of this number, 33 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":"scripts/bench-heatmap-grid.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae53da9ec44cd7ba7fc634f782fbc78009a290876e097baa17de7378c2bf1382"}},{"ruleId":"D2","level":"warning","message":{"text":"points::(anonymous)::(anonymous)::drawPoint (cognitive 34): points::(anonymous)::(anonymous)::drawPoint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 9, ternaries 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/points.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b93ba7fbf38b3e368284e3f2f5809094cd2d1d7407b7ebf8817c7934af602"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-benchmarks-process-memory.summarizeAdjustedProcessMemory (cognitive 33): analyze-benchmarks-process-memory.summarizeAdjustedProcessMemory has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 4, loops 3 (4 pts), ternaries 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":"scripts/analyze-benchmarks-process-memory.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc95c07b41a0f70180d43c9d65417301919ab184cba6f324e07119e2e8223f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-module-bundle.bundleModuleDependencies (cognitive 33): bench-module-bundle.bundleModuleDependencies has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 14 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":"scripts/bench-module-bundle.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"668f54af18ec4537f151c84316c5433e7c2db3a86b564a836fe63d8619985dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-join.previousJoin (cognitive 32): bench-join.previousJoin has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 7 (12 pts), ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-join.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d392a70bab6aa64bdc28a93f756d458bd1b7c2dbece1c4ac5e2e9ff656c1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-suite.benchmarkView.rows (cognitive 32): benchmarks-suite.benchmarkView.rows has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 5 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-suite.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ad7edacceda944a2cf18bdc6122e7236a0e1dd7f8ee65357356b0984461dec"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::initSeries (cognitive 32): uPlot::initSeries has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (10 pts), ternaries 3 (6 pts), other 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2bd788c5aa3687749adb7d90128dd2381103b2d5e0faaebace5253ef1b0362"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-structural-variants.directFixed (cognitive 31): number-format-structural-variants.directFixed has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 3 (5 pts), ternaries 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":"docs/investigations/number-format-structural-variants.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4e4f843d91557635c317ceec2a57fe331d2bedca2995eff227caeb4c5d805d"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-suite.benchmarkView (cognitive 31): benchmarks-suite.benchmarkView has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 6, if/else 3 (5 pts), loops 3 (4 pts) (nesting depth added 7). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-suite.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e386a5d76eaff9c7d4ef1e98f9f5273c9920a66147f09e417063cb0d9e546e8"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.uPlot::_commit (cognitive 30): uPlot.uPlot::_commit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 5 other methods here (uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, uPlot.uPlot::drawAxesGrid, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab61a8dfdebee6ffc6f8f3731b7f0d641954e331d7274d93ef7cc7fe1916c82f"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::strokeFill (cognitive 30): uPlot::strokeFill has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 12, other 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2250}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcc3bc4bcb45eea5f2d3aff6641d996c4cc9527eeb9d61ca030e9efb5dc44c1"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-benchmarks-trace.createTraceAnalyzer::push (cognitive 28): analyze-benchmarks-trace.createTraceAnalyzer::push has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 1 (2 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. This shape REPEATS in the file: one other method here (analyze-benchmarks-trace.createTraceAnalyzer::finish) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-benchmarks-trace.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e40eabb5a631066be8326837125269300eff20a7e61863218df57eaa462d50"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::drawSeriesPart (cognitive 28): uPlot::drawSeriesPart has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 3 (9 pts), boolean chains 5 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"241906bd9ee17355414f2bd4e190f0d98fd793273a0ae775eefe53a99158cebc"}},{"ruleId":"D2","level":"warning","message":{"text":"fmtNumDec (cognitive 28): fmtNumDec has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 6 (9 pts), loops 3 (5 pts), boolean chains 3 (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/utils.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"37da0ad903c83be40989a6c921ce8f01de5ef85c18ff96cad8c8b193e211b565"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-log-blocks.buildLog (cognitive 27): bench-heatmap-log-blocks.buildLog has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 6, if/else 3 (6 pts), ternaries 3 (4 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":"scripts/bench-heatmap-log-blocks.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbccf431b81c38342843b5655659431942184bf6dc72670b8400c6dff2c4fe9c"}},{"ruleId":"D2","level":"warning","message":{"text":"investigate-g2-webgl-fill.run (cognitive 27): investigate-g2-webgl-fill.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (6 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). Of this number, 24 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":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1612c1cbf008cd76e65ae806490e2fcc3217e4012c4770fa4021f30020bbc2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::mouseUp (cognitive 27): uPlot::mouseUp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b31d6f5bbfdcc804b98bbb62d4c768e9378134a646bc750f9e6aa60a25c1100"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-en-611.fmtNumEn (cognitive 26): number-format-en-611.fmtNumEn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (7 pts), loops 3 (5 pts), boolean chains 3 (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":"docs/investigations/number-format-en-611.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca44077eae6f7129afcfe3a8dc93cf5bb1cf80da7d3f4c8eed3f91b609a311"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-en-baseline.fmtNumEn (cognitive 26): number-format-en-baseline.fmtNumEn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (7 pts), loops 3 (5 pts), boolean chains 3 (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":"docs/investigations/number-format-en-baseline.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a4a739ac5ef9323600a2ba3a4a9c30c34aa63d59523a43d89c19486e0b992a"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-en.fmtNumEn (cognitive 26): number-format-en.fmtNumEn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (7 pts), loops 3 (5 pts), boolean chains 3 (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":"docs/investigations/number-format-en.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2a6a9e9c7b7b665c8ed3f1b42f070d813942a8b32475ae31e3d382b3ef0540"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-virtual.fmtNumEn (cognitive 26): number-format-virtual.fmtNumEn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (6 pts), boolean chains 5, loops 3 (5 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":"docs/investigations/number-format-virtual.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"10030a2e32fdf33e927d6ad41cee33ab8fbe7066065c4ac4aaf552e81c0e8a31"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokens.write (cognitive 26): Tokens.write has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-trace-stream.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02186969a50a44d95e43326cf52cc6dfa2e4195dcbc00f03846dca5e13033f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.uPlot::selectLegend (cognitive 25): uPlot.uPlot::selectLegend has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 5 other methods here (uPlot.uPlot::updateLayout, uPlot.uPlot::drawAxesGrid, uPlot.uPlot::_commit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"140134fb656ee98c593a3141dc30325fdf1a8c51248bc61c85ba9e1a51bdc27d"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::mouseLeave (cognitive 24): uPlot::mouseLeave has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":4035}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ea3dcc36391302b15f3bf84c7c47e39021fa5b62ca55a6fb7e8541207ecbf8"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.uPlot::setRange (cognitive 23): uPlot.uPlot::setRange has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3 (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. This shape REPEATS in the file: 5 other methods here (uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, uPlot.uPlot::drawAxesGrid, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51cec0249983fcf6e74090097a758c32fcdf4a1256fc78c2f2d3d15a95cd49a"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-en-compact.fmtNumEn (cognitive 22): number-format-en-compact.fmtNumEn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (7 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/investigations/number-format-en-compact.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e50a869c0567690be5613580fab530c5072ba11cfd9de898295cb82c581d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"getMinMax (cognitive 22): getMinMax has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (3 pts), other 2, ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20979eb87cede37d7aabebd3a5d7df18cd85f3689ebbd87d850418186bcdc29"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark-d3-shared-probe.snapshot (cognitive 21): benchmark-d3-shared-probe.snapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 3, ternaries 2 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/investigations/benchmark-d3-shared-probe.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"124bc6d6032113c1276dcd6c57ee86ded86707365220f8bb162e5678da0a32d8"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-instrument.worker (cognitive 21): bench-instrument.worker has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4, ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"scripts/bench-instrument.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f27c432e8ca4dbf47c6cd1edaf8f82dabbf79299ed58c6aeef02f7031b2eec6"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::resizeOverlays (cognitive 21): uPlot::resizeOverlays has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 2 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"518b43577297dfa9f7a3fccfd491313ee0107f1fa3a673ac9de924591eedfcf3"}},{"ruleId":"D2","level":"warning","message":{"text":"splineInterp (cognitive 21): splineInterp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 5 (8 pts), boolean chains 2, loops 1, other 1 (nesting depth added 4). None of this is in the body itself: all 21 points belong to 4 function items inside it that branch (a function literal at line 6, a function literal at line 5, (anonymous)::(anonymous)::pixelForX, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/spline.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"af330346ad418b35edc8f444e49eac05f6dbb354ad3f7923e0ce93dd35eeea21"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-benchmarks-process-memory.summarizeProcessMemory (cognitive 20): analyze-benchmarks-process-memory.summarizeProcessMemory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, ternaries 2, 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":"scripts/analyze-benchmarks-process-memory.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e31097e020d8a080c1604b3379d9f3bc1286a3c5a4c583562c1a16b64fa71d"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-asinh.fixture (cognitive 20): bench-heatmap-asinh.fixture has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (12 pts), ternaries 4 (6 pts), boolean chains 1, if/else 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"scripts/bench-heatmap-asinh.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed74cd96fb1c8f9ad21113e3eead4a1989ea75bc0ab1b181e7a58a50410606f"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks.server (cognitive 20): benchmarks.server has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 5 (6 pts), boolean chains 1, error handling 1 (nesting depth added 10). 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":"scripts/benchmarks.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf290f98a4faad61dce3f9e456bca077575aaae13fc14f5b635b7561fed3536c"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::rangeYScales (cognitive 20): uPlot::rangeYScales has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (7 pts), other 2, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cdd1b29b27b81bcb0249ebc40af4cef7254c5cc2459079b70ba37072feb939"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.rangeAnchors (cognitive 19): utils.rangeAnchors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 2 (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/utils.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e4a3f0e9b4811ec46ee99a0460d5adf34f4e126480813543eff0cfcd493163"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.uPlot::updateLayout (cognitive 19): uPlot.uPlot::updateLayout has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: 5 other methods here (uPlot.uPlot::selectLegend, uPlot.uPlot::drawAxesGrid, uPlot.uPlot::_commit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40d5a9ec7f460cdabc4a8fa9fa654f24e062c128f1afbaf8703118112030a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-heatmap-minmax.fixture (cognitive 19): bench-heatmap-minmax.fixture has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (11 pts), ternaries 4 (6 pts), boolean chains 1, if/else 1 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"scripts/bench-heatmap-minmax.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c58b1a9dd01013ee7e56319a3f96a47f48854912bfe36d0d59c752399184d2"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-trace-browser.runBenchmarkTrace (cognitive 19): benchmarks-trace-browser.runBenchmarkTrace has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb703d0cf308c85e55477762b5c52d1ab7059b4458087594edb3c0dfd4310cf"}},{"ruleId":"D2","level":"warning","message":{"text":"prepareRangeY (cognitive 19): prepareRangeY has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, ternaries 1 (2 pts), other 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/rangeY.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8c4371fa3d1236be029adbea17436aa148df480d6011393300aea3305c05a"}},{"ruleId":"D2","level":"warning","message":{"text":"monotoneCubic._monotoneCubic (cognitive 18): monotoneCubic._monotoneCubic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/monotoneCubic.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a2b89b8767edc1c079b5c478c044002bc16288cc2cd1c6fb52b251340ec848"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot.uPlot::setLegend (cognitive 18): uPlot.uPlot::setLegend has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), loops 1 (2 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. This shape REPEATS in the file: 5 other methods here (uPlot.uPlot::selectLegend, uPlot.uPlot::updateLayout, uPlot.uPlot::drawAxesGrid, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80ae3ffbc873cc69cddc278ef537cce208cee139f8fc38ed220c52b229aab98"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-process-memory.aggregateProcessMemory (cognitive 18): bench-process-memory.aggregateProcessMemory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-process-memory.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"57455e97f27cf0150e247d7140d9a740dbe9349ddb0106996112f9596276b230"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-phases.benchmarkOperations (cognitive 18): benchmarks-phases.benchmarkOperations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-phases.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"96abeeaee5f66370ff277dfa3233063339e46a8358c91865101840a3ba8fc31c"}},{"ruleId":"D2","level":"warning","message":{"text":"number-format-iteration.benchmark (cognitive 18): number-format-iteration.benchmark has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 1 (4 pts) (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"docs/investigations/number-format-iteration.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9847329bc28c034a0f795d571eca66de7ad19d7a6535cfc05eb3f4467c6d1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-hover.server (cognitive 18): bench-hover.server has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-hover.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca77c80c2e04dc6f0b9de5a158073caa7a20940d97aa98ee38ee7a3f5ba09de5"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-legend.benchmark (cognitive 18): bench-legend.benchmark has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, error handling 2 (3 pts), loops 3 (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":"scripts/bench-legend.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efbf67692148fa1e75701e502d83a2abafe112ec762e68cab2158c99aaec1fe"}},{"ruleId":"D2","level":"warning","message":{"text":"demos.server (cognitive 18): demos.server has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (6 pts), boolean chains 4, error handling 1 (nesting depth added 4). Of this number, 17 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":"scripts/demos.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d583f9108a9920ef5cb2e419131007024a9d30a058f31ce6986c03638bab0714"}},{"ruleId":"D2","level":"warning","message":{"text":"keyed-list.createKeyedList.update (cognitive 17): keyed-list.createKeyedList.update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/keyed-list.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9d83ea9b1817cffd9b7bcbf044db690089ee354483a1753fa69fcd46d66926"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-display.cellWidths (cognitive 17): benchmarks-display.cellWidths has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 1 (2 pts), ternaries 1 (2 pts), 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":"scripts/benchmarks-display.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87e854b7f77e553b6fe7b84b11a1a0fe1f246b296dc9b6536f0c6f506411509"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-suite.summarizeSavedBenchmarks (cognitive 17): benchmarks-suite.summarizeSavedBenchmarks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 3). 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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfdfaa7c59b5cfd585b2b45c102964a9ae95b7fe30b572747f56054449bb0d4"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::setData (cognitive 17): uPlot::setData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 1 (2 pts), other 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"48678950640fcc497a0d4380fc20e1302004342231c520243c3fb234209fe9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::setCursorPointPos (cognitive 17): uPlot::setCursorPointPos has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, other 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bdb05b418b348a1c1d429b038de23819a408091f609aec72cea0a309f451ac"}},{"ruleId":"D2","level":"warning","message":{"text":"logAxisSplits (cognitive 17): logAxisSplits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2, 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/opts.js"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"8303c3921f16cdd1b9182b33f2b5b6a9c36734984bd4cbea06bbe92eada6d499"}},{"ruleId":"D2","level":"warning","message":{"text":"genIncrs (cognitive 17): genIncrs has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (14 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":"src/utils.js"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"885957b4aa1b009735ab6baa0951f4dd3c74e14eae62617d2adb0381ce5bd498"}},{"ruleId":"D2","level":"warning","message":{"text":"createLegendTemplate.prepare (cognitive 17): createLegendTemplate.prepare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (6 pts) (nesting depth added 10). 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/legend-dom-template.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a7c8997a727682e00b109feba1b1d421706d4d151aae4f669b219f45a7d9f6"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.copy (cognitive 16): utils.copy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93f0ded3addf40b3a11cf72a3996e52a3892ba990010431322d93b558cea10"}},{"ruleId":"D2","level":"warning","message":{"text":"h.h (cognitive 16): h.h has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 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/h.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"15068693f31684bb9c354e40fdf660d14a0756f856fe03b9fcc65f6f684b0d1c"}},{"ruleId":"D2","level":"warning","message":{"text":"catmullRomCentrip.catmullRomFitting (cognitive 16): catmullRomCentrip.catmullRomFitting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, 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/paths/catmullRomCentrip.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2fbf3f38bd7329cb773b275cb193594fd15cd89e04f94ffecef8ae187f043e"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-hover-browser.runCase (cognitive 16): bench-hover-browser.runCase has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), ternaries 2 (5 pts), if/else 1 (4 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":"scripts/bench-hover-browser.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b7519519e371d385540fc09ac87723327cd0937f06d1a3f48a26363f2ae79b"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-suite.assertCompatibleReports (cognitive 16): benchmarks-suite.assertCompatibleReports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (5 pts), boolean chains 3 (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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9daa7243d4f926f22e6e63ee0249b46de78324e9c5b70d41569e9490c35239"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmarks-suite.runWorker (cognitive 16): benchmarks-suite.runWorker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 6 function literals inside it that branch (lines 329, 290, 276, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-suite.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82aea3f99abb397a02515b063ef58950c7d7ed147ece220f9d5607694f4bbfd"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::syncCursorPointLegend (cognitive 16): uPlot::syncCursorPointLegend has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 4 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"854730ed2bbf782631bd962be6731d578e6ec0ed9ddfe02460bedee2041b2b25"}},{"ruleId":"D2","level":"warning","message":{"text":"uPlot::autoPadSide (cognitive 16): uPlot::autoPadSide has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, ternaries 2 (4 pts), if/else 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/uPlot.js holds 21 of the 109 methods over the threshold \u2014 including the worst \u2014 and 899 of the 2812 points over it (32%), 4.6\u00D7 the next-largest file (scripts/benchmarks-trace-browser.mjs at 195). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c76cde2571a9805e80349f5e2ab8b10d311e385e5652a1bdd6d5dee42aae88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: uPlot.uPlot: FunctionTooLong \u2014 uPlot runs 2434 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2334 over it, 24.34\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/uPlot.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"726900b25ca660edd997529088a2213c3f62f813c5a051bf049cac3000764d60"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: uPlot: ClassTooLong \u2014 2434 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 2034 over it, 6.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87d4a5cc3b33b7ec557163f292ca009a20cc0b6f92c1d3e1f28f784cabe9d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/uPlot.js: FileTooLong \u2014 2759 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 88% of them inside a single declaration: uPlot (422-4284). The bar is 500 significant lines; this is 2259 over it, 5.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d75d597152f984fc020dc924f27bf2a975a0e0ddf3c73699077264e9e10565"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze-benchmarks-trace.createTraceAnalyzer: FunctionTooLong \u2014 createTraceAnalyzer runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\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":"scripts/analyze-benchmarks-trace.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f2814e29c3dbbb26e6b28e55c065270bb767be079eb3f070a02829c95c1eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: benchmarks-paths-browser.runCase: FunctionTooLong \u2014 runCase runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"scripts/benchmarks-paths-browser.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c94b115b5f6f7b0d07387be2950cf4cd2c1d99a74020b9aeeb090b7b0b8fd23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bench-webgl.createWebGLCapture: FunctionTooLong \u2014 createWebGLCapture runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.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":"scripts/bench-webgl.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f354af0b3fb8fd6ef6aad39a2b38ecd82c0d9c753ad58ebd422582b0f6a18c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: benchmarks-samples.captureBenchmarkSamples: FunctionTooLong \u2014 captureBenchmarkSamples runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-samples.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28fae07d5d64a8d2e4bf702a8e89622f517720d5e766a2f25efb40c1eab1deb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: benchmarks-trace-browser.reportMetadata: FunctionTooLong \u2014 reportMetadata runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"605047512e00dd652e4471d7b68732dcc047de5482498e1fbc2c9503acf51f05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: opts.genTimeStuffs: FunctionTooLong \u2014 genTimeStuffs runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/opts.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"239c373b48afc8a26adcfc3248511a2f6bb41f6121565c20c89d2d2b6cc3536d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: benchmarks-trace.captureBenchmarkTrace: FunctionTooLong \u2014 captureBenchmarkTrace runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"scripts/benchmarks-trace.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4506b8a9a1103bd02dc7f9c4d63f0a76663d42794cca10e7a18e8e59e9e8705"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/benchmarks-trace-browser.mjs: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 over it, 1.38\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":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e38f15ce7894eab80c36858583756e9488cc2fa90871a6605e82f7e30b9afb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: investigate-g2-webgl-fill.sample: FunctionTooLong \u2014 sample runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"983f90b122d5eb27db9945f24c137dd6883c5a572ee31326a1e78fe75c3f2e35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bars.bars: FunctionTooLong \u2014 bars runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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/paths/bars.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dab4067b53f84225f244bb4de210466be1e5d05c06299d463c7de631649b64e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: points.points: FunctionTooLong \u2014 points runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/points.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba189ab188fae71249cc4f9931d5efb3339130e71ee025f0ccf0df57a0bad2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/opts.js: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 84 over it, 1.17\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/opts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7f23a0b45600d58d6bff79927803c7d4689451073b107602aa11cc81c3966d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.js: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"076d6d59b840ced27e0b07568932fb35a302a9643dd077dbb119c0ee86602769"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: legend-dom-template.createLegendTemplate: FunctionTooLong \u2014 createLegendTemplate runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/legend-dom-template.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"87370a113a8ab884089e055b7b65d58f06c0bcd3d5307727d3a09bb88f41b83b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bench-legend.benchmark: FunctionTooLong \u2014 benchmark runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-legend.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5772a41402af438f0d2a89a45fa4e613af07bf1c81c96b6edd4b01293c8f8705"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: probe-worker.createProbeWorker: FunctionTooLong \u2014 createProbeWorker runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"scripts/probe-worker.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"39efce07714adda336c2b02517a8b0cecebb9eb364293dddb950113686e9bb7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bench-instrument.main: FunctionTooLong \u2014 main runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"scripts/bench-instrument.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f086548f0ee7e2353987fd84d59154c3d30bd709873d32ae4766b96f119d9c52"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Element (LCOM4 5): Element\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/tooling/bench-dashboard-lifecycle.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33bb000e8b5c348720426b1af7deb3fcff30ad10233afd1ded9866671c1af98"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: paints changed cursor-derived focus in the same data commit: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cursor-focus.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e98fc2b26e0afead49d09a06ef975abc76f48a9f084ee356c741f0a5d60929e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: delSeries preserves the shared cursor point when deleting a null point slot: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8de4a409485801a8dcfd4f5adba6cefa4612df9f9872151c3ae58a9c091add5"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: delSeries accepts a custom cursor points.show returning no HTMLElement: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4958434be2334f4ddecfbe0ea753296fbc9c48fa31ce471c00a69f6b968c64"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: delSeries clears focus opacity after deleting the focused Y series and committing matching data: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c48212ccfab3e7894b108923c96211b70fe1c3e7598e018e4073cc094aaaaf1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: destroy during a drag detaches the document mouseup listener: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c887aa85cf7acd7aa722432b8cf843fdd0097c90d1656120bf2a36c53d2e2c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: destroy in drawClear stops the active commit before subsequent paint or draw hooks: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bd56529d395ffd917cfe2734271978949c4b0db04fdaac34e403a500fac210"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: schedules later canvas work after a batch callback throws (deferHooks=${deferHooks}): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"76613fa3bc98a2bbf783920e375e914d945922bf14adf8607910a63d4d07a384"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: restores ordinary hook delivery after a deferred batch callback throws: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eca8827f70d93380546ce9d6a44109f14ec6cd246486a05a1ef55db6409386"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: preserves outer hook deferral across an inner nondeferred batch: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"425af7fadf7c94078b6bc831146d228359d49ba03d520492af9293d14492c970"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: retains a cursor refresh requested by setData in a setCursor hook with unchanged ranges: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6bf1aee33600373f039a4e396a19b5cda06e0fdf8a8185f099576deab001fa"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: retains a legend refresh requested by setData in a setLegend hook with unchanged ranges: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad23c5003cd70b71fedae45de5a758c57e80ceb3e5692c5c35761900b93943cf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: rejects nonfinite and invalid tick bounds without looping: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/asinh.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"67781a195b027a753ab95d0ace3f0c7283ee333a12a5a1af74032feb64cdf9b3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: imports without DOM globals: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/keyed-list.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c882a8ce0d91d8c278a4cad0526eac4e146a7c7987c7017d578bd6ccd5ab1534"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/precision-scales.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0b7f8b3ad10fe9c94533bbc26253784428ff756623ce9661d2371b4a06315b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/precision-scales.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7da56f28bc9bca43342488f96416a61971b9af341b21d414883737f006cfa8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not scan trace data in measured creation or update paths: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/tooling/bench-dashboard-plotly.mjs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"987f170263ef01cdc6e439703c5eef4d0866e41bf8de01c1a08c538185342c40"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: creates variant-scoped hosts and shares one awaited stylesheet load: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"908dcd4ac50e8006642fbf3fd954a2a740642d4a335c8b4cd430af4df92fae9c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: boots JSCharting through the standalone runner despite its benchmark-only restriction: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e1c6271a39f2fb33689434fbaebd0b287e7f24424b1ae7510bd3d9a3829f14"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: rejects restricted standalone demos before loading dependencies or fetching data: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3caaa32d811ba370d8d43b3d63444955583f9c0d9bd67743d986a8f3df04b5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: prefetches SciChart binaries before data preparation, preserves options, and never loads WASM as scripts: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"710a3ffa00e55fd69422a9497de18627d9baabc949803fa30ae3ae4f13b2baf7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reports a standalone binary download failure before creating a chart host or fetching data: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"48289cb9b6b3e1cbf56ff76f2b12431658a0e3601db521fbe8346e5572ce5cd0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: loads module namespaces before host/data setup without inserting module script tags: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"071089a29fcc69f34702d68578932f1f771d24fa30e5ccdc7a6268adb150e49e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reports a module import failure before styles, host creation, or data fetch: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0b2c4b61d7bd917c5ab4299596816bb7b29a7bdf661d71bab90298aad0cce2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: awaits Google runtime preparation before host/data setup and leaves table construction and draw in the render callback: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9ba758a744351f0acf6f751b6b64b3af674ce6767f27e7cb3fdbee43f25fff"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: propagates Google preparation errors before creating a host or fetching data: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"79375f3d068423eaae5828b2a80923877d8a50f2ee708e463d55be6737deee10"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: rejects a failed shared stylesheet load: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e166cbec5792a2e01eefa80759c96e8be9a0a101c714a3e82df86656e3ac471"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: boots the actual uPlot module with ordered local dependencies, prepared data, host, wait, and instance return: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-fixture.mjs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d9f600d1621b4869046595a75d77deacb38aec5c98f6191a2451420e1d2228"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${id}: parses its ES module: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-sources.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a565fbd3cce16a2efe81ddfff9969046ebb742f4774958b9a9065da46ed563"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: imports the actual ES modules without fetching or creating charts: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-demo-sources.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cc6cc22dc1d92bd86c8491b0843b6513d2f3bb5029edabbd70bf06181b84b2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${variant} DPR ${dpr}: three real GL samples with full data, axes, readiness, and cleanup: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-webgl-adapters.mjs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"966e4d54f5338a0152cb32d6878015ecd729c8d7c560932d56bc12d975061c84"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: bounds a stalled ${phase} poll drain and skips destruction: This test starts work it did not wait for (\u0060rejected\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(0)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/tooling/benchmarks-samples.mjs"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c216babe77f43ef8e9772d6a24090a168c640eb8df1b197aac7976a0cda2afdd"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: SciChart: waits for native license validation, then still requires GPU completion: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 70))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/bench-scientific-adapters.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c752c162edf15550d2c932d2d3d4ac6f14e5b723b712efcae326f5dbe435141c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/uPlot.js: src/uPlot.js changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 1166 in uPlot.uPlot at line 422. 3 of those changes were fix/bug commits, and the other 48 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- src/uPlot.js\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/uPlot.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"179755053ec932e13e43e9b31aeda196f80c804369cbbe881e196247a925d79a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/benchmarks-trace-browser.mjs: scripts/benchmarks-trace-browser.mjs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in benchmarks-trace-browser.validateChart at line 260. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/benchmarks-trace-browser.mjs\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":"scripts/benchmarks-trace-browser.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8abec7a46c400c9648f87400317113b31fa502adf0aeec72ce26026535dd70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/analyze-benchmarks-trace.mjs: scripts/analyze-benchmarks-trace.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 121 in analyze-benchmarks-trace.createTraceAnalyzer at line 114. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/analyze-benchmarks-trace.mjs\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":"scripts/analyze-benchmarks-trace.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbce01b4a65491d90348d1d15e6f9bc0840d4f5a18f5f291b3d89850d4f04a85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/benchmarks-suite.mjs: scripts/benchmarks-suite.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in benchmarks-suite.runBenchmarkSuite at line 347. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/benchmarks-suite.mjs\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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bff65080ca361cce59cf61b77204a4453fed7354971ae00f0e6267ba6208c83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/rangeY.js: src/rangeY.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in rangeY.selectRangeY at line 110. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- src/rangeY.js\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/rangeY.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"155041499626339f0ad4ba86c9ff4735fa7212c6f2696f57ec018a10b775fd0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/plugins/bar-chart-plugin.mjs: test/plugins/bar-chart-plugin.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in (anonymous) at line 10. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- test/plugins/bar-chart-plugin.mjs\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":"test/plugins/bar-chart-plugin.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca090eb7a00775a672f0cba3eb3174b5d0b6d749d487c1f99813b1c459afede2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/benchmarks-trace.mjs: scripts/benchmarks-trace.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in benchmarks-trace.captureBenchmarkTrace at line 59. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/benchmarks-trace.mjs\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":"scripts/benchmarks-trace.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c5bcb7fa34942206d42dcc36d4796f9dfc41f5f2e6d0028af851e4aa136e35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/benchmarks-samples.mjs: scripts/benchmarks-samples.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in benchmarks-samples.captureBenchmarkSamples at line 17. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/benchmarks-samples.mjs\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":"scripts/benchmarks-samples.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"802a485b212928b4723d0ff935c9d388d3200b5047f8c76108519e099daa5229"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/utils.js: src/utils.js changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in utils._rangeNum at line 259. 3 of those changes were fix/bug commits, and the other 13 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- src/utils.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb92ab3eb9fc96946134292ebd99381e7f038081725d624612f8d6f0d99123f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench-demo-sources.mjs: scripts/bench-demo-sources.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in bench-demo-sources.loadBenchDemoSources at line 6. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/bench-demo-sources.mjs\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":"scripts/bench-demo-sources.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c5b87622803e7a377313f0d126edecb45afba2c7369c65784f8752657a8af5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/lib/barChartPlugin.js: demos/lib/barChartPlugin.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in barChartPlugin.barChartPlugin.opts at line 274. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/lib/barChartPlugin.js\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":"demos/lib/barChartPlugin.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7af9a56ec9695020ffd57d43c8b3c0b59048bc6c635ec591509278a9d1ab253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/benchmarks-display.mjs: scripts/benchmarks-display.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in benchmarks-display.formatTable at line 105. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/benchmarks-display.mjs\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":"scripts/benchmarks-display.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a886b38c18b41757b79e161808c1633ab932456214ea1f8f706bdf7810c1ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paths/points.js: src/paths/points.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in points.points at line 14. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- src/paths/points.js\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/paths/points.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"569309d735820b41ba1618bca42cc1a1bdd17bd3608930d8eca5145aed8312bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/range-y-chart-poc.mjs: test/range-y-chart-poc.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in (anonymous) at line 81. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- test/range-y-chart-poc.mjs\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":"test/range-y-chart-poc.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0de9ebf44e1efd090395f4cefbf2a7cea8805904b0f98e5d0e8651a041848"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paths/bars.js: src/paths/bars.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in bars.bars at line 35. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- src/paths/bars.js\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/paths/bars.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8b48232ba9db0ed314d0b1f144a65ad67be74d2a6e8791cc8dd1fed4af8adc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/d3.mjs: bench/d3.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in d3.makeChartWithOptions at line 324. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- bench/d3.mjs\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":"bench/d3.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a3d0d96e54b0cc3a6df488ffd1cb28be17c4604ae2d613ba08a4c4117e13ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/lib/barValues.js: demos/lib/barValues.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in barValues.createBarValues.draw 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/lib/barValues.js\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":"demos/lib/barValues.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0265dbc94b72ae0b74ecfa2de229732603c0d750018a763c2f555cea542406"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/d3fc.mjs: bench/d3fc.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in d3fc.makeChartWithOptions at line 49. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- bench/d3fc.mjs\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":"bench/d3fc.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0445a96b8884f99d3b9242ce48771c38da70095651abf1e28885fbc99a118d80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/analyze-benchmarks-raf.mjs: scripts/analyze-benchmarks-raf.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in analyze-benchmarks-raf.summarizeBenchmarkRaf at line 16. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/analyze-benchmarks-raf.mjs\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":"scripts/analyze-benchmarks-raf.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4f710f3bbd7e398ef5c0a6370bce654005ca04c5fe7d77dd5aaa96272c5477"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/plugins/heatmap-plugin.mjs: test/plugins/heatmap-plugin.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in (anonymous) at line 364. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- test/plugins/heatmap-plugin.mjs\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":"test/plugins/heatmap-plugin.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0f51f18460f3515b78b2ced786c1450e7090c8ff02756c7023db34be01e51c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/deckgl.mjs: bench/deckgl.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in deckgl.makeChart at line 29. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- bench/deckgl.mjs\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":"bench/deckgl.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8b734e76b6f5eb2003aacf791832d52fc776ac85662d028fcfce245df4472c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/timeline-discrete.html: demos/timeline-discrete.html changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in timeline-discrete.html.timelinePlugin.opts at line 282. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/timeline-discrete.html\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":"demos/timeline-discrete.html"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"167b259bfb193d40a101851b78632a8ece8c341ab3828454ce7142c5c6006144"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/analyze-benchmarks-process-memory.mjs: scripts/analyze-benchmarks-process-memory.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in analyze-benchmarks-process-memory.summarizeAdjustedProcessMemory at line 111. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/analyze-benchmarks-process-memory.mjs\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":"scripts/analyze-benchmarks-process-memory.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3fa7dcb3d981ff031d6567f450e148e035660a94425b1eeb3d2a8732581f5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/benchmarks-phases.mjs: scripts/benchmarks-phases.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in benchmarks-phases.benchmarkOperations at line 26. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- scripts/benchmarks-phases.mjs\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":"scripts/benchmarks-phases.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d973a7a9c5583c5fd854587778e458eae099bbe2148eb8dd1df7d9cfa7a6fa2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/legend-contracts.mjs: test/legend-contracts.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in (anonymous) at line 53. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- test/legend-contracts.mjs\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":"test/legend-contracts.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"46faec8dc72c096b21acc09fb823c8635e2e5fa6c6f1797a593ebd54c6dcac2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/lib/scatterPlugin.js: demos/lib/scatterPlugin.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in scatterPlugin.pointHover at line 36. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/lib/scatterPlugin.js\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":"demos/lib/scatterPlugin.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65d491ca3a01a45dc1c1b7f4276b7db524187b1bd10d51247c8c6abef4fc55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/heatmap-cells.js: demos/heatmap-cells.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in heatmap-cells.createDemo.createPlot at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/heatmap-cells.js\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":"demos/heatmap-cells.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a7260c6dd3f36517e61a33771f38de9dafd942ddeab9e644e325afe9af77f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/axis-label-rotation.js: demos/axis-label-rotation.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in axis-label-rotation.createDemo.createPlot at line 107. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/axis-label-rotation.js\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":"demos/axis-label-rotation.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa894ac973debd95e397da7928479f202b76c5a12b6e9715ccb82f236c9f937"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/band-drawing.mjs: test/band-drawing.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in (anonymous) at line 177. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- test/band-drawing.mjs\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":"test/band-drawing.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"638d2ea56bac9bf24d4b4c765242a59992f248d476074b19acfd5c0b6665d61d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/lib/heatmapPlugin.js: demos/lib/heatmapPlugin.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in heatmapPlugin.heatmapPlugin.draw at line 297. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/lib/heatmapPlugin.js\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":"demos/lib/heatmapPlugin.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b410c275bd4836f3881b1804955d2c22d5db4abe63c4bffd51689322fd4bbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/integration/bench-managed-adapters.mjs: test/integration/bench-managed-adapters.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in (anonymous) at line 163. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- test/integration/bench-managed-adapters.mjs\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":"test/integration/bench-managed-adapters.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77a0d821aa05ef7042f3dd214a70c570e7bb12e782d77e3ffd33eaf682cc491"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/demo-fixture.mjs: bench/demo-fixture.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in demo-fixture.setupDemo at line 20. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- bench/demo-fixture.mjs\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":"bench/demo-fixture.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e12a37e6b6e203568ef9d411d8d7c0663b563ae711b15d1684264cb2f279b7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bench/chartgpu.mjs: bench/chartgpu.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in chartgpu.renderChange at line 148. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- bench/chartgpu.mjs\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":"bench/chartgpu.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"934eacf06e87a90a9572551cc736606c0172e5bbbf541089b9d14bcd1719a105"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: demos/data-smoothing.html: demos/data-smoothing.html changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in data-smoothing.html.fetch(\u0022./data/taxi-trips.json\u0022).then().then() at line 76. 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-29..2026-10-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-29 13:09:45 -05:00\u0027 --until=\u00272026-10-27 13:09:45 -05:00\u0027 --full-history --no-merges -- demos/data-smoothing.html\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":"demos/data-smoothing.html"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9290e1b826ce264bf3c15eb8894445842fbefaf7a31931f46361b50c2365c436"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (43708 LoC, 405 module-visible types across 9 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"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":"70c1b4189ca4181add42ff7af123c90c72b0a143dcb8b5a2397ea26f661ed192"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee69a6d91e93f0000e29df295a5c325869241ec9e9ef89c6e992ab97f25a8b3e"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d2eabc4633334fe643904e091739ebd364e3789042694e6c7686baa91b22c18"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fb27e9800d808b5ea6c32658cddddeb11e65bfb7a19085db1c383048ff59f3b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89ceca5aee346c966d0a9c4201f6b753317b6b911d80306d8a213c1b273a7481"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb58fa3cb5edcb08b270f71cd8f93bb6b7f85ac320a4a98519d2ffc1c7c3e05b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ae4c11872d16ea13d32f4ea025d30a9c8394684f74998384280b352e1742186"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81eb01516df299576edbddb7ede8e50ae09263373e4907e7a60f93ed6d466131"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2b7710ba77893bc296e1d0c06ccf91e17474584cd26c94bdb6b6233463695f7"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Comparison is always false \u2014 nothing compares equal to NaN: \u0060\u003C\u0060 against NaN is false for every value, including NaN itself. Use \u0060Number.isNaN(\u2026)\u0060 \u2014 the test that was intended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-heatmap-minmax.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"26573eaf873bfa145074894835111f4a1b2752674f64c35e3e22b123c5912a51"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060retNull\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d731d2effc37c80ea432622b5628ac09eeb56e0d3c022672bc1a399093503d46"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060retTrue\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8378bce511391cd1cb25fd55785bcc2b69b57daa303fb284c66300ad713abe50"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060flush\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/audit-grafana-scales.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"49757ca62a35e61355815465d07f7d6bfe6cc7e9d2f16e2974564d8b100daea4"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cursor-focus.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e049c1281a11b3d2a42899a7a9542fca9521fddefc95b066709e191d5ea691e7"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c284933d27604e28aac25ed3c1cbafb6de106505236e96357044eb7263f51f4b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dbddd42b019dc1724955700fa9cd51feb73ed287de50e323af36c7d742ff18"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"562b91cdd8dfe188de2d6b6f64bf63302ff00b04e675b210a4533849c502a6f2"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de4d5b3db7fb3dedad280c4991f9ba3365afd3529b74607fafb10b491d839c1"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-lifecycle-bugs.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde2a2bdceba7a54c786304c1d1f83604ddc54fef3020ccbee42aabe46af25ad"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdb23bf40f83f84570cb0ca00c163b85ca939a3be4bb2e4bb5a6618fb9d8d75"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0010be5ef5e9e9f9990e8d8ba9f13a702b9e740cfe7cf9414c94de9a8ec73d"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a6689cf8f5e2fc7d10d85e6cb21b5a9ba7530ac0e20a1ba658a1a2b47ff18e"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"690356155dc4f2c27cb3eda5732c8c2fa44860ca5813540b9c752bba1d694bbd"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/master-scheduler-bugs.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ee404e5aa5b007884f3896d2386aac75aacfc2dbbd61f68d6a27fde30da9e7"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 42 JavaScript/TypeScript production file(s) this check read across 1 module(s). Each was searched for its ecosystem\u0027s logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/javascript\u0060, or eslint-plugin-security \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: a busy-wait on \u0060i\u0060 in \u0060sort\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":"demos/lib/flatbush.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45e711b837f2dff39d3dac190b240526618442dac44f9fcc6d847c5ee676987"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: a busy-wait on \u0060j\u0060 in \u0060sort\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":"demos/lib/flatbush.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee488773c7c9a0a3e9d8e87479c266ceaf21987b66e0c5f45bc2718df837dd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060runBenchmarkSuite\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/benchmarks-suite.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"189c907f78fbcd6b02a0d01f74940eeff7f1ccb58a98a83050ce03a4c3cc5d61"}},{"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":"scripts/benchmarks-suite.mjs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b46d921bf39bb2c8613697dd16b62b541085a2d1b11e5004280351e1aa10425"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runBenchmarkSuite\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/benchmarks-suite.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c57995aa3005b1e7306dca9581d8147e96a18214b9b1cd752fcd7e40e959ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runBenchmarkSuite\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/benchmarks-suite.mjs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd12ec2c2e0be6da8ea6f3cc75309a3460ef209222a9e4e52ba2ea2552b6415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060captureBenchmarkTrace\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/benchmarks-trace.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4a5dd83085a79655f9df2e196e6a6f5ab1ac31c4d8dba5aa735faae8539c38"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060captureBenchmarkTrace\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/benchmarks-trace.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5789026c4042761483e99da7795f4a70915a74b03b453a39005280d2eea7ee7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060gzipSync\u0060 in \u0060anonymous function\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/investigate-g2-webgl-fill.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34e65ff6bb5d309e309153f6424f243868d13635500da9bd1e1d158937ea2a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to captureStep\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/recorder.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"715dd7c8b3be127641d9cd560be0f837c423056cb0a655c59371ddb5152a7be2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to captureStep\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/recorder.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d542d7771eecf2e45de172c196e9304cf33f57372dd31157d1f3ee6ec5382932"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to captureStep\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/recorder.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"280106dab77b0ab7b2eb25b0d00eb8dc4621d8d8254720b8a76a808a9fab9bfe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060anonymous function\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":"test/integration/bench-framework-adapters.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ea0a71fcefe57ba8afe2bbd450d925e06d2e159d29c56818b8cd6bb4da0744"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to map\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":"test/integration/bench-framework-adapters.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d7abe0b2e60695bcdda8bf26d13c007ed1daa3adccfc046a726e6b9f8941fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5612a3178fa5fbab700bc79f3c3291b22204b10009b5cac92a22e87a0b5ae9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6817d5aa1706133f8fb9f590a6ce136497958edb0c782485245757015c11e598"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e51ec23cc97abbcb2735d8ae6f057a5cd3d22706c21c5d01277fcee54b54e56"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f25088923fbd230e3a22b679116d8f92ac4ab0e6826407f03b0229dab2dfdef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to metadata.find\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bafb6625880d2ce39b5231122c6e9a1761a291346d21655734f5eb66be879c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"997883f291b875f32317098676ed03b7eb420ef6feefcb5bd116de34202b5a66"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb13007de485851611769e177680e258aeffa754e5fc42cf4b73c36f663656fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to before\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":"test/integration/bench-lifecycle-frameworks.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b637df2e80899878b586ea5bac2750927870eb01addb3c8a6550673c673ccb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to createServer\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":"test/integration/bench-managed-adapters.mjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb1192c449e68893138540ff6d42762fac9cd413595ca42b9e40bcd8055313"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to before\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":"test/integration/bench-managed-adapters.mjs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a42637f138ef74740d765fd69ec82316dbed27e28bdb7950226d7096fd56d7"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 2 typed \u00B7 174 plain JS \u2014 the untyped files are scripts/audit-grafana-scales.mjs, scripts/chrome-headless-shell.mjs, scripts/coverage-files.mjs, scripts/demoSteps.mjs, scripts/demos.mjs, scripts/instrument-source.mjs (\u002B168 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): src/paths/linear.js:22 \u00B7 src/paths/spline.js:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 465 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/linear.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"63838388a5a860796902baaeab5ccbb972ba55848b4d763091f60e8bf65648a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): scripts/patch-bokeh-highp.mjs:66 \u00B7 scripts/patch-echarts-heatmap.mjs:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 332 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/patch-bokeh-highp.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9a0d20054d4b89d6f3d575f0fcf2ac85c1e8c94ff86b66e9c333329145d55e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/uPlot.js:3623 \u00B7 src/uPlot.js:3643 \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/uPlot.js"},"region":{"startLine":3623}}}],"partialFingerprints":{"codehealthFindingId/v1":"53175cdcc4104d22e6eee50edd988f06bdce27404069f8c49602c05dba2619d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/uPlot.js:3704 \u00B7 src/uPlot.js:3720 \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/uPlot.js"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed43884eeafe56347b4a3e49ad51579834262ed0c35fc5ac1355516dbd7b687"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/opts.js:720 \u00B7 src/opts.js:755 \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/opts.js"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4305660bdddba40c1f2cdf9aee46c7bb8ef7f4da28e7f42a7e4f3875528439e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/paths/spline.js:59 \u00B7 src/paths/stepped.js:82 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/spline.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbde3392382c524b6e8822f910bf08680d992ad19dda1e20ef3189b6054462f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/investigate-g2-webgl-fill.mjs:245 \u00B7 scripts/investigate-webgpu.mjs:117 \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/investigate-g2-webgl-fill.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9450415c1a0095ed800bb981c68ea8a48fd32e0c62345dfefbd31ec76309c26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/paths/bars.js:59 \u00B7 src/paths/stepped.js:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/bars.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7be42e6811169c228ca8c01a7c91497a4e8736f6318d3e67a82754ab953279"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/paths/linear.js:130 \u00B7 src/paths/stepped.js:80 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/linear.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b567fd3a14463aee45c340129a214afe5deda25e2e3d6baf0f96fe76cf819bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): src/paths/disp.js:65 \u00B7 src/paths/points.js:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/disp.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c78d0f9d3a9f4d5bd6bbbc434f2c33394290ea3e1e1c7bfa60cc44b0c3abff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateCursor (cyclomatic 120, cognitive 329): updateCursor has cyclomatic complexity 120 and cognitive complexity 329; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/uPlot.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0499ec660e66c14a98c49d0695d7715b47d2d2b097d113b48ca5af222a25a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uPlot (cyclomatic 88, cognitive 98): uPlot has cyclomatic complexity 88 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":"src/uPlot.js"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28e6aa71dfc61e2c9a63584e9a6813688a45c3ffe62d3f7e392aa9c7b9dd854"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setScales (cyclomatic 60, cognitive 102): setScales has cyclomatic complexity 60 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/uPlot.js"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d58e02b1883c2a26802452b49e5e4120c24298af19b03983147b2d05fd619cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectRangeY (cyclomatic 58, cognitive 99): selectRangeY has cyclomatic complexity 58 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/rangeY.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bafbcb3315da60e4c3ce59a487c17b74280e38de9d9e8a3bc2509332712377"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateHeatmapCells (cyclomatic 48, cognitive 85): generateHeatmapCells has cyclomatic complexity 48 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/lib/heatmapCellsData.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fad9c7fd0718c9fa006433c7cf3eaf1dd262bcc5242cafd0e8600d8aa44fe67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initAxis (cyclomatic 48, cognitive 61): initAxis has cyclomatic complexity 48 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b3cd0f5a25cd59814d2b59dc864e9c28078565f534d4e8298fd46098030ef0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 46, cognitive 67): (anonymous) has cyclomatic complexity 46 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/paths/bars.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b86380764976a98500ea2e353bc1b6b7e68a6ec7227e43f32cb854be3c490b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawAxesGrid (cyclomatic 45, cognitive 109): drawAxesGrid has cyclomatic complexity 45 and cognitive complexity 109; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/uPlot.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa399efae0ee839544f251de2773328b1d7513176ec1157d8a4a3b1cf331c29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initScale (cyclomatic 44, cognitive 100): initScale has cyclomatic complexity 44 and cognitive complexity 100; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/uPlot.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5737be6d65c1ffd5a561bcab1e96e569046803226892642617b651994ee53430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 87): (anonymous) has cyclomatic complexity 38 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/paths/linear.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee21a16bbee8e306404e6e9efa33e545310349f4c9f16d58d267d8f0250564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 37, cognitive 81): draw has cyclomatic complexity 37 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/lib/barValues.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6ff67b4fd1b97da3839ac916875dc03c56e007af918ef84c7b83f9e3a6d38c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 77): (anonymous) has cyclomatic complexity 37 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/opts.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8793ec78f0f7604a90d349f40ee8b89190156536b9ce7ac3f80db24464ad55ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 39): (anonymous) has cyclomatic complexity 35 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/paths/points.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9058725edaa38019e817bf19a3a977b04b2e7b9cfc1dfaa5b4e06034a834e9d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _commit (cyclomatic 34, cognitive 30): _commit has cyclomatic complexity 34 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 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/uPlot.js"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd13a2c911fcede127db018f8b6a42ddd4c19917523b1d6704903dffc1e8ee3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 33, cognitive 53): detect has cyclomatic complexity 33 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/lib/dbscan1d.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d59e64823151788b8edd277bc31865f4af90624b29b982679d6725f34f726a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function opts (cyclomatic 32, cognitive 37): opts has cyclomatic complexity 32 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":"demos/lib/barChartPlugin.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c022c519a9aa5daf98cfbbc1a23d7fecbfd2fb486f6212d8409a2e2e1529c82d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPoint (cyclomatic 30, cognitive 34): drawPoint has cyclomatic complexity 30 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paths/points.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ceb34656220c42e1b0756c5c0080036814746854fb3a0aca2210bfe58bd005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initSeries (cyclomatic 30, cognitive 32): initSeries has cyclomatic complexity 30 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/uPlot.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89e1e6c28a46a1189d58749bbc095083cb136827b2ce4469c50c70662a077b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataIdx (cyclomatic 29, cognitive 72): dataIdx has cyclomatic complexity 29 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/uPlot.js"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"75847340d3b6ad6147452f53376783987711b9dcf1e40a2c3158c98dc51267fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertDrawing (cyclomatic 29, cognitive 70): assertDrawing has cyclomatic complexity 29 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/high-low-bands-toggle.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a81e3b5e910ff71f09a923628424dbeed2e32ac3f32c85921097c555ba5b4cc"}},{"ruleId":"R3","level":"warning","message":{"text":"src/uPlot.js: 3444 lines of code: src/uPlot.js has 3444 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/uPlot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b5fa733c3b8834137afc40c44e1f157cec02fe88e84c182e753edb08a8949a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/opts.js: 739 lines of code: src/opts.js has 739 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/opts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d339417e2a1416791277ce455200809c810391e2bf0def728df57cd69ab1d568"}},{"ruleId":"R3","level":"warning","message":{"text":"src/utils.js: 679 lines of code: src/utils.js has 679 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2e9f5af2e2ef1b6d5fac2c1fdce1160296ec409624402a6b919cf4d7649023"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/issue-demos.mjs:7 imports \u0027../demos/issues/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/issue-demos.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7579a9073d54f7959f7dd1a4a4692abf94a35b27d2d103fe2ef8a0dcb9cf86"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/time-lazy.mjs:19 imports \u0027./src/fmtDate.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/time-lazy.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7b6efd1b5a7ac33191312edb81117d6cbe2d1c3fbecda1564df6219caa32ec"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/time-local.mjs:8 imports \u0027./src/fmtDate.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/time-local.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96f9cd91eda084a2e04c65ece03ea3aaf0a2b4b3b471715440b14193c573c67"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/tooling/bench-dashboard-demo.mjs:103 imports \u0027../../bench/dashboard/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/tooling/bench-dashboard-demo.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"de656ab9e295f0540402b1f0bd28a63686443516fe9b62ea25b2bae5383052b4"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: test/tooling/instrument-estree-chains.mjs:8 imports \u0027./estree-chains-fixture.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/tooling/instrument-estree-chains.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8011dded9bb3cabef49b0339308ddc02399f9f5ebf9cda86372630a1b3d201b7"}},{"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":"scripts/audit-grafana-scales.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"033a074ddd469e6e85bec1ef4fa7a9546be240d0658d64417f53cafc9239fcdb"}},{"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":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cfe8edae69dc19c0c27bec699103d2b4762b1c8fbee76e9f0c8ddbaa4bd00e"}},{"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":"scripts/investigate-webgpu.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e24061060766a765e5224ca48199bca2a04b0033e186493ee5582e9daeeb79a"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but test/issue-demos.mjs and 4 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/issue-demos.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"814959f889fe9e49b21dadffca5c8593c5986beebcc33a70a2ad396bfb721953"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~380 LoC): no import path from any entry point (235 application, 1 tooling, 200 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-paths-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6913ec983633087784409cb7675fdfac0e939fea8d9dd7a24f2b2addb119901e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~149 LoC): no import path from any entry point (235 application, 1 tooling, 200 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-join.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d72b3eb1d0c5c9693af14166984fee9fff2d4fd556b405e453c11046226864c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fmtUSD\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/high-low-bands.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78a49919c839ba6a4132c1bd4e635e480fe4fb5258cd410b482d0c43f50a383"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027palette\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/line-paths.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0bc5c40f67c57e62fd5c288b5af53b90748d5ecb0ab7d7efb5e42aa0f6a165"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027data0\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/timezones-dst.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76869ad9e40f849b48bfc4d292fc9eafd40451673587726a514648f4724e8ef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027leapYear\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fmtDate.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f4bc1a2d662d02a35cf886fd7f68a7467e0dad22828ab313696e057cad6590"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mkDate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/opts.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2543de435c25a926211c4f10bca379d74039ac4ff2b5eaff7dbca65b2d3b89d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opts\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"288a7f7fcd2adabf884d1b5996b24b83834d54bc639e341a89df2abab5c618fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027invalidMode\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcb6231c3a92b5520e75ba1b85f5171ddcc7913c25c19e7916db4424ca22b03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027invalidSide\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f254547a981f5a388647735b56402c7c920f3cc5fdb5887b6097231d6a214290"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027invalidFilter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38eb8964c1183b8741b55f630c6a5fae45ef877e366fafa38b3cc2fc34dc79f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027invalidSort\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b1123abc44fbe5077b9184f44a374c3fc422302e7db6ba3b983a965507ee5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027invalidLimit\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dd9a3e4e8c30247a17ce95ec87de4fd5cbd5497a0f6ba71988854d20d7c219"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027invalidBounds\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/legend-selection-types.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dae60b27fd782a2301fb22669423108caea368279d489635f6c57aa8c80c6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027enabled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc2c35e467951dadd6373386e2a366b6aac8e824912c6629106706e7670a3a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027disabled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c153f9f5d610f580704515c2007f3ac6d5aaec2b9a5be4e5fee9b375d84b7bb7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027defaultConfig\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e12b61206a0cf1b29727f73dd248f7c6eae81c6af22ded8e83b2f7e03185f35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027undefinedCutoff\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef476749c1ec97d2973faf2dbab4a0dcb9c2cef95a685743f4d0b2cd333bea97"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027config\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ad90b380300aac22c56db44c46949d88510ba173935b2493a635dcc3d9a1bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027configuredAsinhScale\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d001b6a1951d4b5deba43568318438b7fdeef6eb703e7491402902771ee751"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ScanCutoff\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee16f1af455f056aca2daaf0aabecd7d2862ebc049ca872ce97af4a847628e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027stringCutoff\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f5381fcf4d899a408df45518ab59ab25d767ebb07625e9a8a80b5667711f7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nullCutoff\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"401e0e15e199a0138c342ce93a5e81dbc408a965d91394b01c25bc8d9741d202"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obsoleteCutoff\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68aafb0ff9c4f4957f05cc1a46b4ef7a61bfaa9a7598c3f0e3888ebce78078"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027empty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7888bd0df8ba8112aeafc1ac81fd72151c5baa75a8fad21420c4b503bef02696"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asinhScale\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6feb58f3354c21942156f28342448718cc208ef613ef5059e0a8dea6d133373"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027noQualifyingAsinhScale\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19739315fc1487c90327afbde0d8306f16e514ecf7c5786efe5ec2417bbe441"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ScanMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"75075a3f2e7ace6f83f55131f7521058eb456a787cfd2a449eef4897fe79012f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SeriesMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8642a70ab485a24d3d11187ab7e413a0e98588b98274858ad7003da57ded7625"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FacetMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"47434694ed9422127ce5a49000cc04e2dc07d79af0bb48d132dae43f84e2d205"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SeriesHasNoPrivateMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f34d4892c02bdd5c31d2b7bcc118e9056a9dbb78e6555ad7d42c667e3d7d53"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FacetHasNoPrivateMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee7ab347244dc313263c0f46f848e9f000ddfc159de980c4003d12a890eb9cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ScaleHasNoMinAbsCache\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc463954f8d36c31786b6131873f969e2ea80db3fbe703da917db02ad429c01"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027stringSeriesMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fc6c8f82b8cd9a8c533256165814b0fecedf685067082a2f094785f3f8ce2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027stringFacetMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbb059a6697a3253fb2b48d8c066413263dfef6480f041e579b8b50888fe87a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027scaleMinAbs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cb35848a83c033839e85279d9b5742190d97ac1ac90fff282563d060050c5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opts\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4170d26e6b5cda1f698785142e87fa9526f900aa5e1e6c0c191d1b75451443c4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SeriesScan\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f235740bc493a5ed29e2dd303b6d3b61b24e011f289635aaf54a91d0e2feea7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SeriesAuto\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd40a32e7318b7bd3e605beda00584be56929058d2bdbc145f8c6497445aa1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FacetScan\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a313f87294d608f95cc04faf5cdbb9a45a1dbba9db27fdcc9282c35851775"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FacetAuto\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f001d6cc58d309763ec39783387762ffff166d6dde42bb87ccf51129a857e43"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mode2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b701a6065d2e4498eada72bfe52c52630a1506cdf45019f41090c7eea155378b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027custom\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53abf2798fe12c6a7e77bc8081185931b1b77a233f097ee559686fec924f9f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027faceted\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e209f1150482c7d1a8907c51d424066dfff8fae21b626685850a40f3e5e2a6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SetRangeBounds\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07d11c174925fe8fe9fbae6641a86bcaa2ddaa301a370a40577861eff7d5560"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NumDecArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c9019c50d29fd1477a96c393a6c2008b2e37149b2c5ebc67d02b6e011b1579"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangePad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ce63223de11c26a61dbea5f9a07827fbac381dcdcfbbe01a9ab77aef8ab644"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangeHard\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f998e7435ceca3310e3e0133095ed33efba789f8880b3d0fdb2bb76315eb54"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangeSoft\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92217de9f2c5ee53fb31332207445d2ae5a355df37cdff573c64bb3af9b131"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangeFlat\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3137cb001830f15ad345bfe771ecd3451eea55d27e1fa686089039eca02a4137"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangeMin\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafd0fd24c2a140cb2c6c6992000339630f664ba15f28aa028cebe1432ec1f07"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangeMax\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33549e5ea59ce284b1554b0d6e1238400d038bc26407054d13aee69b6135870"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RangeZeroIf\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a8b91375e8a35bd79a516780433e97ffa2fbdda64ef4d9027606decbc1495e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027softRangeScale\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"066809192422d17b04b182fa27b6c91c3d17fb9a5f0e543dc59d60323608c9be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027seriesCallback\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc3d48280921e8cb0830dcc3e618879dfd91fd4dfbd4510ab58d833667d0346"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027seriesNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b57b0900694081748b40f58dc8e06b1de1829184b08b383fe31ba84a49f6ec2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027seriesAutoCallback\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf93a2c169c9474a687a19400b1a7cbe51ae3db50d074c54223acb88c5b7f2ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027seriesAutoNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73f835a62a6e0281a036d768378a165bb9c7264355fbbcefaae7280417bf9d5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027facetCallback\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae276c19504d77dbb594d257ea583c287fb701bc6b35a5c2c986bd3e4470e63"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027facetNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee63575c8df00f627e7d74b952293c66ffee3a97787ef53ac46cc4834ccfda8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027facetString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc267de5ea252e2d3ce0395ddd9513a1b291758fa79ef464366bc49a57743827"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027facetAutoCallback\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc14602d8522d8a09ea795b15d5206794f81872e8f7a17b83fcf9f9093c2619"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027facetAutoString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e70c13bd26f1bcffd4d38d15c1abb56a121c6732536f331d0e232773ae6d56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027booleanCallback\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b8349997aad3966fbfddacc94faa1798e7c1ad39fa042ec3c284c26f335e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027perSeries\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3223d66775c75715bbf7c9072bf2521585e3e7250ddda0a3e851afaef08165cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027requiredResetArgument\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5daebbcc5437e28cf0d986c93205c743aea49f070cf65c346665e2bffabd02"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nonNullableRange\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scale-scan-types.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dff526ef69148adc9481aa77037ae485cbc9cba8656a8ce9a76bf5364998a09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(timeoutMs) || timeoutMs \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/bench-sample-timeout.mjs, scripts/bench-webgpu.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-sample-timeout.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"04611ef777f0239b8df697086b11cded3f5b4aaa6a43074f76c1e8910b6b94b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(rootPid) || rootPid \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/bench-browser-process.mjs, scripts/bench-process-memory.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-browser-process.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c88ea1c64196c413cd6c0b3bad30b5383c689485c2e2f8db85bdc45f637c802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!dependency.type || dependency.type === \u0027script\u0027 || dependency.type === \u0027style\u0027\u0060 appears character-identically in 2 files \u2014 docs/investigations/benchmark-d3-memory-rerun.mjs, docs/investigations/benchmark-d3-residual-rerun.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/investigations/benchmark-d3-memory-rerun.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e26655e3d2aaaa374bfe74e91ab710d558d02d3d629b1a8319102c34d82ada"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060browser \u0026\u0026 browser.exitCode === null \u0026\u0026 browser.signalCode === null\u0060 appears character-identically in 2 files \u2014 scripts/investigate-g2-webgl-fill.mjs, scripts/investigate-webgpu.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69b96a114f2ea9e4fbad7f68f90a4920e553c537498f48a041861685c942dba"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 5/6 async functions that make a cancellable request (fetch, axios, ky, ofetch) 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":"scripts/benchmarks-paths-browser.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b10c40a3effc1da5a613868ed8bda2944007404fe8b34b2fcd378a83b0becc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-heatmap-grid-browser.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dde60765b23d91cfa1712a5d5d1589b5ace3708e3d106fe7d1be6519e0d767e"}},{"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":"scripts/bench-heatmap-grid-browser.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc0f549bcc84a48957a74f77a32d263d8edc117031d1f4f7909f41cc8f5aa53"}},{"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":"scripts/bench-heatmap-grid-browser.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4e6e025b7bba2c0d2d2ef98bba65aa37bf2f111b629b336630ddc6c7ed8d89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-hover.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1477b9d9ee4bf0eea81c9c5a451455f1ea19b06138de103667703ef73a37ee8e"}},{"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":"scripts/bench-hover.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b39e27b3221bcd0a782a09ea5a7e093b56b097267468a003c7a6df3ec92474"}},{"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":"scripts/bench-hover.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dd8524e81b9d6f4e208b72ca63bd0f9203d63503b344081f1fcd6b614bd434"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-legend.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9ef2ac9bb6a50deb9a6e88ac52ec67affb7665a457003ac2aaeff02b9c658c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bench-sample-timeout.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdd004a3d15d6daa63fe99611c752898a37fee1595e6a8f3ad8b076f06e9165"}},{"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":"scripts/bench-sample-timeout.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5c72471fa2f45e7a55845d4067d19259bb191fbdc6a3a76aae35c3ce0ac0f3"}},{"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":"scripts/bench-webgl.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19793a57c254702708dbea2fffd2a38a6a57c27aba3a7ab047691614c8aee7f"}},{"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":"scripts/bench-webgl.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03d484756dd205f38e401b0bc007b0b09ff414095b042963c3d66cf2fbf7e75"}},{"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, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-mouse.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"117ac8deebd068335cc82bae146f3c277d3e11d243812988b3c8381168bad3f7"}},{"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":"scripts/benchmarks-mouse.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a49eebd52069bed25438c5facf87f7879d101a4bfc77c4f1379e054401bf22a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180f09d11574fa39a7ba3f441dd7bb9244fde43fef613fb165ef1d261252c65"}},{"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":"scripts/benchmarks-trace.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02f34c0f4b9295887ea0d39861df6f82c754fa796031ad21835e18ee2abf26f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks-trace.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6584b027318870fa73aabd53bfc75d03009e426012a323f16833be94f2d5bb11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmarks.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"adddd6f470ff77e801a7e5929c1bfd79c8f7b3a95d54d75ae2a52539b2e5df00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0997da3c161753d31f2e477d1b9438e50fe4ef8179ba7d839d0d9bef14013973"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f6a828b98b5ab537a4d018385a872f4edff6bcf4ebddf800ab0ed4212491e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/investigate-g2-webgl-fill.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ad2d529ca6ecdd80e17be92f020b378be08a2fe0c08d8bed21fa9e010a576d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/investigate-webgpu.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a759aedd29c83f89b720ab47d6444a20794cb987235ef5fbc11588b73c3d0aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/investigate-webgpu.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57360e2577bf6fb1df1ac4f4ae2dec3277bacce995a0660c0729d86fc91f08a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-manual.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e023135e296ba8f72b5d8ec844d125316ff2c82878160dc9f1dc936b2f8b264"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/profile-manual.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa5d246a0299027590d75aabea02abe8a6a8ba42a1040665835a4273e6109a9"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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/"}]}],"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":9,"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."]}]}